About the Execution of ITS-Tools for AutoFlight-PT-24b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16247.020 | 3600000.00 | 9585554.00 | 126319.70 | FF??TFF?FFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990100490.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 AutoFlight-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990100490
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 137K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 538K 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 AutoFlight-PT-24b-00
FORMULA_NAME AutoFlight-PT-24b-01
FORMULA_NAME AutoFlight-PT-24b-02
FORMULA_NAME AutoFlight-PT-24b-03
FORMULA_NAME AutoFlight-PT-24b-04
FORMULA_NAME AutoFlight-PT-24b-05
FORMULA_NAME AutoFlight-PT-24b-06
FORMULA_NAME AutoFlight-PT-24b-07
FORMULA_NAME AutoFlight-PT-24b-08
FORMULA_NAME AutoFlight-PT-24b-09
FORMULA_NAME AutoFlight-PT-24b-10
FORMULA_NAME AutoFlight-PT-24b-11
FORMULA_NAME AutoFlight-PT-24b-12
FORMULA_NAME AutoFlight-PT-24b-13
FORMULA_NAME AutoFlight-PT-24b-14
FORMULA_NAME AutoFlight-PT-24b-15
=== Now, execution of the tool begins
BK_START 1620475308203
Running Version 0
[2021-05-08 12:01:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 12:01:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 12:01:50] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2021-05-08 12:01:50] [INFO ] Transformed 2230 places.
[2021-05-08 12:01:50] [INFO ] Transformed 2228 transitions.
[2021-05-08 12:01:50] [INFO ] Found NUPN structural information;
[2021-05-08 12:01:50] [INFO ] Parsed PT model containing 2230 places and 2228 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-08 12:01:50] [INFO ] Initial state test concluded for 3 properties.
FORMULA AutoFlight-PT-24b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 2230 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Discarding 309 places :
Symmetric choice reduction at 0 with 309 rule applications. Total rules 309 place count 1921 transition count 1919
Iterating global reduction 0 with 309 rules applied. Total rules applied 618 place count 1921 transition count 1919
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 666 place count 1921 transition count 1871
Discarding 131 places :
Symmetric choice reduction at 1 with 131 rule applications. Total rules 797 place count 1790 transition count 1740
Iterating global reduction 1 with 131 rules applied. Total rules applied 928 place count 1790 transition count 1740
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 950 place count 1768 transition count 1718
Iterating global reduction 1 with 22 rules applied. Total rules applied 972 place count 1768 transition count 1718
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 993 place count 1747 transition count 1697
Iterating global reduction 1 with 21 rules applied. Total rules applied 1014 place count 1747 transition count 1697
Applied a total of 1014 rules in 942 ms. Remains 1747 /2230 variables (removed 483) and now considering 1697/2228 (removed 531) transitions.
// Phase 1: matrix 1697 rows 1747 cols
[2021-05-08 12:01:51] [INFO ] Computed 148 place invariants in 45 ms
[2021-05-08 12:01:52] [INFO ] Implicit Places using invariants in 666 ms returned []
// Phase 1: matrix 1697 rows 1747 cols
[2021-05-08 12:01:52] [INFO ] Computed 148 place invariants in 12 ms
[2021-05-08 12:01:53] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2499 ms to find 0 implicit places.
// Phase 1: matrix 1697 rows 1747 cols
[2021-05-08 12:01:53] [INFO ] Computed 148 place invariants in 18 ms
[2021-05-08 12:01:54] [INFO ] Dead Transitions using invariants and state equation in 1128 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1747/2230 places, 1697/2228 transitions.
[2021-05-08 12:01:55] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-08 12:01:55] [INFO ] Flatten gal took : 156 ms
FORMULA AutoFlight-PT-24b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 12:01:55] [INFO ] Flatten gal took : 80 ms
[2021-05-08 12:01:55] [INFO ] Input system was already deterministic with 1697 transitions.
Incomplete random walk after 100000 steps, including 94 resets, run finished after 640 ms. (steps per millisecond=156 ) properties (out of 37) seen :26
Running SMT prover for 11 properties.
// Phase 1: matrix 1697 rows 1747 cols
[2021-05-08 12:01:56] [INFO ] Computed 148 place invariants in 9 ms
[2021-05-08 12:01:56] [INFO ] [Real]Absence check using 147 positive place invariants in 71 ms returned sat
[2021-05-08 12:01:56] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:01:57] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2021-05-08 12:01:57] [INFO ] Deduced a trap composed of 15 places in 502 ms of which 9 ms to minimize.
[2021-05-08 12:01:58] [INFO ] Deduced a trap composed of 49 places in 458 ms of which 2 ms to minimize.
[2021-05-08 12:01:59] [INFO ] Deduced a trap composed of 120 places in 486 ms of which 2 ms to minimize.
[2021-05-08 12:01:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1722 ms
[2021-05-08 12:01:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:01:59] [INFO ] [Nat]Absence check using 147 positive place invariants in 70 ms returned sat
[2021-05-08 12:01:59] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:01:59] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2021-05-08 12:02:00] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 2 ms to minimize.
[2021-05-08 12:02:01] [INFO ] Deduced a trap composed of 49 places in 453 ms of which 1 ms to minimize.
[2021-05-08 12:02:01] [INFO ] Deduced a trap composed of 120 places in 394 ms of which 2 ms to minimize.
[2021-05-08 12:02:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1557 ms
[2021-05-08 12:02:01] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 90 ms.
[2021-05-08 12:02:19] [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-08 12:02:19] [INFO ] [Real]Absence check using 147 positive place invariants in 76 ms returned sat
[2021-05-08 12:02:19] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:02:20] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2021-05-08 12:02:20] [INFO ] Deduced a trap composed of 220 places in 448 ms of which 1 ms to minimize.
[2021-05-08 12:02:21] [INFO ] Deduced a trap composed of 57 places in 447 ms of which 1 ms to minimize.
[2021-05-08 12:02:21] [INFO ] Deduced a trap composed of 206 places in 447 ms of which 1 ms to minimize.
[2021-05-08 12:02:22] [INFO ] Deduced a trap composed of 261 places in 430 ms of which 1 ms to minimize.
[2021-05-08 12:02:22] [INFO ] Deduced a trap composed of 127 places in 454 ms of which 1 ms to minimize.
[2021-05-08 12:02:23] [INFO ] Deduced a trap composed of 137 places in 424 ms of which 1 ms to minimize.
[2021-05-08 12:02:23] [INFO ] Deduced a trap composed of 162 places in 464 ms of which 1 ms to minimize.
[2021-05-08 12:02:24] [INFO ] Deduced a trap composed of 188 places in 437 ms of which 1 ms to minimize.
[2021-05-08 12:02:24] [INFO ] Deduced a trap composed of 209 places in 442 ms of which 1 ms to minimize.
[2021-05-08 12:02:25] [INFO ] Deduced a trap composed of 165 places in 413 ms of which 1 ms to minimize.
[2021-05-08 12:02:25] [INFO ] Deduced a trap composed of 58 places in 422 ms of which 1 ms to minimize.
[2021-05-08 12:02:26] [INFO ] Deduced a trap composed of 357 places in 413 ms of which 1 ms to minimize.
[2021-05-08 12:02:26] [INFO ] Deduced a trap composed of 159 places in 418 ms of which 1 ms to minimize.
[2021-05-08 12:02:27] [INFO ] Deduced a trap composed of 174 places in 544 ms of which 1 ms to minimize.
[2021-05-08 12:02:27] [INFO ] Deduced a trap composed of 214 places in 423 ms of which 2 ms to minimize.
[2021-05-08 12:02:28] [INFO ] Deduced a trap composed of 262 places in 391 ms of which 1 ms to minimize.
[2021-05-08 12:02:28] [INFO ] Deduced a trap composed of 263 places in 482 ms of which 1 ms to minimize.
[2021-05-08 12:02:29] [INFO ] Deduced a trap composed of 259 places in 409 ms of which 1 ms to minimize.
[2021-05-08 12:02:29] [INFO ] Deduced a trap composed of 269 places in 423 ms of which 1 ms to minimize.
[2021-05-08 12:02:30] [INFO ] Deduced a trap composed of 284 places in 409 ms of which 1 ms to minimize.
[2021-05-08 12:02:30] [INFO ] Deduced a trap composed of 269 places in 402 ms of which 1 ms to minimize.
[2021-05-08 12:02:31] [INFO ] Deduced a trap composed of 244 places in 428 ms of which 1 ms to minimize.
[2021-05-08 12:02:31] [INFO ] Deduced a trap composed of 296 places in 419 ms of which 1 ms to minimize.
[2021-05-08 12:02:31] [INFO ] Deduced a trap composed of 253 places in 420 ms of which 1 ms to minimize.
[2021-05-08 12:02:32] [INFO ] Deduced a trap composed of 305 places in 404 ms of which 1 ms to minimize.
[2021-05-08 12:02:32] [INFO ] Deduced a trap composed of 244 places in 426 ms of which 2 ms to minimize.
[2021-05-08 12:02:33] [INFO ] Deduced a trap composed of 264 places in 436 ms of which 1 ms to minimize.
[2021-05-08 12:02:33] [INFO ] Deduced a trap composed of 268 places in 424 ms of which 5 ms to minimize.
[2021-05-08 12:02:34] [INFO ] Deduced a trap composed of 270 places in 423 ms of which 1 ms to minimize.
[2021-05-08 12:02:34] [INFO ] Deduced a trap composed of 305 places in 419 ms of which 1 ms to minimize.
[2021-05-08 12:02:35] [INFO ] Deduced a trap composed of 249 places in 412 ms of which 1 ms to minimize.
[2021-05-08 12:02:35] [INFO ] Deduced a trap composed of 260 places in 371 ms of which 1 ms to minimize.
[2021-05-08 12:02:36] [INFO ] Deduced a trap composed of 264 places in 415 ms of which 1 ms to minimize.
[2021-05-08 12:02:36] [INFO ] Deduced a trap composed of 301 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:02:37] [INFO ] Deduced a trap composed of 270 places in 396 ms of which 1 ms to minimize.
[2021-05-08 12:02:37] [INFO ] Deduced a trap composed of 282 places in 405 ms of which 1 ms to minimize.
[2021-05-08 12:02:38] [INFO ] Deduced a trap composed of 268 places in 409 ms of which 2 ms to minimize.
[2021-05-08 12:02:38] [INFO ] Deduced a trap composed of 285 places in 389 ms of which 1 ms to minimize.
[2021-05-08 12:02:39] [INFO ] Deduced a trap composed of 266 places in 380 ms of which 1 ms to minimize.
[2021-05-08 12:02:39] [INFO ] Deduced a trap composed of 281 places in 402 ms of which 17 ms to minimize.
[2021-05-08 12:02:39] [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-08 12:02:39] [INFO ] [Real]Absence check using 147 positive place invariants in 68 ms returned sat
[2021-05-08 12:02:39] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 12:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:02:40] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2021-05-08 12:02:40] [INFO ] Deduced a trap composed of 53 places in 419 ms of which 1 ms to minimize.
[2021-05-08 12:02:41] [INFO ] Deduced a trap composed of 126 places in 427 ms of which 1 ms to minimize.
[2021-05-08 12:02:41] [INFO ] Deduced a trap composed of 99 places in 395 ms of which 1 ms to minimize.
[2021-05-08 12:02:42] [INFO ] Deduced a trap composed of 126 places in 387 ms of which 1 ms to minimize.
[2021-05-08 12:02:42] [INFO ] Deduced a trap composed of 124 places in 379 ms of which 1 ms to minimize.
[2021-05-08 12:02:43] [INFO ] Deduced a trap composed of 137 places in 404 ms of which 1 ms to minimize.
[2021-05-08 12:02:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2849 ms
[2021-05-08 12:02:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:02:43] [INFO ] [Nat]Absence check using 147 positive place invariants in 70 ms returned sat
[2021-05-08 12:02:43] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 12:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:02:44] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2021-05-08 12:02:44] [INFO ] Deduced a trap composed of 53 places in 432 ms of which 1 ms to minimize.
[2021-05-08 12:02:45] [INFO ] Deduced a trap composed of 126 places in 420 ms of which 1 ms to minimize.
[2021-05-08 12:02:45] [INFO ] Deduced a trap composed of 99 places in 408 ms of which 1 ms to minimize.
[2021-05-08 12:02:45] [INFO ] Deduced a trap composed of 126 places in 405 ms of which 16 ms to minimize.
[2021-05-08 12:02:46] [INFO ] Deduced a trap composed of 124 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:02:46] [INFO ] Deduced a trap composed of 137 places in 391 ms of which 1 ms to minimize.
[2021-05-08 12:02:47] [INFO ] Deduced a trap composed of 125 places in 430 ms of which 1 ms to minimize.
[2021-05-08 12:02:47] [INFO ] Deduced a trap composed of 210 places in 414 ms of which 1 ms to minimize.
[2021-05-08 12:02:48] [INFO ] Deduced a trap composed of 127 places in 394 ms of which 1 ms to minimize.
[2021-05-08 12:02:48] [INFO ] Deduced a trap composed of 191 places in 388 ms of which 1 ms to minimize.
[2021-05-08 12:02:49] [INFO ] Deduced a trap composed of 251 places in 389 ms of which 1 ms to minimize.
[2021-05-08 12:02:49] [INFO ] Deduced a trap composed of 216 places in 420 ms of which 1 ms to minimize.
[2021-05-08 12:02:50] [INFO ] Deduced a trap composed of 281 places in 411 ms of which 1 ms to minimize.
[2021-05-08 12:02:50] [INFO ] Deduced a trap composed of 165 places in 388 ms of which 2 ms to minimize.
[2021-05-08 12:02:51] [INFO ] Deduced a trap composed of 226 places in 402 ms of which 2 ms to minimize.
[2021-05-08 12:02:51] [INFO ] Deduced a trap composed of 216 places in 412 ms of which 1 ms to minimize.
[2021-05-08 12:02:51] [INFO ] Deduced a trap composed of 165 places in 393 ms of which 2 ms to minimize.
[2021-05-08 12:02:52] [INFO ] Deduced a trap composed of 285 places in 381 ms of which 1 ms to minimize.
[2021-05-08 12:02:52] [INFO ] Deduced a trap composed of 216 places in 389 ms of which 1 ms to minimize.
[2021-05-08 12:02:53] [INFO ] Deduced a trap composed of 285 places in 376 ms of which 1 ms to minimize.
[2021-05-08 12:02:53] [INFO ] Deduced a trap composed of 214 places in 394 ms of which 1 ms to minimize.
[2021-05-08 12:02:54] [INFO ] Deduced a trap composed of 303 places in 351 ms of which 1 ms to minimize.
[2021-05-08 12:02:54] [INFO ] Deduced a trap composed of 186 places in 384 ms of which 1 ms to minimize.
[2021-05-08 12:02:54] [INFO ] Deduced a trap composed of 253 places in 368 ms of which 1 ms to minimize.
[2021-05-08 12:02:55] [INFO ] Deduced a trap composed of 212 places in 351 ms of which 1 ms to minimize.
[2021-05-08 12:02:55] [INFO ] Deduced a trap composed of 281 places in 383 ms of which 1 ms to minimize.
[2021-05-08 12:02:56] [INFO ] Deduced a trap composed of 214 places in 367 ms of which 1 ms to minimize.
[2021-05-08 12:02:56] [INFO ] Deduced a trap composed of 299 places in 326 ms of which 1 ms to minimize.
[2021-05-08 12:02:57] [INFO ] Deduced a trap composed of 189 places in 362 ms of which 1 ms to minimize.
[2021-05-08 12:02:57] [INFO ] Deduced a trap composed of 152 places in 341 ms of which 1 ms to minimize.
[2021-05-08 12:02:57] [INFO ] Deduced a trap composed of 163 places in 348 ms of which 1 ms to minimize.
[2021-05-08 12:02:57] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 13861 ms
[2021-05-08 12:02:58] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 97 ms.
[2021-05-08 12:03:04] [INFO ] Deduced a trap composed of 16 places in 848 ms of which 13 ms to minimize.
[2021-05-08 12:03:04] [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-08 12:03:04] [INFO ] [Real]Absence check using 147 positive place invariants in 70 ms returned sat
[2021-05-08 12:03:04] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 12:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:03:05] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2021-05-08 12:03:05] [INFO ] Deduced a trap composed of 91 places in 477 ms of which 2 ms to minimize.
[2021-05-08 12:03:06] [INFO ] Deduced a trap composed of 111 places in 408 ms of which 1 ms to minimize.
[2021-05-08 12:03:06] [INFO ] Deduced a trap composed of 125 places in 416 ms of which 1 ms to minimize.
[2021-05-08 12:03:06] [INFO ] Deduced a trap composed of 96 places in 404 ms of which 1 ms to minimize.
[2021-05-08 12:03:07] [INFO ] Deduced a trap composed of 99 places in 418 ms of which 2 ms to minimize.
[2021-05-08 12:03:07] [INFO ] Deduced a trap composed of 135 places in 394 ms of which 1 ms to minimize.
[2021-05-08 12:03:08] [INFO ] Deduced a trap composed of 242 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:03:08] [INFO ] Deduced a trap composed of 242 places in 401 ms of which 1 ms to minimize.
[2021-05-08 12:03:09] [INFO ] Deduced a trap composed of 185 places in 401 ms of which 1 ms to minimize.
[2021-05-08 12:03:09] [INFO ] Deduced a trap composed of 208 places in 386 ms of which 1 ms to minimize.
[2021-05-08 12:03:10] [INFO ] Deduced a trap composed of 193 places in 385 ms of which 1 ms to minimize.
[2021-05-08 12:03:10] [INFO ] Deduced a trap composed of 232 places in 383 ms of which 1 ms to minimize.
[2021-05-08 12:03:11] [INFO ] Deduced a trap composed of 161 places in 393 ms of which 1 ms to minimize.
[2021-05-08 12:03:11] [INFO ] Deduced a trap composed of 212 places in 328 ms of which 1 ms to minimize.
[2021-05-08 12:03:11] [INFO ] Deduced a trap composed of 210 places in 313 ms of which 1 ms to minimize.
[2021-05-08 12:03:12] [INFO ] Deduced a trap composed of 221 places in 313 ms of which 0 ms to minimize.
[2021-05-08 12:03:12] [INFO ] Deduced a trap composed of 213 places in 297 ms of which 1 ms to minimize.
[2021-05-08 12:03:12] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7613 ms
[2021-05-08 12:03:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:03:12] [INFO ] [Nat]Absence check using 147 positive place invariants in 68 ms returned sat
[2021-05-08 12:03:12] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 12:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:03:13] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2021-05-08 12:03:14] [INFO ] Deduced a trap composed of 91 places in 445 ms of which 1 ms to minimize.
[2021-05-08 12:03:14] [INFO ] Deduced a trap composed of 111 places in 416 ms of which 1 ms to minimize.
[2021-05-08 12:03:14] [INFO ] Deduced a trap composed of 125 places in 422 ms of which 1 ms to minimize.
[2021-05-08 12:03:15] [INFO ] Deduced a trap composed of 96 places in 439 ms of which 1 ms to minimize.
[2021-05-08 12:03:15] [INFO ] Deduced a trap composed of 99 places in 403 ms of which 1 ms to minimize.
[2021-05-08 12:03:16] [INFO ] Deduced a trap composed of 135 places in 381 ms of which 1 ms to minimize.
[2021-05-08 12:03:16] [INFO ] Deduced a trap composed of 242 places in 400 ms of which 1 ms to minimize.
[2021-05-08 12:03:17] [INFO ] Deduced a trap composed of 242 places in 401 ms of which 1 ms to minimize.
[2021-05-08 12:03:17] [INFO ] Deduced a trap composed of 185 places in 397 ms of which 2 ms to minimize.
[2021-05-08 12:03:18] [INFO ] Deduced a trap composed of 208 places in 397 ms of which 1 ms to minimize.
[2021-05-08 12:03:18] [INFO ] Deduced a trap composed of 193 places in 402 ms of which 1 ms to minimize.
[2021-05-08 12:03:19] [INFO ] Deduced a trap composed of 232 places in 374 ms of which 1 ms to minimize.
[2021-05-08 12:03:19] [INFO ] Deduced a trap composed of 161 places in 384 ms of which 1 ms to minimize.
[2021-05-08 12:03:19] [INFO ] Deduced a trap composed of 70 places in 382 ms of which 1 ms to minimize.
[2021-05-08 12:03:20] [INFO ] Deduced a trap composed of 251 places in 381 ms of which 1 ms to minimize.
[2021-05-08 12:03:20] [INFO ] Deduced a trap composed of 142 places in 379 ms of which 1 ms to minimize.
[2021-05-08 12:03:21] [INFO ] Deduced a trap composed of 253 places in 376 ms of which 2 ms to minimize.
[2021-05-08 12:03:21] [INFO ] Deduced a trap composed of 164 places in 378 ms of which 1 ms to minimize.
[2021-05-08 12:03:21] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8220 ms
[2021-05-08 12:03:21] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 83 ms.
[2021-05-08 12:03:32] [INFO ] Added : 655 causal constraints over 131 iterations in 10968 ms. Result :unknown
[2021-05-08 12:03:32] [INFO ] [Real]Absence check using 147 positive place invariants in 101 ms returned sat
[2021-05-08 12:03:33] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 12:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:03:33] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2021-05-08 12:03:34] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 1 ms to minimize.
[2021-05-08 12:03:40] [INFO ] Deduced a trap composed of 84 places in 6039 ms of which 1 ms to minimize.
[2021-05-08 12:03:40] [INFO ] Deduced a trap composed of 117 places in 432 ms of which 1 ms to minimize.
[2021-05-08 12:03:41] [INFO ] Deduced a trap composed of 85 places in 443 ms of which 2 ms to minimize.
[2021-05-08 12:03:41] [INFO ] Deduced a trap composed of 125 places in 420 ms of which 1 ms to minimize.
[2021-05-08 12:03:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 8118 ms
[2021-05-08 12:03:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:03:42] [INFO ] [Nat]Absence check using 147 positive place invariants in 95 ms returned sat
[2021-05-08 12:03:42] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 12:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:03:42] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2021-05-08 12:03:43] [INFO ] Deduced a trap composed of 47 places in 442 ms of which 1 ms to minimize.
[2021-05-08 12:03:43] [INFO ] Deduced a trap composed of 84 places in 428 ms of which 2 ms to minimize.
[2021-05-08 12:03:44] [INFO ] Deduced a trap composed of 117 places in 433 ms of which 1 ms to minimize.
[2021-05-08 12:03:44] [INFO ] Deduced a trap composed of 85 places in 436 ms of which 1 ms to minimize.
[2021-05-08 12:03:45] [INFO ] Deduced a trap composed of 125 places in 429 ms of which 1 ms to minimize.
[2021-05-08 12:03:45] [INFO ] Deduced a trap composed of 31 places in 430 ms of which 1 ms to minimize.
[2021-05-08 12:03:46] [INFO ] Deduced a trap composed of 238 places in 423 ms of which 1 ms to minimize.
[2021-05-08 12:03:46] [INFO ] Deduced a trap composed of 95 places in 405 ms of which 1 ms to minimize.
[2021-05-08 12:03:46] [INFO ] Deduced a trap composed of 115 places in 431 ms of which 1 ms to minimize.
[2021-05-08 12:03:47] [INFO ] Deduced a trap composed of 147 places in 423 ms of which 1 ms to minimize.
[2021-05-08 12:03:47] [INFO ] Deduced a trap composed of 271 places in 411 ms of which 1 ms to minimize.
[2021-05-08 12:03:48] [INFO ] Deduced a trap composed of 275 places in 440 ms of which 1 ms to minimize.
[2021-05-08 12:03:48] [INFO ] Deduced a trap composed of 262 places in 404 ms of which 1 ms to minimize.
[2021-05-08 12:03:49] [INFO ] Deduced a trap composed of 241 places in 415 ms of which 1 ms to minimize.
[2021-05-08 12:03:49] [INFO ] Deduced a trap composed of 269 places in 425 ms of which 1 ms to minimize.
[2021-05-08 12:03:50] [INFO ] Deduced a trap composed of 261 places in 404 ms of which 1 ms to minimize.
[2021-05-08 12:03:50] [INFO ] Deduced a trap composed of 256 places in 412 ms of which 1 ms to minimize.
[2021-05-08 12:03:51] [INFO ] Deduced a trap composed of 141 places in 420 ms of which 1 ms to minimize.
[2021-05-08 12:03:51] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8685 ms
[2021-05-08 12:03:51] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 86 ms.
[2021-05-08 12:04:02] [INFO ] Deduced a trap composed of 16 places in 796 ms of which 9 ms to minimize.
[2021-05-08 12:04: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 4
[2021-05-08 12:04:03] [INFO ] [Real]Absence check using 147 positive place invariants in 140 ms returned sat
[2021-05-08 12:04:03] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 12:04:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:04:03] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2021-05-08 12:04:04] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 1 ms to minimize.
[2021-05-08 12:04:04] [INFO ] Deduced a trap composed of 99 places in 418 ms of which 1 ms to minimize.
[2021-05-08 12:04:05] [INFO ] Deduced a trap composed of 116 places in 396 ms of which 1 ms to minimize.
[2021-05-08 12:04:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1513 ms
[2021-05-08 12:04:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:04:05] [INFO ] [Nat]Absence check using 147 positive place invariants in 69 ms returned sat
[2021-05-08 12:04:05] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:04:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:04:05] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2021-05-08 12:04:06] [INFO ] Deduced a trap composed of 23 places in 456 ms of which 1 ms to minimize.
[2021-05-08 12:04:06] [INFO ] Deduced a trap composed of 99 places in 414 ms of which 1 ms to minimize.
[2021-05-08 12:04:07] [INFO ] Deduced a trap composed of 116 places in 406 ms of which 1 ms to minimize.
[2021-05-08 12:04:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1507 ms
[2021-05-08 12:04:07] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 86 ms.
[2021-05-08 12:04: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 5
[2021-05-08 12:04:25] [INFO ] [Real]Absence check using 147 positive place invariants in 68 ms returned sat
[2021-05-08 12:04:25] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:04:25] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2021-05-08 12:04:26] [INFO ] Deduced a trap composed of 132 places in 410 ms of which 1 ms to minimize.
[2021-05-08 12:04:26] [INFO ] Deduced a trap composed of 124 places in 417 ms of which 1 ms to minimize.
[2021-05-08 12:04:27] [INFO ] Deduced a trap composed of 93 places in 427 ms of which 1 ms to minimize.
[2021-05-08 12:04:27] [INFO ] Deduced a trap composed of 116 places in 429 ms of which 2 ms to minimize.
[2021-05-08 12:04:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1972 ms
[2021-05-08 12:04:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:04:28] [INFO ] [Nat]Absence check using 147 positive place invariants in 71 ms returned sat
[2021-05-08 12:04:28] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:04:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:04:28] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2021-05-08 12:04:29] [INFO ] Deduced a trap composed of 132 places in 435 ms of which 1 ms to minimize.
[2021-05-08 12:04:29] [INFO ] Deduced a trap composed of 124 places in 413 ms of which 1 ms to minimize.
[2021-05-08 12:04:30] [INFO ] Deduced a trap composed of 93 places in 428 ms of which 1 ms to minimize.
[2021-05-08 12:04:30] [INFO ] Deduced a trap composed of 116 places in 396 ms of which 1 ms to minimize.
[2021-05-08 12:04:31] [INFO ] Deduced a trap composed of 258 places in 393 ms of which 1 ms to minimize.
[2021-05-08 12:04:31] [INFO ] Deduced a trap composed of 102 places in 395 ms of which 1 ms to minimize.
[2021-05-08 12:04:32] [INFO ] Deduced a trap composed of 250 places in 411 ms of which 1 ms to minimize.
[2021-05-08 12:04:32] [INFO ] Deduced a trap composed of 259 places in 391 ms of which 1 ms to minimize.
[2021-05-08 12:04:33] [INFO ] Deduced a trap composed of 115 places in 393 ms of which 1 ms to minimize.
[2021-05-08 12:04:33] [INFO ] Deduced a trap composed of 265 places in 406 ms of which 1 ms to minimize.
[2021-05-08 12:04:33] [INFO ] Deduced a trap composed of 261 places in 399 ms of which 1 ms to minimize.
[2021-05-08 12:04:34] [INFO ] Deduced a trap composed of 223 places in 399 ms of which 1 ms to minimize.
[2021-05-08 12:04:34] [INFO ] Deduced a trap composed of 145 places in 396 ms of which 1 ms to minimize.
[2021-05-08 12:04:35] [INFO ] Deduced a trap composed of 264 places in 406 ms of which 1 ms to minimize.
[2021-05-08 12:04:35] [INFO ] Deduced a trap composed of 136 places in 404 ms of which 1 ms to minimize.
[2021-05-08 12:04:36] [INFO ] Deduced a trap composed of 143 places in 401 ms of which 1 ms to minimize.
[2021-05-08 12:04:36] [INFO ] Deduced a trap composed of 137 places in 374 ms of which 1 ms to minimize.
[2021-05-08 12:04:36] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7843 ms
[2021-05-08 12:04:36] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 99 ms.
[2021-05-08 12:04:48] [INFO ] Deduced a trap composed of 16 places in 807 ms of which 12 ms to minimize.
[2021-05-08 12:04:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-08 12:04:49] [INFO ] [Real]Absence check using 147 positive place invariants in 74 ms returned sat
[2021-05-08 12:04:49] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:04:49] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2021-05-08 12:04:50] [INFO ] Deduced a trap composed of 84 places in 418 ms of which 2 ms to minimize.
[2021-05-08 12:04:50] [INFO ] Deduced a trap composed of 102 places in 421 ms of which 1 ms to minimize.
[2021-05-08 12:04:51] [INFO ] Deduced a trap composed of 103 places in 440 ms of which 2 ms to minimize.
[2021-05-08 12:04:51] [INFO ] Deduced a trap composed of 270 places in 420 ms of which 1 ms to minimize.
[2021-05-08 12:04:52] [INFO ] Deduced a trap composed of 143 places in 419 ms of which 1 ms to minimize.
[2021-05-08 12:04:52] [INFO ] Deduced a trap composed of 258 places in 411 ms of which 1 ms to minimize.
[2021-05-08 12:04:53] [INFO ] Deduced a trap composed of 139 places in 435 ms of which 1 ms to minimize.
[2021-05-08 12:04:53] [INFO ] Deduced a trap composed of 137 places in 398 ms of which 1 ms to minimize.
[2021-05-08 12:04:54] [INFO ] Deduced a trap composed of 141 places in 416 ms of which 1 ms to minimize.
[2021-05-08 12:04:54] [INFO ] Deduced a trap composed of 236 places in 399 ms of which 1 ms to minimize.
[2021-05-08 12:04:54] [INFO ] Deduced a trap composed of 259 places in 423 ms of which 1 ms to minimize.
[2021-05-08 12:04:55] [INFO ] Deduced a trap composed of 144 places in 422 ms of which 1 ms to minimize.
[2021-05-08 12:04:55] [INFO ] Deduced a trap composed of 281 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:04:56] [INFO ] Deduced a trap composed of 142 places in 421 ms of which 1 ms to minimize.
[2021-05-08 12:04:56] [INFO ] Deduced a trap composed of 164 places in 413 ms of which 1 ms to minimize.
[2021-05-08 12:04:57] [INFO ] Deduced a trap composed of 150 places in 429 ms of which 1 ms to minimize.
[2021-05-08 12:04:57] [INFO ] Deduced a trap composed of 157 places in 439 ms of which 1 ms to minimize.
[2021-05-08 12:04:58] [INFO ] Deduced a trap composed of 256 places in 413 ms of which 1 ms to minimize.
[2021-05-08 12:04:58] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8607 ms
[2021-05-08 12:04:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:04:58] [INFO ] [Nat]Absence check using 147 positive place invariants in 79 ms returned sat
[2021-05-08 12:04:58] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:04:59] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2021-05-08 12:04:59] [INFO ] Deduced a trap composed of 84 places in 447 ms of which 1 ms to minimize.
[2021-05-08 12:05:00] [INFO ] Deduced a trap composed of 102 places in 438 ms of which 1 ms to minimize.
[2021-05-08 12:05:00] [INFO ] Deduced a trap composed of 103 places in 449 ms of which 1 ms to minimize.
[2021-05-08 12:05:01] [INFO ] Deduced a trap composed of 270 places in 422 ms of which 1 ms to minimize.
[2021-05-08 12:05:01] [INFO ] Deduced a trap composed of 143 places in 442 ms of which 2 ms to minimize.
[2021-05-08 12:05:02] [INFO ] Deduced a trap composed of 258 places in 388 ms of which 0 ms to minimize.
[2021-05-08 12:05:02] [INFO ] Deduced a trap composed of 139 places in 446 ms of which 1 ms to minimize.
[2021-05-08 12:05:03] [INFO ] Deduced a trap composed of 137 places in 431 ms of which 1 ms to minimize.
[2021-05-08 12:05:03] [INFO ] Deduced a trap composed of 141 places in 417 ms of which 1 ms to minimize.
[2021-05-08 12:05:04] [INFO ] Deduced a trap composed of 236 places in 424 ms of which 1 ms to minimize.
[2021-05-08 12:05:04] [INFO ] Deduced a trap composed of 259 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:05:05] [INFO ] Deduced a trap composed of 144 places in 418 ms of which 1 ms to minimize.
[2021-05-08 12:05:05] [INFO ] Deduced a trap composed of 281 places in 442 ms of which 1 ms to minimize.
[2021-05-08 12:05:06] [INFO ] Deduced a trap composed of 142 places in 427 ms of which 1 ms to minimize.
[2021-05-08 12:05:06] [INFO ] Deduced a trap composed of 164 places in 426 ms of which 1 ms to minimize.
[2021-05-08 12:05:06] [INFO ] Deduced a trap composed of 150 places in 402 ms of which 1 ms to minimize.
[2021-05-08 12:05:07] [INFO ] Deduced a trap composed of 157 places in 414 ms of which 1 ms to minimize.
[2021-05-08 12:05:07] [INFO ] Deduced a trap composed of 256 places in 428 ms of which 1 ms to minimize.
[2021-05-08 12:05:08] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8723 ms
[2021-05-08 12:05:08] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 89 ms.
[2021-05-08 12:05:18] [INFO ] Added : 635 causal constraints over 127 iterations in 10421 ms. Result :unknown
[2021-05-08 12:05:18] [INFO ] [Real]Absence check using 147 positive place invariants in 73 ms returned sat
[2021-05-08 12:05:18] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:05:19] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2021-05-08 12:05:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:05:21] [INFO ] [Nat]Absence check using 147 positive place invariants in 66 ms returned sat
[2021-05-08 12:05:21] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:05:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:05:22] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2021-05-08 12:05:22] [INFO ] Deduced a trap composed of 27 places in 458 ms of which 1 ms to minimize.
[2021-05-08 12:05:23] [INFO ] Deduced a trap composed of 17 places in 468 ms of which 1 ms to minimize.
[2021-05-08 12:05:23] [INFO ] Deduced a trap composed of 87 places in 460 ms of which 1 ms to minimize.
[2021-05-08 12:05:24] [INFO ] Deduced a trap composed of 123 places in 447 ms of which 1 ms to minimize.
[2021-05-08 12:05:24] [INFO ] Deduced a trap composed of 95 places in 446 ms of which 1 ms to minimize.
[2021-05-08 12:05:25] [INFO ] Deduced a trap composed of 244 places in 432 ms of which 1 ms to minimize.
[2021-05-08 12:05:25] [INFO ] Deduced a trap composed of 268 places in 458 ms of which 1 ms to minimize.
[2021-05-08 12:05:26] [INFO ] Deduced a trap composed of 141 places in 463 ms of which 1 ms to minimize.
[2021-05-08 12:05:26] [INFO ] Deduced a trap composed of 258 places in 428 ms of which 1 ms to minimize.
[2021-05-08 12:05:27] [INFO ] Deduced a trap composed of 164 places in 420 ms of which 1 ms to minimize.
[2021-05-08 12:05:27] [INFO ] Deduced a trap composed of 146 places in 447 ms of which 1 ms to minimize.
[2021-05-08 12:05:28] [INFO ] Deduced a trap composed of 138 places in 435 ms of which 1 ms to minimize.
[2021-05-08 12:05:28] [INFO ] Deduced a trap composed of 118 places in 434 ms of which 1 ms to minimize.
[2021-05-08 12:05:29] [INFO ] Deduced a trap composed of 164 places in 454 ms of which 1 ms to minimize.
[2021-05-08 12:05:29] [INFO ] Deduced a trap composed of 164 places in 418 ms of which 1 ms to minimize.
[2021-05-08 12:05:30] [INFO ] Deduced a trap composed of 137 places in 414 ms of which 1 ms to minimize.
[2021-05-08 12:05:30] [INFO ] Deduced a trap composed of 144 places in 430 ms of which 1 ms to minimize.
[2021-05-08 12:05:31] [INFO ] Deduced a trap composed of 120 places in 440 ms of which 1 ms to minimize.
[2021-05-08 12:05:31] [INFO ] Deduced a trap composed of 259 places in 447 ms of which 1 ms to minimize.
[2021-05-08 12:05:32] [INFO ] Deduced a trap composed of 139 places in 453 ms of which 2 ms to minimize.
[2021-05-08 12:05:32] [INFO ] Deduced a trap composed of 159 places in 453 ms of which 2 ms to minimize.
[2021-05-08 12:05:33] [INFO ] Deduced a trap composed of 102 places in 411 ms of which 1 ms to minimize.
[2021-05-08 12:05:33] [INFO ] Deduced a trap composed of 115 places in 444 ms of which 1 ms to minimize.
[2021-05-08 12:05:34] [INFO ] Deduced a trap composed of 154 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:05:34] [INFO ] Deduced a trap composed of 147 places in 445 ms of which 1 ms to minimize.
[2021-05-08 12:05:35] [INFO ] Deduced a trap composed of 146 places in 423 ms of which 1 ms to minimize.
[2021-05-08 12:05:35] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 12945 ms
[2021-05-08 12:05:35] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 98 ms.
1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
[2021-05-08 12:05:40] [INFO ] Deduced a trap composed of 16 places in 780 ms of which 1 ms to minimize.
[2021-05-08 12:05:40] [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 8
[2021-05-08 12:05:40] [INFO ] [Real]Absence check using 147 positive place invariants in 72 ms returned sat
[2021-05-08 12:05:40] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 12:05:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:05:41] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2021-05-08 12:05:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:05:41] [INFO ] [Nat]Absence check using 147 positive place invariants in 69 ms returned sat
[2021-05-08 12:05:41] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 12:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:05:42] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2021-05-08 12:05:42] [INFO ] Deduced a trap composed of 41 places in 471 ms of which 2 ms to minimize.
[2021-05-08 12:05:43] [INFO ] Deduced a trap composed of 49 places in 406 ms of which 1 ms to minimize.
[2021-05-08 12:05:43] [INFO ] Deduced a trap composed of 120 places in 402 ms of which 1 ms to minimize.
[2021-05-08 12:05:44] [INFO ] Deduced a trap composed of 126 places in 400 ms of which 1 ms to minimize.
[2021-05-08 12:05:44] [INFO ] Deduced a trap composed of 230 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:05:45] [INFO ] Deduced a trap composed of 222 places in 402 ms of which 2 ms to minimize.
[2021-05-08 12:05:45] [INFO ] Deduced a trap composed of 215 places in 400 ms of which 1 ms to minimize.
[2021-05-08 12:05:46] [INFO ] Deduced a trap composed of 191 places in 392 ms of which 1 ms to minimize.
[2021-05-08 12:05:46] [INFO ] Deduced a trap composed of 269 places in 383 ms of which 1 ms to minimize.
[2021-05-08 12:05:46] [INFO ] Deduced a trap composed of 277 places in 423 ms of which 1 ms to minimize.
[2021-05-08 12:05:47] [INFO ] Deduced a trap composed of 274 places in 406 ms of which 1 ms to minimize.
[2021-05-08 12:05:47] [INFO ] Deduced a trap composed of 197 places in 412 ms of which 1 ms to minimize.
[2021-05-08 12:05:48] [INFO ] Deduced a trap composed of 296 places in 422 ms of which 1 ms to minimize.
[2021-05-08 12:05:48] [INFO ] Deduced a trap composed of 306 places in 408 ms of which 9 ms to minimize.
[2021-05-08 12:05:49] [INFO ] Deduced a trap composed of 294 places in 415 ms of which 1 ms to minimize.
[2021-05-08 12:05:49] [INFO ] Deduced a trap composed of 311 places in 411 ms of which 1 ms to minimize.
[2021-05-08 12:05:50] [INFO ] Deduced a trap composed of 214 places in 406 ms of which 1 ms to minimize.
[2021-05-08 12:05:50] [INFO ] Deduced a trap composed of 298 places in 428 ms of which 1 ms to minimize.
[2021-05-08 12:05:51] [INFO ] Deduced a trap composed of 310 places in 434 ms of which 1 ms to minimize.
[2021-05-08 12:05:51] [INFO ] Deduced a trap composed of 137 places in 424 ms of which 1 ms to minimize.
[2021-05-08 12:05:52] [INFO ] Deduced a trap composed of 277 places in 417 ms of which 1 ms to minimize.
[2021-05-08 12:05:52] [INFO ] Deduced a trap composed of 275 places in 402 ms of which 1 ms to minimize.
[2021-05-08 12:05:53] [INFO ] Deduced a trap composed of 293 places in 413 ms of which 1 ms to minimize.
[2021-05-08 12:05:53] [INFO ] Deduced a trap composed of 281 places in 406 ms of which 1 ms to minimize.
[2021-05-08 12:05:54] [INFO ] Deduced a trap composed of 279 places in 390 ms of which 1 ms to minimize.
[2021-05-08 12:05:54] [INFO ] Deduced a trap composed of 192 places in 389 ms of which 1 ms to minimize.
[2021-05-08 12:05:54] [INFO ] Deduced a trap composed of 225 places in 387 ms of which 1 ms to minimize.
[2021-05-08 12:05:55] [INFO ] Deduced a trap composed of 226 places in 380 ms of which 1 ms to minimize.
[2021-05-08 12:05:55] [INFO ] Deduced a trap composed of 223 places in 417 ms of which 1 ms to minimize.
[2021-05-08 12:05:56] [INFO ] Deduced a trap composed of 211 places in 437 ms of which 1 ms to minimize.
[2021-05-08 12:05:56] [INFO ] Deduced a trap composed of 317 places in 399 ms of which 1 ms to minimize.
[2021-05-08 12:05:57] [INFO ] Deduced a trap composed of 309 places in 421 ms of which 1 ms to minimize.
[2021-05-08 12:05:57] [INFO ] Deduced a trap composed of 274 places in 419 ms of which 1 ms to minimize.
[2021-05-08 12:05:58] [INFO ] Deduced a trap composed of 280 places in 388 ms of which 1 ms to minimize.
[2021-05-08 12:05:58] [INFO ] Deduced a trap composed of 306 places in 396 ms of which 1 ms to minimize.
[2021-05-08 12:05:59] [INFO ] Deduced a trap composed of 304 places in 400 ms of which 1 ms to minimize.
[2021-05-08 12:05:59] [INFO ] Deduced a trap composed of 329 places in 403 ms of which 1 ms to minimize.
[2021-05-08 12:05:59] [INFO ] Deduced a trap composed of 332 places in 401 ms of which 1 ms to minimize.
[2021-05-08 12:06:00] [INFO ] Deduced a trap composed of 326 places in 400 ms of which 1 ms to minimize.
[2021-05-08 12:06:00] [INFO ] Deduced a trap composed of 310 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:06:01] [INFO ] Deduced a trap composed of 302 places in 410 ms of which 1 ms to minimize.
[2021-05-08 12:06:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-08 12:06:01] [INFO ] [Real]Absence check using 147 positive place invariants in 77 ms returned sat
[2021-05-08 12:06:01] [INFO ] [Real]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:06:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 12:06:02] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2021-05-08 12:06:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 12:06:02] [INFO ] [Nat]Absence check using 147 positive place invariants in 72 ms returned sat
[2021-05-08 12:06:02] [INFO ] [Nat]Absence check using 147 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 12:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 12:06:03] [INFO ] [Nat]Absence check using state equation in 816 ms returned sat
[2021-05-08 12:06:03] [INFO ] Deduced a trap composed of 23 places in 435 ms of which 1 ms to minimize.
[2021-05-08 12:06:04] [INFO ] Deduced a trap composed of 131 places in 430 ms of which 2 ms to minimize.
[2021-05-08 12:06:04] [INFO ] Deduced a trap composed of 207 places in 428 ms of which 1 ms to minimize.
[2021-05-08 12:06:05] [INFO ] Deduced a trap composed of 265 places in 431 ms of which 1 ms to minimize.
[2021-05-08 12:06:05] [INFO ] Deduced a trap composed of 258 places in 456 ms of which 1 ms to minimize.
[2021-05-08 12:06:06] [INFO ] Deduced a trap composed of 127 places in 411 ms of which 1 ms to minimize.
[2021-05-08 12:06:06] [INFO ] Deduced a trap composed of 257 places in 410 ms of which 1 ms to minimize.
[2021-05-08 12:06:07] [INFO ] Deduced a trap composed of 281 places in 412 ms of which 1 ms to minimize.
[2021-05-08 12:06:07] [INFO ] Deduced a trap composed of 254 places in 412 ms of which 1 ms to minimize.
[2021-05-08 12:06:08] [INFO ] Deduced a trap composed of 250 places in 410 ms of which 1 ms to minimize.
[2021-05-08 12:06:08] [INFO ] Deduced a trap composed of 252 places in 450 ms of which 1 ms to minimize.
[2021-05-08 12:06:09] [INFO ] Deduced a trap composed of 285 places in 417 ms of which 1 ms to minimize.
[2021-05-08 12:06:09] [INFO ] Deduced a trap composed of 281 places in 414 ms of which 1 ms to minimize.
[2021-05-08 12:06:10] [INFO ] Deduced a trap composed of 294 places in 421 ms of which 1 ms to minimize.
[2021-05-08 12:06:10] [INFO ] Deduced a trap composed of 205 places in 406 ms of which 1 ms to minimize.
[2021-05-08 12:06:11] [INFO ] Deduced a trap composed of 273 places in 418 ms of which 2 ms to minimize.
[2021-05-08 12:06:11] [INFO ] Deduced a trap composed of 290 places in 428 ms of which 1 ms to minimize.
[2021-05-08 12:06:11] [INFO ] Deduced a trap composed of 256 places in 407 ms of which 1 ms to minimize.
[2021-05-08 12:06:12] [INFO ] Deduced a trap composed of 179 places in 405 ms of which 1 ms to minimize.
[2021-05-08 12:06:12] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 9138 ms
[2021-05-08 12:06:12] [INFO ] Computed and/alt/rep : 1694/2350/1694 causal constraints (skipped 2 transitions) in 81 ms.
[2021-05-08 12:06:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1734 transition count 1684
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1734 transition count 1684
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 1730 transition count 1680
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 1730 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1728 transition count 1678
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1728 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1727 transition count 1677
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1727 transition count 1677
Applied a total of 40 rules in 400 ms. Remains 1727 /1747 variables (removed 20) and now considering 1677/1697 (removed 20) transitions.
// Phase 1: matrix 1677 rows 1727 cols
[2021-05-08 12:06:22] [INFO ] Computed 148 place invariants in 7 ms
[2021-05-08 12:06:23] [INFO ] Implicit Places using invariants in 440 ms returned []
// Phase 1: matrix 1677 rows 1727 cols
[2021-05-08 12:06:23] [INFO ] Computed 148 place invariants in 7 ms
[2021-05-08 12:06:25] [INFO ] Implicit Places using invariants and state equation in 1746 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
// Phase 1: matrix 1677 rows 1727 cols
[2021-05-08 12:06:25] [INFO ] Computed 148 place invariants in 7 ms
[2021-05-08 12:06:39] [INFO ] Dead Transitions using invariants and state equation in 14878 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1727/1747 places, 1677/1697 transitions.
Stuttering acceptance computed with spot in 1136 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s175 1), p0:(EQ s653 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-24b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-00 finished in 18667 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1)||G(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 1746 transition count 1068
Reduce places removed 628 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 697 rules applied. Total rules applied 1325 place count 1118 transition count 999
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 48 rules applied. Total rules applied 1373 place count 1072 transition count 997
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1377 place count 1070 transition count 995
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1378 place count 1069 transition count 995
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 201 Pre rules applied. Total rules applied 1378 place count 1069 transition count 794
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 5 with 402 rules applied. Total rules applied 1780 place count 868 transition count 794
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1791 place count 857 transition count 783
Iterating global reduction 5 with 11 rules applied. Total rules applied 1802 place count 857 transition count 783
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 1802 place count 857 transition count 779
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 1810 place count 853 transition count 779
Performed 335 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 335 places in 0 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 5 with 670 rules applied. Total rules applied 2480 place count 518 transition count 396
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2481 place count 517 transition count 395
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 5 with 66 rules applied. Total rules applied 2547 place count 472 transition count 374
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 2568 place count 451 transition count 374
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 2568 place count 451 transition count 350
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2616 place count 427 transition count 350
Applied a total of 2616 rules in 459 ms. Remains 427 /1747 variables (removed 1320) and now considering 350/1697 (removed 1347) transitions.
// Phase 1: matrix 350 rows 427 cols
[2021-05-08 12:06:41] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-08 12:06:41] [INFO ] Implicit Places using invariants in 203 ms returned [178, 252, 326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 395, 399, 403, 408, 412, 416, 420, 426]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 205 ms to find 27 implicit places.
[2021-05-08 12:06:41] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 350 rows 400 cols
[2021-05-08 12:06:41] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:06:41] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Starting structural reductions, iteration 1 : 400/1747 places, 350/1697 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 375 transition count 325
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 375 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 374 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 374 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 373 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 373 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 372 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 372 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 371 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 371 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 370 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 370 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 369 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 369 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 368 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 368 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 367 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 367 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 366 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 366 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 365 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 365 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 364 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 364 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 363 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 363 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 362 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 362 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 361 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 361 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 360 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 360 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 359 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 359 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 358 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 358 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 357 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 357 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 356 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 356 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 355 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 355 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 354 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 354 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 353 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 353 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 352 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 352 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 351 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 351 transition count 301
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 350 transition count 300
Applied a total of 100 rules in 280 ms. Remains 350 /400 variables (removed 50) and now considering 300/350 (removed 50) transitions.
// Phase 1: matrix 300 rows 350 cols
[2021-05-08 12:06:42] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:06:42] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 300 rows 350 cols
[2021-05-08 12:06:42] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:06:42] [INFO ] State equation strengthened by 29 read => feed constraints.
[2021-05-08 12:06:42] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 350/1747 places, 300/1697 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24b-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s17 1), p1:(EQ s65 1), p2:(EQ s173 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3119 reset in 662 ms.
Product exploration explored 100000 steps with 3100 reset in 510 ms.
Knowledge obtained : [(NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3140 reset in 460 ms.
Product exploration explored 100000 steps with 3099 reset in 510 ms.
[2021-05-08 12:06:45] [INFO ] Flatten gal took : 14 ms
[2021-05-08 12:06:45] [INFO ] Flatten gal took : 14 ms
[2021-05-08 12:06:45] [INFO ] Time to serialize gal into /tmp/LTL2092978032843822201.gal : 10 ms
[2021-05-08 12:06:45] [INFO ] Time to serialize properties into /tmp/LTL4539567686131835200.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2092978032843822201.gal, -t, CGAL, -LTL, /tmp/LTL4539567686131835200.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2092978032843822201.gal -t CGAL -LTL /tmp/LTL4539567686131835200.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("(p208==1)")||(G("(p473==1)")))||(G(F("(p1340==1)"))))))
Formula 0 simplified : !F("(p208==1)" | G"(p473==1)" | GF"(p1340==1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t255, t316.t374, t340.t374, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/295/5/300
Computing Next relation with stutter on 6.30823e+09 deadlock states
Detected timeout of ITS tools.
[2021-05-08 12:07:00] [INFO ] Flatten gal took : 13 ms
[2021-05-08 12:07:00] [INFO ] Applying decomposition
[2021-05-08 12:07:00] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4272873288195232023.txt, -o, /tmp/graph4272873288195232023.bin, -w, /tmp/graph4272873288195232023.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/graph4272873288195232023.bin, -l, -1, -v, -w, /tmp/graph4272873288195232023.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:07:01] [INFO ] Decomposing Gal with order
[2021-05-08 12:07:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:07:01] [INFO ] Removed a total of 4 redundant transitions.
[2021-05-08 12:07:01] [INFO ] Flatten gal took : 55 ms
[2021-05-08 12:07:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-08 12:07:01] [INFO ] Time to serialize gal into /tmp/LTL11745611167868344324.gal : 7 ms
[2021-05-08 12:07:01] [INFO ] Time to serialize properties into /tmp/LTL1087163392700108933.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11745611167868344324.gal, -t, CGAL, -LTL, /tmp/LTL1087163392700108933.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11745611167868344324.gal -t CGAL -LTL /tmp/LTL1087163392700108933.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((("(i9.u6.p208==1)")||(G("(i0.u27.p473==1)")))||(G(F("(i12.u73.p1340==1)"))))))
Formula 0 simplified : !F("(i9.u6.p208==1)" | G"(i0.u27.p473==1)" | GF"(i12.u73.p1340==1)")
Reverse transition relation is NOT exact ! Due to transitions t2, t255, t316_t374, t340_t374, i0.u27.t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/295/5/300
Computing Next relation with stutter on 6.30823e+09 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
220 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.24163,112348,1,0,221625,34692,4201,365749,1255,121339,140171
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA AutoFlight-PT-24b-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property AutoFlight-PT-24b-01 finished in 23379 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((X(F(p0))&&G((p1&&X((p1 U ((p2 U (p3||G(p2)))||G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1747 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1732 transition count 1682
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1732 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 1727 transition count 1677
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1725 transition count 1675
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1725 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1724 transition count 1674
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1724 transition count 1674
Applied a total of 46 rules in 518 ms. Remains 1724 /1747 variables (removed 23) and now considering 1674/1697 (removed 23) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:07:04] [INFO ] Computed 148 place invariants in 7 ms
[2021-05-08 12:07:05] [INFO ] Implicit Places using invariants in 505 ms returned []
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:07:05] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:07:07] [INFO ] Implicit Places using invariants and state equation in 1750 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:07:07] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:07:08] [INFO ] Dead Transitions using invariants and state equation in 929 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1724/1747 places, 1674/1697 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//autfilt, --hoaf=tv, --small, -F, /tmp/curaut9146763621515657969.hoa], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 14100 ms :[false, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : AutoFlight-PT-24b-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(OR (NEQ s487 1) (NEQ s1104 1)), p0:(OR (NEQ s456 1) (NEQ s1565 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 93 reset in 383 ms.
Product exploration explored 100000 steps with 94 reset in 433 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 94 reset in 433 ms.
Product exploration explored 100000 steps with 93 reset in 401 ms.
Applying partial POR strategy [true, true, false, false, false, false, true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Support contains 4 out of 1724 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Performed 553 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 553 rules applied. Total rules applied 553 place count 1724 transition count 1674
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 601 place count 1724 transition count 1650
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 221 Pre rules applied. Total rules applied 601 place count 1724 transition count 1773
Deduced a syphon composed of 798 places in 5 ms
Iterating global reduction 2 with 221 rules applied. Total rules applied 822 place count 1724 transition count 1773
Discarding 453 places :
Symmetric choice reduction at 2 with 453 rule applications. Total rules 1275 place count 1271 transition count 1320
Deduced a syphon composed of 345 places in 4 ms
Iterating global reduction 2 with 453 rules applied. Total rules applied 1728 place count 1271 transition count 1320
Performed 413 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 758 places in 0 ms
Iterating global reduction 2 with 413 rules applied. Total rules applied 2141 place count 1271 transition count 1273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2142 place count 1271 transition count 1272
Renaming transitions due to excessive name length > 1024 char.
Discarding 266 places :
Symmetric choice reduction at 3 with 266 rule applications. Total rules 2408 place count 1005 transition count 1006
Deduced a syphon composed of 492 places in 0 ms
Iterating global reduction 3 with 266 rules applied. Total rules applied 2674 place count 1005 transition count 1006
Deduced a syphon composed of 492 places in 0 ms
Applied a total of 2674 rules in 716 ms. Remains 1005 /1724 variables (removed 719) and now considering 1006/1674 (removed 668) transitions.
[2021-05-08 12:07:25] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 1006 rows 1005 cols
[2021-05-08 12:07:25] [INFO ] Computed 148 place invariants in 22 ms
[2021-05-08 12:07:25] [INFO ] Dead Transitions using invariants and state equation in 642 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1005/1724 places, 1006/1674 transitions.
Product exploration explored 100000 steps with 1152 reset in 778 ms.
Product exploration explored 100000 steps with 1149 reset in 782 ms.
Starting structural reductions, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Applied a total of 0 rules in 123 ms. Remains 1724 /1724 variables (removed 0) and now considering 1674/1674 (removed 0) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:07:27] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:07:27] [INFO ] Implicit Places using invariants in 406 ms returned []
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:07:27] [INFO ] Computed 148 place invariants in 10 ms
[2021-05-08 12:07:29] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:07:29] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:07:30] [INFO ] Dead Transitions using invariants and state equation in 966 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1724/1724 places, 1674/1674 transitions.
[2021-05-08 12:07:30] [INFO ] Flatten gal took : 52 ms
[2021-05-08 12:07:30] [INFO ] Flatten gal took : 45 ms
[2021-05-08 12:07:45] [INFO ] Time to serialize gal into /tmp/LTL3578300689328939212.gal : 4515 ms
[2021-05-08 12:07:45] [INFO ] Time to serialize properties into /tmp/LTL18303034484811018007.ltl : 88 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3578300689328939212.gal, -t, CGAL, -LTL, /tmp/LTL18303034484811018007.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3578300689328939212.gal -t CGAL -LTL /tmp/LTL18303034484811018007.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 12 LTL properties
Checking formula 0 : !((X(X(X((X(F("((p687!=1)||(p2061!=1))")))&&(G(("((p738!=1)||(p1584!=1))")&&(X(("((p738!=1)||(p1584!=1))")U((("(p767!=1)")U(("(((p687!=1)||(p2061!=1))&&(p767!=1))")||(G("(p767!=1)"))))||(G("((p738!=1)||(p1584!=1))"))))))))))))
Formula 0 simplified : !XXX(XF"((p687!=1)||(p2061!=1))" & G("((p738!=1)||(p1584!=1))" & X("((p738!=1)||(p1584!=1))" U (("(p767!=1)" U ("(((p687!=1)||(p2061!=1))&&(p767!=1))" | G"(p767!=1)")) | G"((p738!=1)||(p1584!=1))"))))
Detected timeout of ITS tools.
[2021-05-08 12:08:00] [INFO ] Flatten gal took : 44 ms
[2021-05-08 12:08:00] [INFO ] Applying decomposition
[2021-05-08 12:08:00] [INFO ] Flatten gal took : 43 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/graph4791938643227236969.txt, -o, /tmp/graph4791938643227236969.bin, -w, /tmp/graph4791938643227236969.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/graph4791938643227236969.bin, -l, -1, -v, -w, /tmp/graph4791938643227236969.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:08:06] [INFO ] Decomposing Gal with order
[2021-05-08 12:08:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:08:06] [INFO ] Removed a total of 323 redundant transitions.
[2021-05-08 12:08:06] [INFO ] Flatten gal took : 110 ms
[2021-05-08 12:08:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-05-08 12:08:06] [INFO ] Time to serialize gal into /tmp/LTL4034058464065249600.gal : 16 ms
[2021-05-08 12:08:06] [INFO ] Time to serialize properties into /tmp/LTL2333849510406654861.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4034058464065249600.gal, -t, CGAL, -LTL, /tmp/LTL2333849510406654861.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4034058464065249600.gal -t CGAL -LTL /tmp/LTL2333849510406654861.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((X(X(X((X(F("((i18.u205.p687!=1)||(i2.u678.p2061!=1))")))&&(G(("((i19.u220.p738!=1)||(i19.u476.p1584!=1))")&&(X(("((i19.u220.p738!=1)||(i19.u476.p1584!=1))")U((("(i9.u224.p767!=1)")U(("(((i18.u205.p687!=1)||(i2.u678.p2061!=1))&&(i9.u224.p767!=1))")||(G("(i9.u224.p767!=1)"))))||(G("((i19.u220.p738!=1)||(i19.u476.p1584!=1))"))))))))))))
Formula 0 simplified : !XXX(XF"((i18.u205.p687!=1)||(i2.u678.p2061!=1))" & G("((i19.u220.p738!=1)||(i19.u476.p1584!=1))" & X("((i19.u220.p738!=1)||(i19.u476.p1584!=1))" U (("(i9.u224.p767!=1)" U ("(((i18.u205.p687!=1)||(i2.u678.p2061!=1))&&(i9.u224.p767!=1))" | G"(i9.u224.p767!=1)")) | G"((i19.u220.p738!=1)||(i19.u476.p1584!=1))"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9925229783861859903
[2021-05-08 12:08:28] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9925229783861859903
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/ltsmin9925229783861859903]
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/ltsmin9925229783861859903] 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/ltsmin9925229783861859903] 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)
Treatment of property AutoFlight-PT-24b-02 finished in 85370 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(p0)||(p1&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1733 transition count 1683
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1733 transition count 1683
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 1729 transition count 1679
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 1729 transition count 1679
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1728 transition count 1678
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1728 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1727 transition count 1677
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1727 transition count 1677
Applied a total of 40 rules in 591 ms. Remains 1727 /1747 variables (removed 20) and now considering 1677/1697 (removed 20) transitions.
// Phase 1: matrix 1677 rows 1727 cols
[2021-05-08 12:08:30] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:08:30] [INFO ] Implicit Places using invariants in 465 ms returned []
// Phase 1: matrix 1677 rows 1727 cols
[2021-05-08 12:08:30] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:08:32] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
// Phase 1: matrix 1677 rows 1727 cols
[2021-05-08 12:08:32] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:08:33] [INFO ] Dead Transitions using invariants and state equation in 869 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1727/1747 places, 1677/1697 transitions.
Stuttering acceptance computed with spot in 2340 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s134 1), p1:(EQ s134 0), p2:(EQ s486 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 95 reset in 414 ms.
Product exploration explored 100000 steps with 95 reset in 444 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p2)]
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 94 reset in 343 ms.
Product exploration explored 100000 steps with 94 reset in 431 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) p1 (NOT p2))]
Support contains 2 out of 1727 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1727/1727 places, 1677/1677 transitions.
Performed 553 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 553 rules applied. Total rules applied 553 place count 1727 transition count 1677
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 601 place count 1727 transition count 1653
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 601 place count 1727 transition count 1773
Deduced a syphon composed of 799 places in 6 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 823 place count 1727 transition count 1773
Discarding 453 places :
Symmetric choice reduction at 2 with 453 rule applications. Total rules 1276 place count 1274 transition count 1320
Deduced a syphon composed of 346 places in 4 ms
Iterating global reduction 2 with 453 rules applied. Total rules applied 1729 place count 1274 transition count 1320
Performed 413 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 759 places in 1 ms
Iterating global reduction 2 with 413 rules applied. Total rules applied 2142 place count 1274 transition count 1273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2143 place count 1274 transition count 1272
Renaming transitions due to excessive name length > 1024 char.
Discarding 266 places :
Symmetric choice reduction at 3 with 266 rule applications. Total rules 2409 place count 1008 transition count 1006
Deduced a syphon composed of 493 places in 0 ms
Iterating global reduction 3 with 266 rules applied. Total rules applied 2675 place count 1008 transition count 1006
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 494 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2676 place count 1008 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2677 place count 1007 transition count 1005
Deduced a syphon composed of 493 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2678 place count 1007 transition count 1005
Deduced a syphon composed of 493 places in 1 ms
Applied a total of 2678 rules in 1095 ms. Remains 1007 /1727 variables (removed 720) and now considering 1005/1677 (removed 672) transitions.
[2021-05-08 12:08:39] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1005 rows 1007 cols
[2021-05-08 12:08:39] [INFO ] Computed 148 place invariants in 26 ms
[2021-05-08 12:08:40] [INFO ] Dead Transitions using invariants and state equation in 560 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1007/1727 places, 1005/1677 transitions.
Product exploration explored 100000 steps with 2119 reset in 924 ms.
Product exploration explored 100000 steps with 2106 reset in 935 ms.
[2021-05-08 12:08:42] [INFO ] Flatten gal took : 40 ms
[2021-05-08 12:08:42] [INFO ] Flatten gal took : 42 ms
[2021-05-08 12:08:42] [INFO ] Time to serialize gal into /tmp/LTL14997704668545470981.gal : 5 ms
[2021-05-08 12:08:42] [INFO ] Time to serialize properties into /tmp/LTL9504221242651299331.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14997704668545470981.gal, -t, CGAL, -LTL, /tmp/LTL9504221242651299331.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14997704668545470981.gal -t CGAL -LTL /tmp/LTL9504221242651299331.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(p141==1)"))||(("(p141==0)")&&(X("(p734==1)")))))))
Formula 0 simplified : !XG(F"(p141==1)" | ("(p141==0)" & X"(p734==1)"))
Detected timeout of ITS tools.
[2021-05-08 12:08:57] [INFO ] Flatten gal took : 43 ms
[2021-05-08 12:08:57] [INFO ] Applying decomposition
[2021-05-08 12:08:57] [INFO ] Flatten gal took : 42 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/graph8696511672920215767.txt, -o, /tmp/graph8696511672920215767.bin, -w, /tmp/graph8696511672920215767.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/graph8696511672920215767.bin, -l, -1, -v, -w, /tmp/graph8696511672920215767.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:08:57] [INFO ] Decomposing Gal with order
[2021-05-08 12:08:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:08:57] [INFO ] Removed a total of 330 redundant transitions.
[2021-05-08 12:08:57] [INFO ] Flatten gal took : 77 ms
[2021-05-08 12:08:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-08 12:08:57] [INFO ] Time to serialize gal into /tmp/LTL15249462446769985104.gal : 13 ms
[2021-05-08 12:08:57] [INFO ] Time to serialize properties into /tmp/LTL7937805210546055929.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15249462446769985104.gal, -t, CGAL, -LTL, /tmp/LTL7937805210546055929.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15249462446769985104.gal -t CGAL -LTL /tmp/LTL7937805210546055929.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(G((F("(i9.u58.p141==1)"))||(("(i9.u58.p141==0)")&&(X("(i16.u211.p734==1)")))))))
Formula 0 simplified : !XG(F"(i9.u58.p141==1)" | ("(i9.u58.p141==0)" & X"(i16.u211.p734==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9228568088127708463
[2021-05-08 12:09:12] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9228568088127708463
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/ltsmin9228568088127708463]
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/ltsmin9228568088127708463] 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/ltsmin9228568088127708463] 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)
Treatment of property AutoFlight-PT-24b-03 finished in 43962 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 632 transitions
Trivial Post-agglo rules discarded 632 transitions
Performed 632 trivial Post agglomeration. Transition count delta: 632
Iterating post reduction 0 with 632 rules applied. Total rules applied 632 place count 1746 transition count 1064
Reduce places removed 632 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 704 rules applied. Total rules applied 1336 place count 1114 transition count 992
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1384 place count 1066 transition count 992
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 1384 place count 1066 transition count 791
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 1786 place count 865 transition count 791
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1796 place count 855 transition count 781
Iterating global reduction 3 with 10 rules applied. Total rules applied 1806 place count 855 transition count 781
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1806 place count 855 transition count 777
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1814 place count 851 transition count 777
Performed 336 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 2486 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2487 place count 514 transition count 392
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 68 rules applied. Total rules applied 2555 place count 468 transition count 370
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2577 place count 446 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2577 place count 446 transition count 346
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2625 place count 422 transition count 346
Applied a total of 2625 rules in 149 ms. Remains 422 /1747 variables (removed 1325) and now considering 346/1697 (removed 1351) transitions.
// Phase 1: matrix 346 rows 422 cols
[2021-05-08 12:09:13] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-08 12:09:14] [INFO ] Implicit Places using invariants in 192 ms returned [174, 248, 322, 326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 403, 407, 411, 415, 421]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 193 ms to find 27 implicit places.
[2021-05-08 12:09:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 346 rows 395 cols
[2021-05-08 12:09:14] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:09:14] [INFO ] Dead Transitions using invariants and state equation in 160 ms returned []
Starting structural reductions, iteration 1 : 395/1747 places, 346/1697 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 370 transition count 321
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 369 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 368 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 367 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 366 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 365 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 364 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 363 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 363 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 362 transition count 313
Applied a total of 66 rules in 42 ms. Remains 362 /395 variables (removed 33) and now considering 313/346 (removed 33) transitions.
// Phase 1: matrix 313 rows 362 cols
[2021-05-08 12:09:14] [INFO ] Computed 75 place invariants in 0 ms
[2021-05-08 12:09:14] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 313 rows 362 cols
[2021-05-08 12:09:14] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:09:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 12:09:14] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 362/1747 places, 313/1697 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-24b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s56 1), p1:(EQ s141 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-24b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-05 finished in 1245 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(((p1 U ((p1&&G(p2))||G(p1))) U (G(p1)||(p3&&(p1 U ((p1&&G(p2))||G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1747 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1732 transition count 1682
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1732 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 1727 transition count 1677
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1725 transition count 1675
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1725 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1724 transition count 1674
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1724 transition count 1674
Applied a total of 46 rules in 372 ms. Remains 1724 /1747 variables (removed 23) and now considering 1674/1697 (removed 23) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:09:15] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:09:15] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:09:15] [INFO ] Computed 148 place invariants in 18 ms
[2021-05-08 12:09:17] [INFO ] Implicit Places using invariants and state equation in 1920 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:09:17] [INFO ] Computed 148 place invariants in 17 ms
[2021-05-08 12:09:18] [INFO ] Dead Transitions using invariants and state equation in 890 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1724/1747 places, 1674/1697 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s1393 1) (NEQ s1720 1)), p1:(NEQ s511 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 693 steps with 0 reset in 3 ms.
FORMULA AutoFlight-PT-24b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-06 finished in 3776 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 1746 transition count 1067
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 701 rules applied. Total rules applied 1330 place count 1117 transition count 995
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1379 place count 1069 transition count 994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1380 place count 1068 transition count 994
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 1380 place count 1068 transition count 793
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 1782 place count 867 transition count 793
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1794 place count 855 transition count 781
Iterating global reduction 4 with 12 rules applied. Total rules applied 1806 place count 855 transition count 781
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1806 place count 855 transition count 777
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1814 place count 851 transition count 777
Performed 336 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 4 with 672 rules applied. Total rules applied 2486 place count 515 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2487 place count 514 transition count 392
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 68 rules applied. Total rules applied 2555 place count 468 transition count 370
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2577 place count 446 transition count 370
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2577 place count 446 transition count 346
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2625 place count 422 transition count 346
Applied a total of 2625 rules in 122 ms. Remains 422 /1747 variables (removed 1325) and now considering 346/1697 (removed 1351) transitions.
// Phase 1: matrix 346 rows 422 cols
[2021-05-08 12:09:18] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-08 12:09:19] [INFO ] Implicit Places using invariants in 217 ms returned [248, 322, 326, 330, 334, 338, 342, 346, 350, 354, 358, 362, 366, 370, 374, 378, 382, 386, 390, 394, 398, 403, 407, 411, 415, 421]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 218 ms to find 26 implicit places.
[2021-05-08 12:09:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 346 rows 396 cols
[2021-05-08 12:09:19] [INFO ] Computed 76 place invariants in 2 ms
[2021-05-08 12:09:19] [INFO ] Dead Transitions using invariants and state equation in 176 ms returned []
Starting structural reductions, iteration 1 : 396/1747 places, 346/1697 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 372 transition count 322
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 372 transition count 322
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 370 transition count 320
Applied a total of 52 rules in 14 ms. Remains 370 /396 variables (removed 26) and now considering 320/346 (removed 26) transitions.
// Phase 1: matrix 320 rows 370 cols
[2021-05-08 12:09:19] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:09:19] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 320 rows 370 cols
[2021-05-08 12:09:19] [INFO ] Computed 76 place invariants in 1 ms
[2021-05-08 12:09:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-08 12:09:19] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 370/1747 places, 320/1697 transitions.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s246 1) (NEQ s169 1)), p1:(NEQ s246 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1264 reset in 480 ms.
Product exploration explored 100000 steps with 1259 reset in 533 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1257 reset in 481 ms.
Product exploration explored 100000 steps with 1263 reset in 513 ms.
[2021-05-08 12:09:22] [INFO ] Flatten gal took : 9 ms
[2021-05-08 12:09:22] [INFO ] Flatten gal took : 8 ms
[2021-05-08 12:09:22] [INFO ] Time to serialize gal into /tmp/LTL1329212229981555124.gal : 1 ms
[2021-05-08 12:09:22] [INFO ] Time to serialize properties into /tmp/LTL17355207155129180589.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL1329212229981555124.gal, -t, CGAL, -LTL, /tmp/LTL17355207155129180589.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1329212229981555124.gal -t CGAL -LTL /tmp/LTL17355207155129180589.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((p1689!=1)&&(p1385!=1))"))||(G("(p1689!=1)")))))
Formula 0 simplified : !F(G"((p1689!=1)&&(p1385!=1))" | G"(p1689!=1)")
Reverse transition relation is NOT exact ! Due to transitions t337.t372, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/319/1/320
Computing Next relation with stutter on 3.99298e+09 deadlock states
Detected timeout of ITS tools.
[2021-05-08 12:09:37] [INFO ] Flatten gal took : 8 ms
[2021-05-08 12:09:37] [INFO ] Applying decomposition
[2021-05-08 12:09:37] [INFO ] Flatten gal took : 9 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/graph12543607525049308012.txt, -o, /tmp/graph12543607525049308012.bin, -w, /tmp/graph12543607525049308012.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/graph12543607525049308012.bin, -l, -1, -v, -w, /tmp/graph12543607525049308012.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:09:37] [INFO ] Decomposing Gal with order
[2021-05-08 12:09:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:09:37] [INFO ] Removed a total of 28 redundant transitions.
[2021-05-08 12:09:37] [INFO ] Flatten gal took : 28 ms
[2021-05-08 12:09:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-08 12:09:37] [INFO ] Time to serialize gal into /tmp/LTL16610698617488131417.gal : 3 ms
[2021-05-08 12:09:37] [INFO ] Time to serialize properties into /tmp/LTL4981880454974159686.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16610698617488131417.gal, -t, CGAL, -LTL, /tmp/LTL4981880454974159686.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16610698617488131417.gal -t CGAL -LTL /tmp/LTL4981880454974159686.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("((i6.u76.p1689!=1)&&(i7.u74.p1385!=1))"))||(G("(i6.u76.p1689!=1)")))))
Formula 0 simplified : !F(G"((i6.u76.p1689!=1)&&(i7.u74.p1385!=1))" | G"(i6.u76.p1689!=1)")
Reverse transition relation is NOT exact ! Due to transitions t337_t372, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/319/1/320
Computing Next relation with stutter on 3.99298e+09 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1197232148243245160
[2021-05-08 12:09:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1197232148243245160
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/ltsmin1197232148243245160]
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/ltsmin1197232148243245160] 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/ltsmin1197232148243245160] 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)
Treatment of property AutoFlight-PT-24b-07 finished in 34719 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 631 transitions
Trivial Post-agglo rules discarded 631 transitions
Performed 631 trivial Post agglomeration. Transition count delta: 631
Iterating post reduction 0 with 631 rules applied. Total rules applied 631 place count 1746 transition count 1065
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 703 rules applied. Total rules applied 1334 place count 1115 transition count 993
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1382 place count 1067 transition count 993
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 1382 place count 1067 transition count 792
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 1784 place count 866 transition count 792
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1796 place count 854 transition count 780
Iterating global reduction 3 with 12 rules applied. Total rules applied 1808 place count 854 transition count 780
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1808 place count 854 transition count 776
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1816 place count 850 transition count 776
Performed 334 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 334 places in 0 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 2484 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2485 place count 515 transition count 393
Reduce places removed 45 places and 0 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 66 rules applied. Total rules applied 2551 place count 470 transition count 372
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 2572 place count 449 transition count 372
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 23 Pre rules applied. Total rules applied 2572 place count 449 transition count 349
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 2618 place count 426 transition count 349
Applied a total of 2618 rules in 145 ms. Remains 426 /1747 variables (removed 1321) and now considering 349/1697 (removed 1348) transitions.
// Phase 1: matrix 349 rows 426 cols
[2021-05-08 12:09:53] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-08 12:09:53] [INFO ] Implicit Places using invariants in 216 ms returned [344, 348, 352, 356, 360, 364, 368, 374, 378, 382, 386, 390, 394, 398, 402, 407, 411, 415, 419, 425]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 217 ms to find 20 implicit places.
[2021-05-08 12:09:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 349 rows 406 cols
[2021-05-08 12:09:53] [INFO ] Computed 83 place invariants in 1 ms
[2021-05-08 12:09:54] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Starting structural reductions, iteration 1 : 406/1747 places, 349/1697 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 388 transition count 331
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 388 transition count 331
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 52 place count 380 transition count 323
Applied a total of 52 rules in 14 ms. Remains 380 /406 variables (removed 26) and now considering 323/349 (removed 26) transitions.
// Phase 1: matrix 323 rows 380 cols
[2021-05-08 12:09:54] [INFO ] Computed 83 place invariants in 1 ms
[2021-05-08 12:09:54] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 323 rows 380 cols
[2021-05-08 12:09:54] [INFO ] Computed 83 place invariants in 13 ms
[2021-05-08 12:09:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 12:09:54] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 380/1747 places, 323/1697 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (NEQ s175 1) (OR (NEQ s169 1) (NEQ s351 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-08 finished in 1191 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1747 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 631 transitions
Trivial Post-agglo rules discarded 631 transitions
Performed 631 trivial Post agglomeration. Transition count delta: 631
Iterating post reduction 0 with 631 rules applied. Total rules applied 631 place count 1746 transition count 1065
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 703 rules applied. Total rules applied 1334 place count 1115 transition count 993
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1382 place count 1067 transition count 993
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 1382 place count 1067 transition count 792
Deduced a syphon composed of 201 places in 2 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 1784 place count 866 transition count 792
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1795 place count 855 transition count 781
Iterating global reduction 3 with 11 rules applied. Total rules applied 1806 place count 855 transition count 781
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1806 place count 855 transition count 777
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1814 place count 851 transition count 777
Performed 335 Post agglomeration using F-continuation condition with reduction of 47 identical transitions.
Deduced a syphon composed of 335 places in 0 ms
Reduce places removed 335 places and 0 transitions.
Iterating global reduction 3 with 670 rules applied. Total rules applied 2484 place count 516 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2485 place count 516 transition count 394
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2486 place count 515 transition count 393
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 68 rules applied. Total rules applied 2554 place count 469 transition count 371
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2576 place count 447 transition count 371
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2576 place count 447 transition count 347
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2624 place count 423 transition count 347
Applied a total of 2624 rules in 144 ms. Remains 423 /1747 variables (removed 1324) and now considering 347/1697 (removed 1350) transitions.
// Phase 1: matrix 347 rows 423 cols
[2021-05-08 12:09:54] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-08 12:09:55] [INFO ] Implicit Places using invariants in 205 ms returned [175, 249, 323, 327, 331, 335, 339, 343, 347, 351, 355, 359, 363, 367, 371, 375, 379, 383, 387, 391, 395, 399, 404, 408, 412, 416, 422]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 206 ms to find 27 implicit places.
[2021-05-08 12:09:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 347 rows 396 cols
[2021-05-08 12:09:55] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:09:55] [INFO ] Dead Transitions using invariants and state equation in 155 ms returned []
Starting structural reductions, iteration 1 : 396/1747 places, 347/1697 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 371 transition count 322
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 371 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 370 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 369 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 368 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 367 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 366 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 365 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 364 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 363 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 362 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 361 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 360 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 359 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 358 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 357 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 356 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 355 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 354 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 353 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 352 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 352 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 351 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 351 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 350 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 350 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 349 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 349 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 348 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 348 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 347 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 347 transition count 298
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 346 transition count 297
Applied a total of 100 rules in 95 ms. Remains 346 /396 variables (removed 50) and now considering 297/347 (removed 50) transitions.
// Phase 1: matrix 297 rows 346 cols
[2021-05-08 12:09:55] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:09:55] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 297 rows 346 cols
[2021-05-08 12:09:55] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:09:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-08 12:09:55] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 346/1747 places, 297/1697 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-24b-09 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s128 1), p2:(EQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2363 reset in 499 ms.
Product exploration explored 100000 steps with 2359 reset in 516 ms.
Knowledge obtained : [(NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2328 reset in 474 ms.
Stack based approach found an accepted trace after 61066 steps with 1430 reset with depth 64 and stack size 64 in 306 ms.
FORMULA AutoFlight-PT-24b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-09 finished in 3156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0||X(p1)))&&((p2||F(p0)) U X(p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1734 transition count 1684
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1734 transition count 1684
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 1729 transition count 1679
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 1729 transition count 1679
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 1727 transition count 1677
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 1727 transition count 1677
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1726 transition count 1676
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1726 transition count 1676
Applied a total of 42 rules in 369 ms. Remains 1726 /1747 variables (removed 21) and now considering 1676/1697 (removed 21) transitions.
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:09:58] [INFO ] Computed 148 place invariants in 33 ms
[2021-05-08 12:09:58] [INFO ] Implicit Places using invariants in 491 ms returned []
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:09:58] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:10:00] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
// Phase 1: matrix 1676 rows 1726 cols
[2021-05-08 12:10:00] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:10:01] [INFO ] Dead Transitions using invariants and state equation in 850 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1726/1747 places, 1676/1697 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p3), (AND (NOT p0) (NOT p3)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s811 1), p0:(EQ s649 1), p3:(EQ s489 1), p1:(EQ s324 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1060 steps with 0 reset in 5 ms.
FORMULA AutoFlight-PT-24b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-11 finished in 3771 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 1746 transition count 1066
Reduce places removed 630 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 702 rules applied. Total rules applied 1332 place count 1116 transition count 994
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 49 rules applied. Total rules applied 1381 place count 1068 transition count 993
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1382 place count 1067 transition count 993
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 1382 place count 1067 transition count 792
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 1784 place count 866 transition count 792
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1796 place count 854 transition count 780
Iterating global reduction 4 with 12 rules applied. Total rules applied 1808 place count 854 transition count 780
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 1808 place count 854 transition count 776
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 1816 place count 850 transition count 776
Performed 336 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 4 with 672 rules applied. Total rules applied 2488 place count 514 transition count 392
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2489 place count 513 transition count 391
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 68 rules applied. Total rules applied 2557 place count 467 transition count 369
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2579 place count 445 transition count 369
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2579 place count 445 transition count 345
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2627 place count 421 transition count 345
Applied a total of 2627 rules in 146 ms. Remains 421 /1747 variables (removed 1326) and now considering 345/1697 (removed 1352) transitions.
// Phase 1: matrix 345 rows 421 cols
[2021-05-08 12:10:01] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-08 12:10:01] [INFO ] Implicit Places using invariants in 196 ms returned [173, 247, 321, 325, 329, 333, 337, 341, 345, 349, 353, 357, 361, 365, 369, 373, 377, 381, 385, 389, 393, 397, 402, 406, 410, 414, 420]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 205 ms to find 27 implicit places.
[2021-05-08 12:10:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 345 rows 394 cols
[2021-05-08 12:10:02] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:10:02] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Starting structural reductions, iteration 1 : 394/1747 places, 345/1697 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 369 transition count 320
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 368 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 367 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 366 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 365 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 364 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 363 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 362 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 361 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 360 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 359 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 358 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 357 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 356 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 355 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 354 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 353 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 352 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 352 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 351 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 351 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 350 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 350 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 349 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 349 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 348 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 348 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 347 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 347 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 346 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 346 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 345 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 345 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 344 transition count 295
Applied a total of 100 rules in 96 ms. Remains 344 /394 variables (removed 50) and now considering 295/345 (removed 50) transitions.
// Phase 1: matrix 295 rows 344 cols
[2021-05-08 12:10:02] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:10:02] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 295 rows 344 cols
[2021-05-08 12:10:02] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:10:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-08 12:10:02] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 344/1747 places, 295/1697 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s142 1) (EQ s334 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-12 finished in 1125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1733 transition count 1683
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1733 transition count 1683
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 1728 transition count 1678
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 1728 transition count 1678
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1726 transition count 1676
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1726 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1725 transition count 1675
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1725 transition count 1675
Applied a total of 44 rules in 366 ms. Remains 1725 /1747 variables (removed 22) and now considering 1675/1697 (removed 22) transitions.
// Phase 1: matrix 1675 rows 1725 cols
[2021-05-08 12:10:03] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:10:03] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 1675 rows 1725 cols
[2021-05-08 12:10:03] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:10:05] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2184 ms to find 0 implicit places.
// Phase 1: matrix 1675 rows 1725 cols
[2021-05-08 12:10:05] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:10:06] [INFO ] Dead Transitions using invariants and state equation in 977 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1725/1747 places, 1675/1697 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(NEQ s1497 1), p1:(NEQ s1497 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 79854 steps with 74 reset in 259 ms.
FORMULA AutoFlight-PT-24b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-13 finished in 3935 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1732 transition count 1682
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1732 transition count 1682
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 1727 transition count 1677
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 1727 transition count 1677
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 1725 transition count 1675
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 1725 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 1724 transition count 1674
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 1724 transition count 1674
Applied a total of 46 rules in 363 ms. Remains 1724 /1747 variables (removed 23) and now considering 1674/1697 (removed 23) transitions.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:10:07] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:10:07] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:10:07] [INFO ] Computed 148 place invariants in 5 ms
[2021-05-08 12:10:09] [INFO ] Implicit Places using invariants and state equation in 1850 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
// Phase 1: matrix 1674 rows 1724 cols
[2021-05-08 12:10:09] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-08 12:10:10] [INFO ] Dead Transitions using invariants and state equation in 879 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1724/1747 places, 1674/1697 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-24b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s70 1), p2:(AND (NEQ s19 1) (NEQ s1683 1)), p1:(NEQ s1683 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1177 ms.
Product exploration explored 100000 steps with 50000 reset in 1222 ms.
Knowledge obtained : [(NOT p0), p2, p1]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 1221 ms.
Product exploration explored 100000 steps with 50000 reset in 1218 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 1724 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1724/1724 places, 1674/1674 transitions.
Performed 552 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 1724 transition count 1674
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 48 rules applied. Total rules applied 600 place count 1724 transition count 1650
Performed 222 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 222 Pre rules applied. Total rules applied 600 place count 1724 transition count 1773
Deduced a syphon composed of 798 places in 5 ms
Iterating global reduction 2 with 222 rules applied. Total rules applied 822 place count 1724 transition count 1773
Discarding 451 places :
Symmetric choice reduction at 2 with 451 rule applications. Total rules 1273 place count 1273 transition count 1322
Deduced a syphon composed of 347 places in 9 ms
Iterating global reduction 2 with 451 rules applied. Total rules applied 1724 place count 1273 transition count 1322
Performed 409 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 756 places in 0 ms
Iterating global reduction 2 with 409 rules applied. Total rules applied 2133 place count 1273 transition count 1274
Renaming transitions due to excessive name length > 1024 char.
Discarding 267 places :
Symmetric choice reduction at 2 with 267 rule applications. Total rules 2400 place count 1006 transition count 1007
Deduced a syphon composed of 489 places in 1 ms
Iterating global reduction 2 with 267 rules applied. Total rules applied 2667 place count 1006 transition count 1007
Deduced a syphon composed of 489 places in 1 ms
Applied a total of 2667 rules in 334 ms. Remains 1006 /1724 variables (removed 718) and now considering 1007/1674 (removed 667) transitions.
[2021-05-08 12:10:15] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 1007 rows 1006 cols
[2021-05-08 12:10:15] [INFO ] Computed 148 place invariants in 15 ms
[2021-05-08 12:10:16] [INFO ] Dead Transitions using invariants and state equation in 592 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1006/1724 places, 1007/1674 transitions.
Product exploration explored 100000 steps with 50000 reset in 4119 ms.
Product exploration explored 100000 steps with 50000 reset in 4093 ms.
[2021-05-08 12:10:24] [INFO ] Flatten gal took : 37 ms
[2021-05-08 12:10:24] [INFO ] Flatten gal took : 36 ms
[2021-05-08 12:10:24] [INFO ] Time to serialize gal into /tmp/LTL5693036637792092304.gal : 4 ms
[2021-05-08 12:10:24] [INFO ] Time to serialize properties into /tmp/LTL7482092350051555023.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5693036637792092304.gal, -t, CGAL, -LTL, /tmp/LTL7482092350051555023.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5693036637792092304.gal -t CGAL -LTL /tmp/LTL7482092350051555023.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p70==1)")||(("(p2187!=1)")U(("((p19!=1)&&(p2187!=1))")||(G("(p2187!=1)"))))))))
Formula 0 simplified : !XF("(p70==1)" | ("(p2187!=1)" U ("((p19!=1)&&(p2187!=1))" | G"(p2187!=1)")))
Detected timeout of ITS tools.
[2021-05-08 12:10:39] [INFO ] Flatten gal took : 37 ms
[2021-05-08 12:10:39] [INFO ] Applying decomposition
[2021-05-08 12:10:39] [INFO ] Flatten gal took : 37 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/graph2452394453342433968.txt, -o, /tmp/graph2452394453342433968.bin, -w, /tmp/graph2452394453342433968.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/graph2452394453342433968.bin, -l, -1, -v, -w, /tmp/graph2452394453342433968.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:10:39] [INFO ] Decomposing Gal with order
[2021-05-08 12:10:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:10:40] [INFO ] Removed a total of 330 redundant transitions.
[2021-05-08 12:10:40] [INFO ] Flatten gal took : 81 ms
[2021-05-08 12:10:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2021-05-08 12:10:40] [INFO ] Time to serialize gal into /tmp/LTL2890326670328295246.gal : 11 ms
[2021-05-08 12:10:40] [INFO ] Time to serialize properties into /tmp/LTL16768760828097300434.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2890326670328295246.gal, -t, CGAL, -LTL, /tmp/LTL16768760828097300434.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2890326670328295246.gal -t CGAL -LTL /tmp/LTL16768760828097300434.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i17.i0.i0.u31.p70==1)")||(("(i39.i0.i2.u717.p2187!=1)")U(("((i26.i1.i1.u8.p19!=1)&&(i39.i0.i2.u717.p2187!=1))")||(G("(i39.i0.i2.u717.p2187!=1)"))))))))
Formula 0 simplified : !XF("(i17.i0.i0.u31.p70==1)" | ("(i39.i0.i2.u717.p2187!=1)" U ("((i26.i1.i1.u8.p19!=1)&&(i39.i0.i2.u717.p2187!=1))" | G"(i39.i0.i2.u717.p2187!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13372135070084726054
[2021-05-08 12:10:55] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13372135070084726054
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/ltsmin13372135070084726054]
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/ltsmin13372135070084726054] 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/ltsmin13372135070084726054] 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)
Treatment of property AutoFlight-PT-24b-14 finished in 49659 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&(p1 U ((p1&&G(p2))||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1747 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1747/1747 places, 1697/1697 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 631 transitions
Trivial Post-agglo rules discarded 631 transitions
Performed 631 trivial Post agglomeration. Transition count delta: 631
Iterating post reduction 0 with 631 rules applied. Total rules applied 631 place count 1746 transition count 1065
Reduce places removed 631 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 703 rules applied. Total rules applied 1334 place count 1115 transition count 993
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 1382 place count 1067 transition count 993
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 1382 place count 1067 transition count 792
Deduced a syphon composed of 201 places in 3 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 1784 place count 866 transition count 792
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1794 place count 856 transition count 782
Iterating global reduction 3 with 10 rules applied. Total rules applied 1804 place count 856 transition count 782
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1804 place count 856 transition count 779
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1810 place count 853 transition count 779
Performed 336 Post agglomeration using F-continuation condition with reduction of 48 identical transitions.
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 2482 place count 517 transition count 395
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2483 place count 516 transition count 394
Reduce places removed 46 places and 0 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 68 rules applied. Total rules applied 2551 place count 470 transition count 372
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2573 place count 448 transition count 372
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2573 place count 448 transition count 348
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2621 place count 424 transition count 348
Applied a total of 2621 rules in 124 ms. Remains 424 /1747 variables (removed 1323) and now considering 348/1697 (removed 1349) transitions.
// Phase 1: matrix 348 rows 424 cols
[2021-05-08 12:10:56] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-08 12:10:56] [INFO ] Implicit Places using invariants in 221 ms returned [176, 250, 324, 328, 332, 336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 405, 409, 413, 417, 423]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 222 ms to find 27 implicit places.
[2021-05-08 12:10:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 348 rows 397 cols
[2021-05-08 12:10:56] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:10:56] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Starting structural reductions, iteration 1 : 397/1747 places, 348/1697 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 372 transition count 323
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 372 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 371 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 371 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 370 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 370 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 369 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 369 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 368 transition count 319
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 368 transition count 319
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 367 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 367 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 366 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 366 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 365 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 365 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 364 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 364 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 363 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 363 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 362 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 362 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 361 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 361 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 360 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 360 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 359 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 359 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 358 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 358 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 357 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 357 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 356 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 356 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 355 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 355 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 354 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 354 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 353 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 353 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 352 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 352 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 351 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 351 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 350 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 350 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 349 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 349 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 348 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 348 transition count 299
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 347 transition count 298
Applied a total of 100 rules in 111 ms. Remains 347 /397 variables (removed 50) and now considering 298/348 (removed 50) transitions.
// Phase 1: matrix 298 rows 347 cols
[2021-05-08 12:10:56] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:10:57] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 298 rows 347 cols
[2021-05-08 12:10:57] [INFO ] Computed 75 place invariants in 1 ms
[2021-05-08 12:10:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-08 12:10:57] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 347/1747 places, 298/1697 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : AutoFlight-PT-24b-15 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s80 1), p0:(NEQ s75 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-24b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-24b-15 finished in 1363 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17861131440988023446
[2021-05-08 12:10:57] [INFO ] Too many transitions (1697) to apply POR reductions. Disabling POR matrices.
[2021-05-08 12:10:57] [INFO ] Applying decomposition
[2021-05-08 12:10:57] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17861131440988023446
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/ltsmin17861131440988023446]
[2021-05-08 12:10:57] [INFO ] Flatten gal took : 51 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/graph17539899947664403242.txt, -o, /tmp/graph17539899947664403242.bin, -w, /tmp/graph17539899947664403242.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/graph17539899947664403242.bin, -l, -1, -v, -w, /tmp/graph17539899947664403242.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 12:10:57] [INFO ] Decomposing Gal with order
[2021-05-08 12:10:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:10:58] [INFO ] Removed a total of 318 redundant transitions.
[2021-05-08 12:10:58] [INFO ] Flatten gal took : 154 ms
[2021-05-08 12:10:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-08 12:10:58] [INFO ] Time to serialize gal into /tmp/LTLFireability7916409967837638555.gal : 23 ms
[2021-05-08 12:10:58] [INFO ] Time to serialize properties into /tmp/LTLFireability7393079800760749766.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability7916409967837638555.gal, -t, CGAL, -LTL, /tmp/LTLFireability7393079800760749766.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability7916409967837638555.gal -t CGAL -LTL /tmp/LTLFireability7393079800760749766.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(X(X((X(F(!("((i4.u199.p687==1)&&(i22.u674.p2061==1))"))))&&(G((!("((i15.u214.p738==1)&&(i13.u471.p1584==1))"))&&(X((!("((i15.u214.p738==1)&&(i13.u471.p1584==1))"))U((("(i3.u218.p767!=1)")U(("((!((i4.u199.p687==1)&&(i22.u674.p2061==1)))&&(i3.u218.p767!=1))")||(G("(i3.u218.p767!=1)"))))||(G(!("((i15.u214.p738==1)&&(i13.u471.p1584==1))")))))))))))))
Formula 0 simplified : !XXX(XF!"((i4.u199.p687==1)&&(i22.u674.p2061==1))" & G(!"((i15.u214.p738==1)&&(i13.u471.p1584==1))" & X(!"((i15.u214.p738==1)&&(i13.u471.p1584==1))" U (("(i3.u218.p767!=1)" U ("((!((i4.u199.p687==1)&&(i22.u674.p2061==1)))&&(i3.u218.p767!=1))" | G"(i3.u218.p767!=1)")) | G!"((i15.u214.p738==1)&&(i13.u471.p1584==1))"))))
Compilation finished in 15342 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17861131440988023446]
Link finished in 53 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, --when, --ltl, X(X(X((X(<>((LTLAPp0==true)))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
WARNING : LTSmin timed out (>257 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, --when, --ltl, X(X(X((X(<>((LTLAPp0==true)))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
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, --when, --ltl, X([]((<>((LTLAPp4==true))||((LTLAPp5==true)&&X((LTLAPp6==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
WARNING : LTSmin timed out (>257 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, --when, --ltl, X([]((<>((LTLAPp4==true))||((LTLAPp5==true)&&X((LTLAPp6==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
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, --ltl, <>(([]((LTLAPp7==true))||[]((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
WARNING : LTSmin timed out (>257 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, --ltl, <>(([]((LTLAPp7==true))||[]((LTLAPp8==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
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, --when, --ltl, X(<>(((LTLAPp9==true)||((LTLAPp10==true) U ((LTLAPp11==true)||[]((LTLAPp10==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
LTSmin run took 836 ms.
FORMULA AutoFlight-PT-24b-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 2056 s
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, --when, --ltl, X(X(X((X(<>((LTLAPp0==true)))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
Detected timeout of ITS tools.
[2021-05-08 12:34:18] [INFO ] Applying decomposition
[2021-05-08 12:34:18] [INFO ] Flatten gal took : 328 ms
[2021-05-08 12:34:18] [INFO ] Decomposing Gal with order
[2021-05-08 12:34:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 12:34:19] [INFO ] Removed a total of 50 redundant transitions.
[2021-05-08 12:34:20] [INFO ] Flatten gal took : 357 ms
[2021-05-08 12:34:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 694 labels/synchronizations in 2169 ms.
[2021-05-08 12:34:36] [INFO ] Time to serialize gal into /tmp/LTLFireability16238812065153567314.gal : 136 ms
[2021-05-08 12:34:36] [INFO ] Time to serialize properties into /tmp/LTLFireability7278043482346746506.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability16238812065153567314.gal, -t, CGAL, -LTL, /tmp/LTLFireability7278043482346746506.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability16238812065153567314.gal -t CGAL -LTL /tmp/LTLFireability7278043482346746506.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((X(X(X((X(F(!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u163.p687==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u282.p2061==1))"))))&&(G((!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u167.p738==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u266.p1584==1))"))&&(X((!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u167.p738==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u266.p1584==1))"))U((("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u169.p767!=1)")U(("((!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u163.p687==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u282.p2061==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u169.p767!=1))")||(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u169.p767!=1)"))))||(G(!("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u167.p738==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u266.p1584==1))")))))))))))))
Formula 0 simplified : !XXX(XF!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u163.p687==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u282.p2061==1))" & G(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u167.p738==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u266.p1584==1))" & X(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u167.p738==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u266.p1584==1))" U (("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u169.p767!=1)" U ("((!((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u163.p687==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u282.p2061==1)))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u169.p767!=1))" | G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u169.p767!=1)")) | G!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u167.p738==1)&&(i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u266.p1584==1))"))))
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.956: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.957: LTL layer: formula: X(X(X((X(<>((LTLAPp0==true)))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))||[]((LTLAPp1==true)))))))))))
pins2lts-mc-linux64( 0/ 8), 1.035: "X(X(X((X(<>((LTLAPp0==true)))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))||[]((LTLAPp1==true)))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 1.383: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 1.455: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 1.559: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.787: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.947: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 2.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 2.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 2.026: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.029: buchi has 7 states
pins2lts-mc-linux64( 0/ 8), 2.044: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 3.129: DFS-FIFO for weak LTL, using special progress label 1710
pins2lts-mc-linux64( 0/ 8), 3.129: There are 1711 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.129: State length is 1748, there are 1708 groups
pins2lts-mc-linux64( 0/ 8), 3.129: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.129: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.129: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 3.129: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 3.480: ~1 levels ~960 states ~5104 transitions
pins2lts-mc-linux64( 7/ 8), 3.564: ~1 levels ~1920 states ~11584 transitions
pins2lts-mc-linux64( 7/ 8), 3.737: ~1 levels ~3840 states ~23800 transitions
pins2lts-mc-linux64( 3/ 8), 3.984: ~1 levels ~7680 states ~62304 transitions
pins2lts-mc-linux64( 4/ 8), 4.788: ~1 levels ~15360 states ~113320 transitions
pins2lts-mc-linux64( 3/ 8), 6.203: ~1 levels ~30720 states ~279864 transitions
pins2lts-mc-linux64( 3/ 8), 9.390: ~1 levels ~61440 states ~583464 transitions
pins2lts-mc-linux64( 4/ 8), 16.485: ~1 levels ~122880 states ~1106776 transitions
pins2lts-mc-linux64( 1/ 8), 30.594: ~1 levels ~245760 states ~2243688 transitions
pins2lts-mc-linux64( 4/ 8), 58.187: ~1 levels ~491520 states ~4772048 transitions
pins2lts-mc-linux64( 4/ 8), 115.854: ~1 levels ~983040 states ~9969152 transitions
pins2lts-mc-linux64( 1/ 8), 232.194: ~1 levels ~1966080 states ~21214480 transitions
pins2lts-mc-linux64( 1/ 8), 456.030: ~1 levels ~3932160 states ~42558304 transitions
pins2lts-mc-linux64( 0/ 8), 918.521: ~1 levels ~7864320 states ~90685320 transitions
pins2lts-mc-linux64( 2/ 8), 1800.609: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1800.880:
pins2lts-mc-linux64( 0/ 8), 1800.884: mean standard work distribution: 2.2% (states) 3.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 1800.894:
pins2lts-mc-linux64( 0/ 8), 1800.894: Explored 14608015 states 183149902 transitions, fanout: 12.538
pins2lts-mc-linux64( 0/ 8), 1800.894: Total exploration time 1797.720 sec (1797.670 sec minimum, 1797.700 sec on average)
pins2lts-mc-linux64( 0/ 8), 1800.894: States per second: 8126, Transitions per second: 101879
pins2lts-mc-linux64( 0/ 8), 1800.894:
pins2lts-mc-linux64( 0/ 8), 1800.894: Progress states detected: 31043765
pins2lts-mc-linux64( 0/ 8), 1800.894: Redundant explorations: -52.9439
pins2lts-mc-linux64( 0/ 8), 1800.894:
pins2lts-mc-linux64( 0/ 8), 1800.894: Queue width: 8B, total height: 26947648, memory: 205.59MB
pins2lts-mc-linux64( 0/ 8), 1800.894: Tree memory: 492.8MB, 16.6 B/state, compr.: 0.2%
pins2lts-mc-linux64( 0/ 8), 1800.894: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1800.894: Stored 1724 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1800.923: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1800.924: Est. total memory use: 698.4MB (~1229.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, --when, --ltl, X(X(X((X(<>((LTLAPp0==true)))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
255
java.lang.RuntimeException: Unexpected exception when executing 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, --when, --ltl, X(X(X((X(<>((LTLAPp0==true)))&&[](((LTLAPp1==true)&&X(((LTLAPp1==true) U (((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))||[]((LTLAPp1==true))))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin17861131440988023446]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-08 12:57:39] [INFO ] Flatten gal took : 72 ms
[2021-05-08 12:57:52] [INFO ] Input system was already deterministic with 1697 transitions.
[2021-05-08 12:57:52] [INFO ] Transformed 1747 places.
[2021-05-08 12:57:52] [INFO ] Transformed 1697 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-08 12:57:52] [INFO ] Time to serialize gal into /tmp/LTLFireability1003883821589692170.gal : 34 ms
[2021-05-08 12:57:52] [INFO ] Time to serialize properties into /tmp/LTLFireability11774423390429371759.ltl : 5 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-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability1003883821589692170.gal, -t, CGAL, -LTL, /tmp/LTLFireability11774423390429371759.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability1003883821589692170.gal -t CGAL -LTL /tmp/LTLFireability11774423390429371759.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X((X(F(!("((p687==1)&&(p2061==1))"))))&&(G((!("((p738==1)&&(p1584==1))"))&&(X((!("((p738==1)&&(p1584==1))"))U((("(p767!=1)")U(("((!((p687==1)&&(p2061==1)))&&(p767!=1))")||(G("(p767!=1)"))))||(G(!("((p738==1)&&(p1584==1))")))))))))))))
Formula 0 simplified : !XXX(XF!"((p687==1)&&(p2061==1))" & G(!"((p738==1)&&(p1584==1))" & X(!"((p738==1)&&(p1584==1))" U (("(p767!=1)" U ("((!((p687==1)&&(p2061==1)))&&(p767!=1))" | G"(p767!=1)")) | G!"((p738==1)&&(p1584==1))"))))
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="AutoFlight-PT-24b"
export BK_EXAMINATION="LTLFireability"
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 AutoFlight-PT-24b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037990100490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-24b.tgz
mv AutoFlight-PT-24b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;