About the Execution of ITS-LoLa for Referendum-COL-0015
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15745.980 | 3600000.00 | 768438.00 | 2061.80 | FFFFFTFFTFFFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2020-input.r172-smll-158987827700340.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-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 itslola
Input is Referendum-COL-0015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-158987827700340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.6K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 08:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 09:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 21:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.7K Mar 24 05:38 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 Referendum-COL-0015-CTLFireability-00
FORMULA_NAME Referendum-COL-0015-CTLFireability-01
FORMULA_NAME Referendum-COL-0015-CTLFireability-02
FORMULA_NAME Referendum-COL-0015-CTLFireability-03
FORMULA_NAME Referendum-COL-0015-CTLFireability-04
FORMULA_NAME Referendum-COL-0015-CTLFireability-05
FORMULA_NAME Referendum-COL-0015-CTLFireability-06
FORMULA_NAME Referendum-COL-0015-CTLFireability-07
FORMULA_NAME Referendum-COL-0015-CTLFireability-08
FORMULA_NAME Referendum-COL-0015-CTLFireability-09
FORMULA_NAME Referendum-COL-0015-CTLFireability-10
FORMULA_NAME Referendum-COL-0015-CTLFireability-11
FORMULA_NAME Referendum-COL-0015-CTLFireability-12
FORMULA_NAME Referendum-COL-0015-CTLFireability-13
FORMULA_NAME Referendum-COL-0015-CTLFireability-14
FORMULA_NAME Referendum-COL-0015-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1591393437758
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 21:44:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 21:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 21:44:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-05 21:44:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1035 ms
[2020-06-05 21:44:01] [INFO ] sort/places :
Dot->ready,
Voters->voting,voted_yes,voted_no,
[2020-06-05 21:44:01] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 46 PT places and 31.0 transition bindings in 19 ms.
[2020-06-05 21:44:01] [INFO ] Computed order based on color domains.
[2020-06-05 21:44:02] [INFO ] Unfolded HLPN to a Petri net with 46 places and 31 transitions in 20 ms.
[2020-06-05 21:44:02] [INFO ] Unfolded HLPN properties in 2 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 62 ms.
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 571 ms. (steps per millisecond=175 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 31 rows 46 cols
[2020-06-05 21:44:02] [INFO ] Computed 15 place invariants in 6 ms
[2020-06-05 21:44:02] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned unsat
[2020-06-05 21:44:02] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-05 21:44:02] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 21:44:03] [INFO ] Flatten gal took : 48 ms
[2020-06-05 21:44:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 21:44:03] [INFO ] Flatten gal took : 14 ms
FORMULA Referendum-COL-0015-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0015-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 21:44:03] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-05 21:44:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Referendum-COL-0015 @ 3570 seconds
FORMULA Referendum-COL-0015-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Referendum-COL-0015-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2816
rslt: Output for CTLFireability @ Referendum-COL-0015
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 21:44:04 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45))))",
"processed_size": 235,
"rewrites": 125
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 16
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EX(((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))",
"processed_size": 216,
"rewrites": 124
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(EX(AF((1 <= p45))))",
"processed_size": 22,
"rewrites": 126
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 358,
"markings": 345,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p45 <= 0)))",
"processed_size": 18,
"rewrites": 125
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))",
"processed_size": 212,
"rewrites": 127
},
"result":
{
"edges": 65535,
"markings": 65536,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 15,
"problems": 15
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EX(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))",
"processed_size": 216,
"rewrites": 124
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "EX((EG(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (p45 <= 0)))",
"processed_size": 237,
"rewrites": 125
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 143489070,
"markings": 14348907,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))",
"processed_size": 212,
"rewrites": 125
},
"result":
{
"edges": 15,
"markings": 16,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 15
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 492
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 3,
"aneg": 0,
"comp": 45,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 45,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EG((AF(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (EF(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) OR EX(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))",
"processed_size": 665,
"rewrites": 127
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 172154121,
"markings": 14348908,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 552
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ((1 <= p45) AND (p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))))",
"processed_size": 452,
"rewrites": 124
},
"result":
{
"edges": 142997551,
"markings": 14316140,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 638
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AF((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)) AND AG(((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))))",
"processed_size": 439,
"rewrites": 125
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 143521841,
"markings": 14348908,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 768
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 768
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p45 <= 0)",
"processed_size": 10,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1024
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45))))",
"processed_size": 235,
"rewrites": 124
},
"result":
{
"edges": 142997551,
"markings": 14316140,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 16
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 984
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G ((F (((p45 <= 0))) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))",
"processed_size": 238,
"rewrites": 133
},
"result":
{
"edges": 143521839,
"markings": 14348908,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1408
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1408
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))",
"processed_size": 198,
"rewrites": 150
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G (((1 <= p45) U ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))",
"processed_size": 231,
"rewrites": 125
},
"result":
{
"edges": 20,
"markings": 20,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2816
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (((p45 <= 0) R ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))",
"processed_size": 231,
"rewrites": 128
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 15,
"problems": 15
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (((p45 <= 0) R ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))",
"processed_size": 231,
"rewrites": 128
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"type": "universal_release",
"workflow": "stateequation"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))",
"processed_size": 212,
"rewrites": 127
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 70572,
"runtime": 754.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(X(**)) OR (A(G(**)) AND A(F(E(X(**)))))) : E(X(E(X(A(F(**)))))) : (A(G(*)) OR (E(X(**)) AND E(F(A(G(**)))))) : (** OR E(G(**))) : A(F((** AND A(G(*))))) : E(G(**)) : (E(X((E(G(**)) AND **))) AND E(X(**))) : E(F((E(G(**)) AND **))) : (A(G(A((** U **)))) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))))))) : (E(F(A(G(*)))) OR A((* R *))) : E(X(E(F(*)))) : E(G((A(F(**)) AND (E(F(**)) OR E(X(**))))))"
},
"net":
{
"arcs": 76,
"conflict_clusters": 46,
"places": 46,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 31
},
"result":
{
"preliminary_value": "no no no no yes no no no no yes yes no ",
"value": "no no no no yes no no no no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 77/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 46
lola: finding significant places
lola: 46 places, 31 transitions, 31 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A ((A (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45)))) U E (X (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))))) : E (X (E (X (A (F ((1 <= p45))))))) : (NOT(E (F ((1 <= p45)))) OR (E (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND E (F (A (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))))) : ((p45 <= 0) OR E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45))))) : A (F ((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)) AND NOT(E (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))))) : E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ((1 <= p45) AND (p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))) : (E (X ((E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND (p45 <= 0)))) AND E (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) : E (F ((E (G (((1 <= p45)))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))) : (((((((((((((((A (G (A (((1 <= p45) U ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))) OR (1 <= p0)) OR (1 <= p1)) OR (1 <= p2)) OR (1 <= p3)) OR (1 <= p4)) OR (1 <= p5)) OR (1 <= p6)) OR (1 <= p7)) OR (1 <= p8)) OR (1 <= p9)) OR (1 <= p10)) OR (1 <= p11)) OR (1 <= p12)) OR (1 <= p13)) OR (1 <= p14)) : (E (F (NOT(E (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))) OR NOT(E (((1 <= p45) U ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))))) : E (F (NOT(A (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))) : E (G ((A (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND (E (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) OR E (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))) OR (A (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45))))
lola: processed formula length: 235
lola: 125 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p45 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))
lola: processed formula length: 216
lola: 124 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (A (F ((1 <= p45)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX(AF((1 <= p45))))
lola: processed formula length: 22
lola: 126 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 345 markings, 358 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p45 <= 0))) OR (E (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND E (F (A (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p45 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p45 <= 0)))
lola: processed formula length: 18
lola: 125 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p45)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: processed formula length: 212
lola: 127 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 15 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 15 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: write sara problem file to CTLFireability-3-1.sara
lola: lola: state equation: calling and running sarastate equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.sara:
try reading problem file CTLFireability-3-1.sara.
sara: sara: place or transition ordering is non-deterministicplace or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 65536 markings, 65535 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND (p45 <= 0)))) AND E (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))
lola: processed formula length: 216
lola: 124 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND (p45 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EG(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (p45 <= 0)))
lola: processed formula length: 237
lola: 125 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 809619 markings, 6465071 edges, 161924 markings/sec, 0 secs
lola: 1536879 markings, 13157642 edges, 145452 markings/sec, 5 secs
lola: 2293823 markings, 19746967 edges, 151389 markings/sec, 10 secs
lola: 2982551 markings, 26182896 edges, 137746 markings/sec, 15 secs
lola: 3648827 markings, 32573723 edges, 133255 markings/sec, 20 secs
lola: 4270841 markings, 38864485 edges, 124403 markings/sec, 25 secs
lola: 4844821 markings, 45074873 edges, 114796 markings/sec, 30 secs
lola: 5565917 markings, 51360925 edges, 144219 markings/sec, 35 secs
lola: 6231279 markings, 57576344 edges, 133072 markings/sec, 40 secs
lola: 6869947 markings, 63708741 edges, 127734 markings/sec, 45 secs
lola: 7473065 markings, 69819780 edges, 120624 markings/sec, 50 secs
lola: 8014884 markings, 75785861 edges, 108364 markings/sec, 55 secs
lola: 8667383 markings, 81914384 edges, 130500 markings/sec, 60 secs
lola: 9299468 markings, 88005495 edges, 126417 markings/sec, 65 secs
lola: 9874907 markings, 94056625 edges, 115088 markings/sec, 70 secs
lola: 10458576 markings, 100067413 edges, 116734 markings/sec, 75 secs
lola: 11049315 markings, 106076272 edges, 118148 markings/sec, 80 secs
lola: 11581866 markings, 111958293 edges, 106510 markings/sec, 85 secs
lola: 12164677 markings, 117990558 edges, 116562 markings/sec, 90 secs
lola: 12702024 markings, 123926534 edges, 107469 markings/sec, 95 secs
lola: 13225213 markings, 129809488 edges, 104638 markings/sec, 100 secs
lola: 13734319 markings, 135683670 edges, 101821 markings/sec, 105 secs
lola: 14200361 markings, 141431669 edges, 93208 markings/sec, 110 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348907 markings, 143489070 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: processed formula length: 212
lola: 125 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 16 markings, 15 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))) AND (E (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AF(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))) AND (EF(((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR ... (shortened)
lola: processed formula length: 665
lola: 127 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 702722 markings, 6955703 edges, 140544 markings/sec, 0 secs
lola: 1342601 markings, 13899979 edges, 127976 markings/sec, 5 secs
lola: 1952958 markings, 20691368 edges, 122071 markings/sec, 10 secs
lola: 2557739 markings, 27388299 edges, 120956 markings/sec, 15 secs
lola: 3148997 markings, 34030535 edges, 118252 markings/sec, 20 secs
lola: 3711460 markings, 40597438 edges, 112493 markings/sec, 25 secs
lola: 4247743 markings, 47098613 edges, 107257 markings/sec, 30 secs
lola: 4734986 markings, 53459007 edges, 97449 markings/sec, 35 secs
lola: 5326553 markings, 59804113 edges, 118313 markings/sec, 40 secs
lola: 5884700 markings, 66239084 edges, 111629 markings/sec, 45 secs
lola: 6462529 markings, 72708148 edges, 115566 markings/sec, 50 secs
lola: 7000920 markings, 79050159 edges, 107678 markings/sec, 55 secs
lola: 7521606 markings, 85360598 edges, 104137 markings/sec, 60 secs
lola: 7960541 markings, 91195300 edges, 87787 markings/sec, 65 secs
lola: 8521170 markings, 97394282 edges, 112126 markings/sec, 70 secs
lola: 9062536 markings, 103744120 edges, 108273 markings/sec, 75 secs
lola: 9581158 markings, 110032492 edges, 103724 markings/sec, 80 secs
lola: 10050696 markings, 116174697 edges, 93908 markings/sec, 85 secs
lola: 10579763 markings, 122495388 edges, 105813 markings/sec, 90 secs
lola: 11078835 markings, 128534937 edges, 99814 markings/sec, 95 secs
lola: 11517134 markings, 134387398 edges, 87660 markings/sec, 100 secs
lola: 12030551 markings, 140597948 edges, 102683 markings/sec, 105 secs
lola: 12493619 markings, 146707052 edges, 92614 markings/sec, 110 secs
lola: 12977348 markings, 152894919 edges, 96746 markings/sec, 115 secs
lola: 13433556 markings, 158995492 edges, 91242 markings/sec, 120 secs
lola: 13855484 markings, 164823209 edges, 84386 markings/sec, 125 secs
lola: 14264011 markings, 170760605 edges, 81705 markings/sec, 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348908 markings, 172154121 edges
lola: ========================================
lola: subprocess 6 will run for 552 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ((1 <= p45) AND (p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ((1 <= p45) AND (p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <=... (shortened)
lola: processed formula length: 452
lola: 124 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND ((p45 <= 0) OR (1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: 790685 markings, 6277262 edges, 158137 markings/sec, 0 secs || sara is running 0 secs
lola: 1476730 markings, 12507859 edges, 137209 markings/sec, 5 secs || sara is running 5 secs
lola: 2170938 markings, 18635434 edges, 138842 markings/sec, 10 secs || sara is running 10 secs
lola: 2821812 markings, 24673558 edges, 130175 markings/sec, 15 secs || sara is running 15 secs
lola: 3453875 markings, 30666965 edges, 126413 markings/sec, 20 secs || sara is running 20 secs
lola: 4059016 markings, 36611820 edges, 121028 markings/sec, 25 secs || sara is running 25 secs
lola: 4611190 markings, 42503796 edges, 110435 markings/sec, 30 secs || sara is running 30 secs
lola: 5254232 markings, 48430033 edges, 128608 markings/sec, 35 secs || sara is running 35 secs
lola: 5874728 markings, 54285730 edges, 124099 markings/sec, 40 secs || sara is running 40 secs
lola: 6498770 markings, 60105522 edges, 124808 markings/sec, 45 secs || sara is running 45 secs
lola: 7092910 markings, 65861571 edges, 118828 markings/sec, 50 secs || sara is running 50 secs
lola: 7646229 markings, 71588359 edges, 110664 markings/sec, 55 secs || sara is running 55 secs
lola: 8175131 markings, 77061816 edges, 105780 markings/sec, 60 secs || sara is running 60 secs
lola: 8791857 markings, 82902089 edges, 123345 markings/sec, 65 secs || sara is running 65 secs
lola: 9378022 markings, 88688457 edges, 117233 markings/sec, 70 secs || sara is running 70 secs
lola: 9911984 markings, 94382070 edges, 106792 markings/sec, 75 secs || sara is running 75 secs
lola: 10472621 markings, 100086664 edges, 112127 markings/sec, 80 secs || sara is running 80 secs
lola: 11035195 markings, 105809456 edges, 112515 markings/sec, 85 secs || sara is running 85 secs
lola: 11543098 markings, 111432417 edges, 101581 markings/sec, 90 secs || sara is running 90 secs
lola: 12100372 markings, 117156015 edges, 111455 markings/sec, 95 secs || sara is running 95 secs
lola: 12607168 markings, 122773856 edges, 101359 markings/sec, 100 secs || sara is running 100 secs
lola: 13106879 markings, 128386735 edges, 99942 markings/sec, 105 secs || sara is running 105 secs
lola: 13602811 markings, 134022063 edges, 99186 markings/sec, 110 secs || sara is running 110 secs
lola: 14058973 markings, 139554389 edges, 91232 markings/sec, 115 secs || sara is running 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 14316140 markings, 142997551 edges
lola: ========================================
lola: subprocess 7 will run for 638 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)) AND A (G (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)) AND AG(((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 ... (shortened)
lola: processed formula length: 439
lola: 125 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 850797 markings, 6847731 edges, 170159 markings/sec, 0 secs
lola: 1551846 markings, 13327616 edges, 140210 markings/sec, 5 secs
lola: 2289163 markings, 19713618 edges, 147463 markings/sec, 10 secs
lola: 2957428 markings, 25973084 edges, 133653 markings/sec, 15 secs
lola: 3612328 markings, 32233793 edges, 130980 markings/sec, 20 secs
lola: 4226604 markings, 38433628 edges, 122855 markings/sec, 25 secs
lola: 4773960 markings, 44520913 edges, 109471 markings/sec, 30 secs
lola: 5501316 markings, 50768414 edges, 145471 markings/sec, 35 secs
lola: 6151144 markings, 56845036 edges, 129966 markings/sec, 40 secs
lola: 6780691 markings, 62866263 edges, 125909 markings/sec, 45 secs
lola: 7372137 markings, 68830800 edges, 118289 markings/sec, 50 secs
lola: 7911948 markings, 74708513 edges, 107962 markings/sec, 55 secs
lola: 8554928 markings, 80745966 edges, 128596 markings/sec, 60 secs
lola: 9158804 markings, 86717860 edges, 120775 markings/sec, 65 secs
lola: 9746118 markings, 92676006 edges, 117463 markings/sec, 70 secs
lola: 10299703 markings, 98553354 edges, 110717 markings/sec, 75 secs
lola: 10891136 markings, 104519609 edges, 118287 markings/sec, 80 secs
lola: 11437172 markings, 110405527 edges, 109207 markings/sec, 85 secs
lola: 12006486 markings, 116321135 edges, 113863 markings/sec, 90 secs
lola: 12531664 markings, 122170979 edges, 105036 markings/sec, 95 secs
lola: 13062623 markings, 128038684 edges, 106192 markings/sec, 100 secs
lola: 13579290 markings, 133906147 edges, 103333 markings/sec, 105 secs
lola: 14061476 markings, 139685520 edges, 96437 markings/sec, 110 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14348908 markings, 143521841 edges
lola: ========================================
lola: subprocess 8 will run for 768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p45 <= 0) OR E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 768 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p45 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p45 <= 0)
lola: processed formula length: 10
lola: 123 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 1024 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR (1 <= p45))))
lola: processed formula length: 235
lola: 124 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (p45 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation 0: solution produced
lola: 847707 markings, 6797065 edges, 169541 markings/sec, 0 secs || sara is running 0 secs
lola: 1545656 markings, 13236092 edges, 139590 markings/sec, 5 secs || sara is running 5 secs
lola: 2284921 markings, 19620964 edges, 147853 markings/sec, 10 secs || sara is running 10 secs
lola: 2955456 markings, 25873740 edges, 134107 markings/sec, 15 secs || sara is running 15 secs
lola: 3579404 markings, 31837431 edges, 124790 markings/sec, 20 secs || sara is running 20 secs
lola: 4189692 markings, 37976907 edges, 122058 markings/sec, 25 secs || sara is running 25 secs
lola: 4738145 markings, 44020695 edges, 109691 markings/sec, 30 secs || sara is running 30 secs
lola: 5456268 markings, 50233207 edges, 143625 markings/sec, 35 secs || sara is running 35 secs
lola: 6101238 markings, 56274792 edges, 128994 markings/sec, 40 secs || sara is running 40 secs
lola: 6732937 markings, 62289297 edges, 126340 markings/sec, 45 secs || sara is running 45 secs
lola: 7317324 markings, 68187039 edges, 116877 markings/sec, 50 secs || sara is running 50 secs
lola: 7863022 markings, 74044519 edges, 109140 markings/sec, 55 secs || sara is running 55 secs
lola: 8501587 markings, 80068360 edges, 127713 markings/sec, 60 secs || sara is running 60 secs
lola: 9107447 markings, 86026854 edges, 121172 markings/sec, 65 secs || sara is running 65 secs
lola: 9671705 markings, 91760424 edges, 112852 markings/sec, 70 secs || sara is running 70 secs
lola: 10218439 markings, 97629231 edges, 109347 markings/sec, 75 secs || sara is running 75 secs
lola: 10822322 markings, 103608511 edges, 120777 markings/sec, 80 secs || sara is running 80 secs
lola: 11371084 markings, 109503267 edges, 109752 markings/sec, 85 secs || sara is running 85 secs
lola: 11936558 markings, 115410482 edges, 113095 markings/sec, 90 secs || sara is running 90 secs
lola: 12456014 markings, 121226395 edges, 103891 markings/sec, 95 secs || sara is running 95 secs
lola: 12996135 markings, 127095992 edges, 108024 markings/sec, 100 secs || sara is running 100 secs
lola: 13503202 markings, 132912183 edges, 101413 markings/sec, 105 secs || sara is running 105 secs
lola: 13988245 markings, 138670142 edges, 97009 markings/sec, 110 secs || sara is running 110 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 14316140 markings, 142997551 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 984 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((1 <= p45)))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p45 <= 0))) OR ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))
lola: processed formula length: 238
lola: 133 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 778787 markings, 6208015 edges, 155757 markings/sec, 0 secs
lola: 1435027 markings, 12123454 edges, 131248 markings/sec, 5 secs
lola: 2083302 markings, 17872632 edges, 129655 markings/sec, 10 secs
lola: 2656085 markings, 23377549 edges, 114557 markings/sec, 15 secs
lola: 3271325 markings, 28968344 edges, 123048 markings/sec, 20 secs
lola: 3826769 markings, 34431290 edges, 111089 markings/sec, 25 secs
lola: 4362845 markings, 39894154 edges, 107215 markings/sec, 30 secs
lola: 4864808 markings, 45247745 edges, 100393 markings/sec, 35 secs
lola: 5482060 markings, 50586386 edges, 123450 markings/sec, 40 secs
lola: 6033458 markings, 55787101 edges, 110280 markings/sec, 45 secs
lola: 6568124 markings, 60942608 edges, 106933 markings/sec, 50 secs
lola: 7105878 markings, 66115136 edges, 107551 markings/sec, 55 secs
lola: 7604242 markings, 71250024 edges, 99673 markings/sec, 60 secs
lola: 8070031 markings, 76268666 edges, 93158 markings/sec, 65 secs
lola: 8620482 markings, 81422472 edges, 110090 markings/sec, 70 secs
lola: 9139999 markings, 86511574 edges, 103903 markings/sec, 75 secs
lola: 9646972 markings, 91623095 edges, 101395 markings/sec, 80 secs
lola: 10086550 markings, 96588387 edges, 87916 markings/sec, 85 secs
lola: 10613167 markings, 101691142 edges, 105323 markings/sec, 90 secs
lola: 11114271 markings, 106819164 edges, 100221 markings/sec, 95 secs
lola: 11563781 markings, 111820711 edges, 89902 markings/sec, 100 secs
lola: 12064642 markings, 116952877 edges, 100172 markings/sec, 105 secs
lola: 12509969 markings, 121943204 edges, 89065 markings/sec, 110 secs
lola: 12979591 markings, 127032015 edges, 93924 markings/sec, 115 secs
lola: 13423725 markings, 132076565 edges, 88827 markings/sec, 120 secs
lola: 13847152 markings, 137077758 edges, 84685 markings/sec, 125 secs
lola: 14239358 markings, 141983937 edges, 78441 markings/sec, 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 14348908 markings, 143521839 edges
lola: ========================================
lola: subprocess 10 will run for 1408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (((1 <= p45) U ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))) OR ((1 <= p0) OR ((1 <= p1) OR ((1 <= p2) OR ((1 <= p3) OR ((1 <= p4) OR ((1 <= p5) OR ((1 <= p6) OR ((1 <= p7) OR ((1 <= p8) OR ((1 <= p9) OR ((1 <= p10) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) OR ((1 <= p1) OR ((1 <= p2) OR ((1 <= p3) OR ((1 <= p4) OR ((1 <= p5) OR ((1 <= p6) OR ((1 <= p7) OR ((1 <= p8) OR ((1 <= p9) OR ((1 <= p10) OR ((1 <= p11) OR ((1 <= p12) OR ((1 <= p13) OR (1 <= p14)))))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))
lola: processed formula length: 198
lola: 150 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 15 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 2816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((1 <= p45) U ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p45) U ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))
lola: processed formula length: 231
lola: 125 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 20 markings, 20 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 2816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))))) OR A (((p45 <= 0) R ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p45 <= 0) R ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p45 <= 0) R ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))
lola: processed formula length: 231
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0)))))) OR A (((p45 <= 0) R ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((p45 <= 0) R ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((p45 <= 0) R ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))
lola: processed formula length: 231
lola: 128 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))
lola: processed formula length: 212
lola: 127 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 17 markings, 16 edges
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 1: ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (1 <= p9) OR (1 <= p10) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))
lola: formula 0: ((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (p8 <= 0) AND (p9 <= 0) AND (p10 <= 0) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no yes yes no
lola:
preliminary result: no no no no yes no no no no yes yes no
lola: memory consumption: 70572 KB
lola: time consumption: 754 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
--------------------
content from stderr:
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="Referendum-COL-0015"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is Referendum-COL-0015, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r172-smll-158987827700340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0015.tgz
mv Referendum-COL-0015 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;