About the Execution of ITS-Tools for BusinessProcesses-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.508 | 3600000.00 | 13933749.00 | 5782.70 | FTFFFF?FFFFTTF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918600476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 23:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 23:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 23:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 192K May 10 09:33 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 BusinessProcesses-PT-20-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-20-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652641645810
Running Version 202205111006
[2022-05-15 19:07:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 19:07:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:07:27] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2022-05-15 19:07:27] [INFO ] Transformed 782 places.
[2022-05-15 19:07:27] [INFO ] Transformed 697 transitions.
[2022-05-15 19:07:27] [INFO ] Found NUPN structural information;
[2022-05-15 19:07:27] [INFO ] Parsed PT model containing 782 places and 697 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 63 places in 15 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 719 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 719/719 places, 638/638 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 705 transition count 638
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 110 place count 609 transition count 542
Iterating global reduction 1 with 96 rules applied. Total rules applied 206 place count 609 transition count 542
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 254 place count 561 transition count 494
Iterating global reduction 1 with 48 rules applied. Total rules applied 302 place count 561 transition count 494
Applied a total of 302 rules in 138 ms. Remains 561 /719 variables (removed 158) and now considering 494/638 (removed 144) transitions.
// Phase 1: matrix 494 rows 561 cols
[2022-05-15 19:07:27] [INFO ] Computed 107 place invariants in 36 ms
[2022-05-15 19:07:27] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 494 rows 561 cols
[2022-05-15 19:07:28] [INFO ] Computed 107 place invariants in 12 ms
[2022-05-15 19:07:28] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1068 ms to find 0 implicit places.
// Phase 1: matrix 494 rows 561 cols
[2022-05-15 19:07:28] [INFO ] Computed 107 place invariants in 11 ms
[2022-05-15 19:07:29] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 561/719 places, 494/638 transitions.
Finished structural reductions, in 1 iterations. Remains : 561/719 places, 494/638 transitions.
Support contains 48 out of 561 places after structural reductions.
[2022-05-15 19:07:29] [INFO ] Flatten gal took : 97 ms
[2022-05-15 19:07:29] [INFO ] Flatten gal took : 33 ms
[2022-05-15 19:07:29] [INFO ] Input system was already deterministic with 494 transitions.
Support contains 47 out of 561 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 33) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 494 rows 561 cols
[2022-05-15 19:07:30] [INFO ] Computed 107 place invariants in 8 ms
[2022-05-15 19:07:31] [INFO ] [Real]Absence check using 64 positive place invariants in 38 ms returned sat
[2022-05-15 19:07:31] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 18 ms returned sat
[2022-05-15 19:07:31] [INFO ] After 676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2022-05-15 19:07:31] [INFO ] [Nat]Absence check using 64 positive place invariants in 35 ms returned sat
[2022-05-15 19:07:31] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 24 ms returned sat
[2022-05-15 19:07:32] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2022-05-15 19:07:32] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 5 ms to minimize.
[2022-05-15 19:07:32] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2022-05-15 19:07:32] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2022-05-15 19:07:33] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2022-05-15 19:07:33] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 1 ms to minimize.
[2022-05-15 19:07:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 668 ms
[2022-05-15 19:07:33] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:07:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-05-15 19:07:33] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 1 ms to minimize.
[2022-05-15 19:07:33] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 1 ms to minimize.
[2022-05-15 19:07:33] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 1 ms to minimize.
[2022-05-15 19:07:33] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 1 ms to minimize.
[2022-05-15 19:07:34] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 0 ms to minimize.
[2022-05-15 19:07:34] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 1 ms to minimize.
[2022-05-15 19:07:34] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 0 ms to minimize.
[2022-05-15 19:07:34] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 0 ms to minimize.
[2022-05-15 19:07:34] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-15 19:07:34] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 0 ms to minimize.
[2022-05-15 19:07:34] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 0 ms to minimize.
[2022-05-15 19:07:34] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 0 ms to minimize.
[2022-05-15 19:07:35] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 2 ms to minimize.
[2022-05-15 19:07:35] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 0 ms to minimize.
[2022-05-15 19:07:35] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 1 ms to minimize.
[2022-05-15 19:07:35] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 1 ms to minimize.
[2022-05-15 19:07:35] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 1 ms to minimize.
[2022-05-15 19:07:35] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 0 ms to minimize.
[2022-05-15 19:07:35] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 0 ms to minimize.
[2022-05-15 19:07:36] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 1 ms to minimize.
[2022-05-15 19:07:36] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 0 ms to minimize.
[2022-05-15 19:07:36] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 0 ms to minimize.
[2022-05-15 19:07:36] [INFO ] Deduced a trap composed of 96 places in 178 ms of which 0 ms to minimize.
[2022-05-15 19:07:36] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 1 ms to minimize.
[2022-05-15 19:07:36] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 0 ms to minimize.
[2022-05-15 19:07:37] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 1 ms to minimize.
[2022-05-15 19:07:37] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 0 ms to minimize.
[2022-05-15 19:07:37] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 1 ms to minimize.
[2022-05-15 19:07:37] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 4 ms to minimize.
[2022-05-15 19:07:37] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 0 ms to minimize.
[2022-05-15 19:07:37] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 1 ms to minimize.
[2022-05-15 19:07:37] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 0 ms to minimize.
[2022-05-15 19:07:38] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 1 ms to minimize.
[2022-05-15 19:07:38] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2022-05-15 19:07:38] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 1 ms to minimize.
[2022-05-15 19:07:38] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 0 ms to minimize.
[2022-05-15 19:07:38] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 1 ms to minimize.
[2022-05-15 19:07:38] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 1 ms to minimize.
[2022-05-15 19:07:38] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 1 ms to minimize.
[2022-05-15 19:07:39] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 0 ms to minimize.
[2022-05-15 19:07:39] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 1 ms to minimize.
[2022-05-15 19:07:39] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 1 ms to minimize.
[2022-05-15 19:07:39] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 1 ms to minimize.
[2022-05-15 19:07:39] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 0 ms to minimize.
[2022-05-15 19:07:39] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 1 ms to minimize.
[2022-05-15 19:07:39] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 0 ms to minimize.
[2022-05-15 19:07:40] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 0 ms to minimize.
[2022-05-15 19:07:40] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 0 ms to minimize.
[2022-05-15 19:07:40] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 0 ms to minimize.
[2022-05-15 19:07:40] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 1 ms to minimize.
[2022-05-15 19:07:40] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2022-05-15 19:07:41] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 0 ms to minimize.
[2022-05-15 19:07:41] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 0 ms to minimize.
[2022-05-15 19:07:41] [INFO ] Deduced a trap composed of 114 places in 108 ms of which 1 ms to minimize.
[2022-05-15 19:07:41] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 0 ms to minimize.
[2022-05-15 19:07:41] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 0 ms to minimize.
[2022-05-15 19:07:41] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8364 ms
[2022-05-15 19:07:42] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2022-05-15 19:07:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-15 19:07:42] [INFO ] After 10888ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 647 ms.
[2022-05-15 19:07:43] [INFO ] After 12064ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 11 properties in 331 ms.
Support contains 15 out of 561 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 561/561 places, 494/494 transitions.
Graph (complete) has 1241 edges and 561 vertex of which 557 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 557 transition count 420
Reduce places removed 70 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 74 rules applied. Total rules applied 145 place count 487 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 149 place count 483 transition count 416
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 149 place count 483 transition count 308
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 385 place count 355 transition count 308
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 398 place count 342 transition count 295
Iterating global reduction 3 with 13 rules applied. Total rules applied 411 place count 342 transition count 295
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 411 place count 342 transition count 293
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 415 place count 340 transition count 293
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 275 rules applied. Total rules applied 690 place count 201 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 691 place count 201 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 695 place count 199 transition count 163
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 701 place count 199 transition count 163
Applied a total of 701 rules in 101 ms. Remains 199 /561 variables (removed 362) and now considering 163/494 (removed 331) transitions.
Finished structural reductions, in 1 iterations. Remains : 199/561 places, 163/494 transitions.
Incomplete random walk after 10000 steps, including 787 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 214 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 207 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 212 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 208 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 222 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 218 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 215 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 209 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 200 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 1102450 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{0=1, 1=1, 2=1, 4=1, 5=1, 6=1, 7=1, 8=1}
Probabilistic random walk after 1102450 steps, saw 243869 distinct states, run finished after 3001 ms. (steps per millisecond=367 ) properties seen :8
Running SMT prover for 1 properties.
[2022-05-15 19:07:47] [INFO ] Flow matrix only has 162 transitions (discarded 1 similar events)
// Phase 1: matrix 162 rows 199 cols
[2022-05-15 19:07:47] [INFO ] Computed 84 place invariants in 5 ms
[2022-05-15 19:07:47] [INFO ] [Real]Absence check using 65 positive place invariants in 7 ms returned sat
[2022-05-15 19:07:47] [INFO ] [Real]Absence check using 65 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-15 19:07:47] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:07:47] [INFO ] [Nat]Absence check using 65 positive place invariants in 7 ms returned sat
[2022-05-15 19:07:47] [INFO ] [Nat]Absence check using 65 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-15 19:07:47] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:07:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 19:07:47] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-15 19:07:47] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-15 19:07:47] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 199/199 places, 163/163 transitions.
Graph (trivial) has 13 edges and 199 vertex of which 2 / 199 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 198 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 197 transition count 160
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 3 place count 197 transition count 154
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 189 transition count 154
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 27 place count 184 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 184 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 182 transition count 147
Applied a total of 31 rules in 39 ms. Remains 182 /199 variables (removed 17) and now considering 147/163 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/199 places, 147/163 transitions.
Incomplete random walk after 10000 steps, including 486 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 190 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 259093 steps, run visited all 1 properties in 801 ms. (steps per millisecond=323 )
Probabilistic random walk after 259093 steps, saw 79543 distinct states, run finished after 801 ms. (steps per millisecond=323 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-20-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 491 stabilizing places and 434 stable transitions
Graph (complete) has 1241 edges and 561 vertex of which 557 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.19 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X((X(p0)&&p0))&&G(p1)))))'
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 545 transition count 478
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 545 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 538 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 538 transition count 471
Applied a total of 46 rules in 75 ms. Remains 538 /561 variables (removed 23) and now considering 471/494 (removed 23) transitions.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:07:49] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:07:49] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:07:49] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:07:49] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:07:49] [INFO ] Computed 107 place invariants in 11 ms
[2022-05-15 19:07:50] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/561 places, 471/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 538/561 places, 471/494 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s180 1), p0:(EQ s264 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-00 finished in 1415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 4 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 545 transition count 478
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 545 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 538 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 538 transition count 471
Applied a total of 46 rules in 61 ms. Remains 538 /561 variables (removed 23) and now considering 471/494 (removed 23) transitions.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:07:50] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:07:50] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:07:50] [INFO ] Computed 107 place invariants in 11 ms
[2022-05-15 19:07:51] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:07:51] [INFO ] Computed 107 place invariants in 8 ms
[2022-05-15 19:07:51] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/561 places, 471/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 538/561 places, 471/494 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s510 1), p0:(AND (EQ s66 1) (EQ s330 1) (EQ s505 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-02 finished in 1263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(X(p0))))&&G(p0)))))'
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Graph (trivial) has 272 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1235 edges and 556 vertex of which 552 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 551 transition count 406
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 474 transition count 406
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 156 place count 474 transition count 295
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 400 place count 341 transition count 295
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 414 place count 327 transition count 281
Iterating global reduction 2 with 14 rules applied. Total rules applied 428 place count 327 transition count 281
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 428 place count 327 transition count 279
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 432 place count 325 transition count 279
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 278 rules applied. Total rules applied 710 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 714 place count 182 transition count 149
Applied a total of 714 rules in 66 ms. Remains 182 /561 variables (removed 379) and now considering 149/494 (removed 345) transitions.
[2022-05-15 19:07:51] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 182 cols
[2022-05-15 19:07:51] [INFO ] Computed 81 place invariants in 4 ms
[2022-05-15 19:07:51] [INFO ] Implicit Places using invariants in 121 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 135 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/561 places, 149/494 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 158/561 places, 149/494 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s123 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-03 finished in 254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Graph (trivial) has 273 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1235 edges and 556 vertex of which 552 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.8 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 551 transition count 405
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 473 transition count 405
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 158 place count 473 transition count 295
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 400 place count 341 transition count 295
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 415 place count 326 transition count 280
Iterating global reduction 2 with 15 rules applied. Total rules applied 430 place count 326 transition count 280
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 430 place count 326 transition count 278
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 434 place count 324 transition count 278
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 710 place count 184 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 714 place count 182 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 715 place count 181 transition count 148
Applied a total of 715 rules in 78 ms. Remains 181 /561 variables (removed 380) and now considering 148/494 (removed 346) transitions.
[2022-05-15 19:07:52] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 181 cols
[2022-05-15 19:07:52] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-15 19:07:52] [INFO ] Implicit Places using invariants in 174 ms returned []
[2022-05-15 19:07:52] [INFO ] Flow matrix only has 147 transitions (discarded 1 similar events)
// Phase 1: matrix 147 rows 181 cols
[2022-05-15 19:07:52] [INFO ] Computed 81 place invariants in 1 ms
[2022-05-15 19:07:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 19:07:52] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [5, 48, 49, 50, 51, 52, 53, 54, 55, 56, 69, 71, 73, 81, 115, 117, 119, 121, 123, 125, 127]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 431 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/561 places, 148/494 transitions.
Graph (complete) has 582 edges and 160 vertex of which 151 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 151 transition count 140
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 147 transition count 140
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 20 place count 136 transition count 101
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 136 transition count 101
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 136 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 135 transition count 100
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 35 place count 133 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 133 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 133 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 40 place count 132 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 44 place count 130 transition count 94
Applied a total of 44 rules in 21 ms. Remains 130 /160 variables (removed 30) and now considering 94/148 (removed 54) transitions.
[2022-05-15 19:07:52] [INFO ] Flow matrix only has 93 transitions (discarded 1 similar events)
// Phase 1: matrix 93 rows 130 cols
[2022-05-15 19:07:52] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-15 19:07:52] [INFO ] Implicit Places using invariants in 92 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 93 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 127/561 places, 94/494 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 127/561 places, 94/494 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-04 finished in 686 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(p1)&&p0)) U G((F(p2)||!p3))))'
Support contains 8 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 547 transition count 480
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 547 transition count 480
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 541 transition count 474
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 541 transition count 474
Applied a total of 40 rules in 34 ms. Remains 541 /561 variables (removed 20) and now considering 474/494 (removed 20) transitions.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:07:52] [INFO ] Computed 107 place invariants in 2 ms
[2022-05-15 19:07:52] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:07:52] [INFO ] Computed 107 place invariants in 8 ms
[2022-05-15 19:07:53] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:07:53] [INFO ] Computed 107 place invariants in 2 ms
[2022-05-15 19:07:53] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/561 places, 474/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/561 places, 474/494 transitions.
Stuttering acceptance computed with spot in 637 ms :[(AND (NOT p2) p3), (AND p0 p3 (NOT p2) p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND p3 (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 p3 p0), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND p3 (NOT p2) p1), acceptance={} source=4 dest: 7}, { cond=p1, acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 7}], [{ cond=(AND p3 (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=6 dest: 9}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(AND p3 (NOT p2) p1), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=9 dest: 10}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(AND (EQ s234 1) (EQ s428 1) (EQ s499 1)), p2:(EQ s505 1), p0:(AND (EQ s165 1) (EQ s384 1) (EQ s475 1)), p1:(EQ s304 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33361 reset in 504 ms.
Product exploration explored 100000 steps with 33274 reset in 356 ms.
Computed a total of 473 stabilizing places and 416 stable transitions
Graph (complete) has 1212 edges and 541 vertex of which 537 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Computed a total of 473 stabilizing places and 416 stable transitions
Detected a total of 473/541 stabilizing places and 416/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p3) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 1550 ms. Reduced automaton from 11 states, 23 edges and 4 AP to 11 states, 23 edges and 4 AP.
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p2) p3), (AND p0 p3 (NOT p2) p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND p3 (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1 p3 p0), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:07:58] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:07:58] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2022-05-15 19:07:58] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-15 19:07:58] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-05-15 19:07:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-15 19:07:58] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-15 19:07:59] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2022-05-15 19:07:59] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2022-05-15 19:07:59] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 0 ms to minimize.
[2022-05-15 19:07:59] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 0 ms to minimize.
[2022-05-15 19:07:59] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:07:59] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:07:59] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2022-05-15 19:07:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 692 ms
[2022-05-15 19:07:59] [INFO ] After 1162ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-05-15 19:08:00] [INFO ] After 1438ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 8 out of 541 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 246 edges and 541 vertex of which 6 / 541 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1205 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 534 transition count 400
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 469 transition count 400
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 132 place count 469 transition count 292
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 237 rules applied. Total rules applied 369 place count 340 transition count 292
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 660 place count 193 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 664 place count 191 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 666 place count 191 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 668 place count 189 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 669 place count 189 transition count 153
Applied a total of 669 rules in 56 ms. Remains 189 /541 variables (removed 352) and now considering 153/474 (removed 321) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/541 places, 153/474 transitions.
Finished random walk after 3812 steps, including 146 resets, run visited all 5 properties in 22 ms. (steps per millisecond=173 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 (NOT p2) p0))), (X (NOT (AND (NOT p2) p0))), (X (AND (NOT p3) (NOT p2))), (X (NOT p0)), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p3 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p2)))), (F (AND (NOT p2) p0)), (F p1), (F (AND p3 p1 (NOT p2))), (F (AND p3 (NOT p2))), (F p0), (F (AND (NOT p3) (NOT p2) p0)), (F (AND (NOT p3) p1 (NOT p2))), (F (AND p1 (NOT p2))), (F p2)]
Knowledge based reduction with 19 factoid took 2178 ms. Reduced automaton from 11 states, 23 edges and 4 AP to 11 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 789 ms :[(AND (NOT p2) p3), (AND p0 (NOT p2) p3 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p1), (AND (NOT p2) p0 p3 p1), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p2) p3), (AND p0 (NOT p2) p3 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p1), (AND (NOT p2) p0 p3 p1), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Support contains 8 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Applied a total of 0 rules in 12 ms. Remains 541 /541 variables (removed 0) and now considering 474/474 (removed 0) transitions.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:08:03] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:08:03] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:08:03] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:08:04] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:08:04] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:08:04] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/541 places, 474/474 transitions.
Computed a total of 473 stabilizing places and 416 stable transitions
Graph (complete) has 1212 edges and 541 vertex of which 537 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Computed a total of 473 stabilizing places and 416 stable transitions
Detected a total of 473/541 stabilizing places and 416/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1178 ms. Reduced automaton from 11 states, 21 edges and 4 AP to 11 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 522 ms :[(AND (NOT p2) p3), (AND p0 (NOT p2) p3 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p1), (AND (NOT p2) p0 p3 p1), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:08:06] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:08:06] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2022-05-15 19:08:06] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 11 ms returned sat
[2022-05-15 19:08:07] [INFO ] After 273ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-15 19:08:07] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2022-05-15 19:08:07] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2022-05-15 19:08:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2022-05-15 19:08:07] [INFO ] After 466ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 19:08:07] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 19:08:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-15 19:08:07] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 10 ms returned sat
[2022-05-15 19:08:07] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 19:08:07] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:08:07] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:08:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2022-05-15 19:08:08] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-05-15 19:08:08] [INFO ] After 834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 8 out of 541 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 246 edges and 541 vertex of which 6 / 541 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1205 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 534 transition count 400
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 469 transition count 400
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 132 place count 469 transition count 292
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 237 rules applied. Total rules applied 369 place count 340 transition count 292
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 660 place count 193 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 664 place count 191 transition count 155
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 666 place count 191 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 668 place count 189 transition count 153
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 669 place count 189 transition count 153
Applied a total of 669 rules in 36 ms. Remains 189 /541 variables (removed 352) and now considering 153/474 (removed 321) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/541 places, 153/474 transitions.
Finished random walk after 4481 steps, including 195 resets, run visited all 4 properties in 17 ms. (steps per millisecond=263 )
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1 p3)), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND (NOT p2) p1)), (F p1), (F (AND (NOT p2) p3)), (F (AND (NOT p2) p0)), (F p0), (F (AND (NOT p2) p1 (NOT p3))), (F p2)]
Knowledge based reduction with 15 factoid took 1314 ms. Reduced automaton from 11 states, 21 edges and 4 AP to 11 states, 21 edges and 4 AP.
Stuttering acceptance computed with spot in 439 ms :[(AND (NOT p2) p3), (AND p0 (NOT p2) p3 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p1), (AND (NOT p2) p0 p3 p1), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p2) p3), (AND p0 (NOT p2) p3 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p1), (AND (NOT p2) p0 p3 p1), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p2) p3), (AND p0 (NOT p2) p3 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p1), (AND (NOT p2) p0 p3 p1), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Product exploration explored 100000 steps with 33337 reset in 370 ms.
Product exploration explored 100000 steps with 33326 reset in 320 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p2) p3), (AND p0 (NOT p2) p3 p1), (AND (NOT p2) p0 p1), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p1), (AND (NOT p2) p0 p3 p1), (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3 p1), (AND (NOT p2) p3)]
Support contains 8 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Graph (trivial) has 246 edges and 541 vertex of which 6 / 541 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1206 edges and 536 vertex of which 534 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 534 transition count 466
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 82 Pre rules applied. Total rules applied 62 place count 534 transition count 522
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 144 place count 534 transition count 522
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 169 place count 509 transition count 480
Deduced a syphon composed of 117 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 194 place count 509 transition count 480
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 291 places in 0 ms
Iterating global reduction 1 with 174 rules applied. Total rules applied 368 place count 509 transition count 480
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 413 place count 464 transition count 435
Deduced a syphon composed of 246 places in 0 ms
Iterating global reduction 1 with 45 rules applied. Total rules applied 458 place count 464 transition count 435
Deduced a syphon composed of 246 places in 0 ms
Applied a total of 458 rules in 87 ms. Remains 464 /541 variables (removed 77) and now considering 435/474 (removed 39) transitions.
[2022-05-15 19:08:12] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 435 rows 464 cols
[2022-05-15 19:08:12] [INFO ] Computed 107 place invariants in 5 ms
[2022-05-15 19:08:12] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 464/541 places, 435/474 transitions.
Finished structural reductions, in 1 iterations. Remains : 464/541 places, 435/474 transitions.
Product exploration explored 100000 steps with 33419 reset in 329 ms.
Product exploration explored 100000 steps with 33328 reset in 354 ms.
Built C files in :
/tmp/ltsmin706847868264493315
[2022-05-15 19:08:13] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin706847868264493315
Running compilation step : cd /tmp/ltsmin706847868264493315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 818 ms.
Running link step : cd /tmp/ltsmin706847868264493315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 257 ms.
Running LTSmin : cd /tmp/ltsmin706847868264493315;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11350878562987368221.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 474/474 transitions.
Applied a total of 0 rules in 20 ms. Remains 541 /541 variables (removed 0) and now considering 474/474 (removed 0) transitions.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:08:28] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:08:28] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:08:28] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 19:08:28] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:08:28] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 19:08:29] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/541 places, 474/474 transitions.
Built C files in :
/tmp/ltsmin11019017792871671147
[2022-05-15 19:08:29] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11019017792871671147
Running compilation step : cd /tmp/ltsmin11019017792871671147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 690 ms.
Running link step : cd /tmp/ltsmin11019017792871671147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11019017792871671147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12595850836942206277.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:08:44] [INFO ] Flatten gal took : 43 ms
[2022-05-15 19:08:44] [INFO ] Flatten gal took : 25 ms
[2022-05-15 19:08:44] [INFO ] Time to serialize gal into /tmp/LTL14941357069544462086.gal : 7 ms
[2022-05-15 19:08:44] [INFO ] Time to serialize properties into /tmp/LTL18075502366527934787.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14941357069544462086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18075502366527934787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1494135...268
Read 1 LTL properties
Checking formula 0 : !(((X(!(((X("(p383==1)"))&&("(p219==1)"))&&("((p502==1)&&(p679==1))"))))U(G((F("(p746==1)"))||(!("(((p292==1)&&(p557==1))&&(p733==1))"...161
Formula 0 simplified : !(X!("((p502==1)&&(p679==1))" & "(p219==1)" & X"(p383==1)") U G(!"(((p292==1)&&(p557==1))&&(p733==1))" | F"(p746==1)"))
Detected timeout of ITS tools.
[2022-05-15 19:08:59] [INFO ] Flatten gal took : 25 ms
[2022-05-15 19:08:59] [INFO ] Applying decomposition
[2022-05-15 19:08:59] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14291312303584814663.txt' '-o' '/tmp/graph14291312303584814663.bin' '-w' '/tmp/graph14291312303584814663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14291312303584814663.bin' '-l' '-1' '-v' '-w' '/tmp/graph14291312303584814663.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:08:59] [INFO ] Decomposing Gal with order
[2022-05-15 19:08:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:08:59] [INFO ] Removed a total of 284 redundant transitions.
[2022-05-15 19:08:59] [INFO ] Flatten gal took : 79 ms
[2022-05-15 19:08:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2022-05-15 19:08:59] [INFO ] Time to serialize gal into /tmp/LTL14998511363774188548.gal : 9 ms
[2022-05-15 19:08:59] [INFO ] Time to serialize properties into /tmp/LTL6309928067671661350.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14998511363774188548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6309928067671661350.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1499851...246
Read 1 LTL properties
Checking formula 0 : !(((X(!(((X("(i15.i1.u115.p383==1)"))&&("(i3.i0.u62.p219==1)"))&&("((i3.i2.u135.p502==1)&&(i3.i0.u165.p679==1))"))))U(G((F("(i18.u180....240
Formula 0 simplified : !(X!("((i3.i2.u135.p502==1)&&(i3.i0.u165.p679==1))" & "(i3.i0.u62.p219==1)" & X"(i15.i1.u115.p383==1)") U G(!"(((i12.u87.p292==1)&&(...221
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11404991103858849817
[2022-05-15 19:09:14] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11404991103858849817
Running compilation step : cd /tmp/ltsmin11404991103858849817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 720 ms.
Running link step : cd /tmp/ltsmin11404991103858849817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11404991103858849817;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(!(X((LTLAPp1==true))&&(LTLAPp0==true))) U []((<>((LTLAPp2==true))||!(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-LTLFireability-06 finished in 97207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Graph (trivial) has 271 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1235 edges and 556 vertex of which 552 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 78 place count 551 transition count 407
Reduce places removed 76 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 475 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 474 transition count 406
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 156 place count 474 transition count 296
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 398 place count 342 transition count 296
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 412 place count 328 transition count 282
Iterating global reduction 3 with 14 rules applied. Total rules applied 426 place count 328 transition count 282
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 426 place count 328 transition count 280
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 430 place count 326 transition count 280
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 707 place count 186 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 711 place count 184 transition count 150
Applied a total of 711 rules in 46 ms. Remains 184 /561 variables (removed 377) and now considering 150/494 (removed 344) transitions.
[2022-05-15 19:09:29] [INFO ] Flow matrix only has 149 transitions (discarded 1 similar events)
// Phase 1: matrix 149 rows 184 cols
[2022-05-15 19:09:29] [INFO ] Computed 82 place invariants in 3 ms
[2022-05-15 19:09:30] [INFO ] Implicit Places using invariants in 137 ms returned [27, 28, 29, 30, 31, 36, 37, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 138 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/561 places, 150/494 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/561 places, 150/494 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s121 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-07 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(F(p0))) U p1))&&G(X(X(p2)))))'
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 547 transition count 480
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 547 transition count 480
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 541 transition count 474
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 541 transition count 474
Applied a total of 40 rules in 53 ms. Remains 541 /561 variables (removed 20) and now considering 474/494 (removed 20) transitions.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:09:30] [INFO ] Computed 107 place invariants in 9 ms
[2022-05-15 19:09:30] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:09:30] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:09:31] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
// Phase 1: matrix 474 rows 541 cols
[2022-05-15 19:09:31] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 19:09:31] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/561 places, 474/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/561 places, 474/494 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(EQ s441 0), p1:(EQ s336 1), p0:(EQ s441 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 203 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-08 finished in 1285 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 547 transition count 480
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 547 transition count 480
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 540 transition count 473
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 540 transition count 473
Applied a total of 42 rules in 34 ms. Remains 540 /561 variables (removed 21) and now considering 473/494 (removed 21) transitions.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:31] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 19:09:31] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:31] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:09:32] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:32] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:09:32] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/561 places, 473/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/561 places, 473/494 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s502 1) (EQ s497 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 176 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-09 finished in 1106 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((X(p0)||p1))&&X(p2)))))'
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Graph (trivial) has 268 edges and 561 vertex of which 6 / 561 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1235 edges and 556 vertex of which 552 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 551 transition count 408
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 476 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 475 transition count 407
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 154 place count 475 transition count 298
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 393 place count 345 transition count 298
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 407 place count 331 transition count 284
Iterating global reduction 3 with 14 rules applied. Total rules applied 421 place count 331 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 421 place count 331 transition count 283
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 423 place count 330 transition count 283
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 701 place count 189 transition count 146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 705 place count 187 transition count 153
Applied a total of 705 rules in 46 ms. Remains 187 /561 variables (removed 374) and now considering 153/494 (removed 341) transitions.
[2022-05-15 19:09:32] [INFO ] Flow matrix only has 152 transitions (discarded 1 similar events)
// Phase 1: matrix 152 rows 187 cols
[2022-05-15 19:09:32] [INFO ] Computed 82 place invariants in 1 ms
[2022-05-15 19:09:32] [INFO ] Implicit Places using invariants in 113 ms returned [29, 30, 31, 32, 33, 38, 39, 43, 44, 45, 46, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 114 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 164/561 places, 153/494 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 164/561 places, 153/494 transitions.
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s36 1) (EQ s88 1) (EQ s127 1)), p1:(EQ s39 1), p0:(OR (AND (EQ s4 0) (EQ s36 1) (EQ s88 1) (EQ s127 1)) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-10 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p1)&&!(p2 U G(p3))&&p0)))))'
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 547 transition count 480
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 547 transition count 480
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 540 transition count 473
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 540 transition count 473
Applied a total of 42 rules in 34 ms. Remains 540 /561 variables (removed 21) and now considering 473/494 (removed 21) transitions.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:32] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:09:33] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:33] [INFO ] Computed 107 place invariants in 2 ms
[2022-05-15 19:09:33] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:33] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 19:09:33] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/561 places, 473/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/561 places, 473/494 transitions.
Stuttering acceptance computed with spot in 524 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 p3), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p3, acceptance={0} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s112 0) (EQ s380 0)), p3:(EQ s304 1), p2:(EQ s462 1), p1:(EQ s122 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 277 ms.
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Computed a total of 472 stabilizing places and 415 stable transitions
Graph (complete) has 1211 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 472 stabilizing places and 415 stable transitions
Detected a total of 472/540 stabilizing places and 415/473 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 329 ms. Reduced automaton from 8 states, 12 edges and 4 AP to 8 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:35] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:09:35] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-15 19:09:35] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 13 ms returned sat
[2022-05-15 19:09:36] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:09:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-15 19:09:36] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 20 ms returned sat
[2022-05-15 19:09:36] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:09:36] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:09:36] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:09:36] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:09:36] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:09:36] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:09:36] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:09:37] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:09:37] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:09:37] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2022-05-15 19:09:37] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2022-05-15 19:09:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 796 ms
[2022-05-15 19:09:37] [INFO ] After 1056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-15 19:09:37] [INFO ] After 1251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 540 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 540/540 places, 473/473 transitions.
Graph (trivial) has 250 edges and 540 vertex of which 6 / 540 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1204 edges and 535 vertex of which 533 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 533 transition count 396
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 465 transition count 395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 464 transition count 395
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 140 place count 464 transition count 285
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 381 place count 333 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 382 place count 332 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 383 place count 332 transition count 284
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 286 rules applied. Total rules applied 669 place count 187 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 673 place count 185 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 675 place count 185 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 677 place count 183 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 678 place count 183 transition count 148
Applied a total of 678 rules in 47 ms. Remains 183 /540 variables (removed 357) and now considering 148/473 (removed 325) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/540 places, 148/473 transitions.
Finished random walk after 86 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p3), (F (AND p0 (NOT p1))), (F (NOT p1)), (F p2), (F (NOT p0)), (F (AND p0 p2)), (F (AND p0 p3))]
Knowledge based reduction with 5 factoid took 421 ms. Reduced automaton from 8 states, 12 edges and 4 AP to 8 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Support contains 5 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 473/473 transitions.
Applied a total of 0 rules in 15 ms. Remains 540 /540 variables (removed 0) and now considering 473/473 (removed 0) transitions.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:38] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 19:09:38] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:38] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:09:39] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:39] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:09:39] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 540/540 places, 473/473 transitions.
Computed a total of 472 stabilizing places and 415 stable transitions
Graph (complete) has 1211 edges and 540 vertex of which 538 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 472 stabilizing places and 415 stable transitions
Detected a total of 472/540 stabilizing places and 415/473 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 8 states, 12 edges and 4 AP to 8 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 523 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 473 rows 540 cols
[2022-05-15 19:09:40] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 19:09:40] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-15 19:09:40] [INFO ] [Real]Absence check using 65 positive and 42 generalized place invariants in 17 ms returned sat
[2022-05-15 19:09:40] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 19:09:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-15 19:09:40] [INFO ] [Nat]Absence check using 65 positive and 42 generalized place invariants in 13 ms returned sat
[2022-05-15 19:09:41] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 0 ms to minimize.
[2022-05-15 19:09:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 733 ms
[2022-05-15 19:09:41] [INFO ] After 969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-15 19:09:41] [INFO ] After 1152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 540 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 540/540 places, 473/473 transitions.
Graph (trivial) has 250 edges and 540 vertex of which 6 / 540 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1204 edges and 535 vertex of which 533 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 533 transition count 396
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 465 transition count 395
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 464 transition count 395
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 140 place count 464 transition count 285
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 381 place count 333 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 382 place count 332 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 383 place count 332 transition count 284
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 286 rules applied. Total rules applied 669 place count 187 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 673 place count 185 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 675 place count 185 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 677 place count 183 transition count 148
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 678 place count 183 transition count 148
Applied a total of 678 rules in 39 ms. Remains 183 /540 variables (removed 357) and now considering 148/473 (removed 325) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/540 places, 148/473 transitions.
Finished random walk after 117 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p3), (F (AND p0 (NOT p1))), (F (NOT p1)), (F p2), (F (NOT p0)), (F (AND p0 p2)), (F (AND p0 p3))]
Knowledge based reduction with 5 factoid took 395 ms. Reduced automaton from 8 states, 12 edges and 4 AP to 8 states, 12 edges and 4 AP.
Stuttering acceptance computed with spot in 454 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 266 ms.
Product exploration explored 100000 steps with 25000 reset in 260 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p3, p3, (NOT p1)]
Support contains 5 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 473/473 transitions.
Graph (trivial) has 248 edges and 540 vertex of which 6 / 540 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1205 edges and 535 vertex of which 533 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 533 transition count 465
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 84 Pre rules applied. Total rules applied 64 place count 533 transition count 522
Deduced a syphon composed of 146 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 148 place count 533 transition count 522
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 175 place count 506 transition count 478
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 202 place count 506 transition count 478
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 289 places in 0 ms
Iterating global reduction 1 with 170 rules applied. Total rules applied 372 place count 506 transition count 478
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 416 place count 462 transition count 434
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 460 place count 462 transition count 434
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 246 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 461 place count 462 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 462 place count 461 transition count 445
Deduced a syphon composed of 245 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 463 place count 461 transition count 445
Deduced a syphon composed of 245 places in 0 ms
Applied a total of 463 rules in 72 ms. Remains 461 /540 variables (removed 79) and now considering 445/473 (removed 28) transitions.
[2022-05-15 19:09:44] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 445 rows 461 cols
[2022-05-15 19:09:44] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:09:44] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 461/540 places, 445/473 transitions.
Finished structural reductions, in 1 iterations. Remains : 461/540 places, 445/473 transitions.
Product exploration explored 100000 steps with 25000 reset in 982 ms.
Product exploration explored 100000 steps with 25000 reset in 954 ms.
Built C files in :
/tmp/ltsmin13981786265551299096
[2022-05-15 19:09:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13981786265551299096
Running compilation step : cd /tmp/ltsmin13981786265551299096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 728 ms.
Running link step : cd /tmp/ltsmin13981786265551299096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13981786265551299096;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1602669336501868288.hoa' '--buchi-type=spotba'
LTSmin run took 306 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-20-LTLFireability-11 finished in 16121 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(G(p1)&&p0))))'
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 546 transition count 479
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 546 transition count 479
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 539 transition count 472
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 539 transition count 472
Applied a total of 44 rules in 35 ms. Remains 539 /561 variables (removed 22) and now considering 472/494 (removed 22) transitions.
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 19:09:49] [INFO ] Computed 107 place invariants in 8 ms
[2022-05-15 19:09:49] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 19:09:49] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 19:09:49] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
// Phase 1: matrix 472 rows 539 cols
[2022-05-15 19:09:49] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 19:09:50] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 539/561 places, 472/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 539/561 places, 472/494 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s299 0), p1:(EQ s497 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 303 ms.
Product exploration explored 100000 steps with 33333 reset in 313 ms.
Computed a total of 471 stabilizing places and 414 stable transitions
Graph (complete) has 1210 edges and 539 vertex of which 537 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 471 stabilizing places and 414 stable transitions
Detected a total of 471/539 stabilizing places and 414/472 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 8 factoid took 151 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BusinessProcesses-PT-20-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-20-LTLFireability-12 finished in 2207 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Graph (complete) has 1241 edges and 561 vertex of which 557 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 556 transition count 417
Reduce places removed 72 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 75 rules applied. Total rules applied 148 place count 484 transition count 414
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 151 place count 481 transition count 414
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 151 place count 481 transition count 298
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 405 place count 343 transition count 298
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 420 place count 328 transition count 283
Iterating global reduction 3 with 15 rules applied. Total rules applied 435 place count 328 transition count 283
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 435 place count 328 transition count 281
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 439 place count 326 transition count 281
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Deduced a syphon composed of 135 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 713 place count 187 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 714 place count 187 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 718 place count 185 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 719 place count 184 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 720 place count 183 transition count 151
Applied a total of 720 rules in 44 ms. Remains 183 /561 variables (removed 378) and now considering 151/494 (removed 343) transitions.
[2022-05-15 19:09:51] [INFO ] Flow matrix only has 150 transitions (discarded 1 similar events)
// Phase 1: matrix 150 rows 183 cols
[2022-05-15 19:09:51] [INFO ] Computed 80 place invariants in 1 ms
[2022-05-15 19:09:51] [INFO ] Implicit Places using invariants in 111 ms returned [47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 124 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/561 places, 151/494 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/561 places, 151/494 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s45 1) (EQ s96 1) (EQ s147 1)), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-13 finished in 250 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U !p0))||X(((X(p1)&&p2)||p3))))'
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 548 transition count 481
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 548 transition count 481
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 542 transition count 475
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 542 transition count 475
Applied a total of 38 rules in 34 ms. Remains 542 /561 variables (removed 19) and now considering 475/494 (removed 19) transitions.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 19:09:51] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 19:09:51] [INFO ] Implicit Places using invariants in 192 ms returned []
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 19:09:51] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:09:52] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 19:09:52] [INFO ] Computed 107 place invariants in 5 ms
[2022-05-15 19:09:52] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 542/561 places, 475/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 542/561 places, 475/494 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p3:(EQ s320 1), p2:(EQ s397 1), p0:(NEQ s467 1), p1:(EQ s467 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 509 reset in 178 ms.
Product exploration explored 100000 steps with 503 reset in 193 ms.
Computed a total of 474 stabilizing places and 417 stable transitions
Graph (complete) has 1213 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 474 stabilizing places and 417 stable transitions
Detected a total of 474/542 stabilizing places and 417/475 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) p2))), (X (X p1)), (X (X p0)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 459 ms. Reduced automaton from 4 states, 6 edges and 4 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 938016 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 938016 steps, saw 145685 distinct states, run finished after 3002 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 475 rows 542 cols
[2022-05-15 19:09:56] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:09:56] [INFO ] [Real]Absence check using 64 positive place invariants in 17 ms returned sat
[2022-05-15 19:09:56] [INFO ] [Real]Absence check using 64 positive and 43 generalized place invariants in 11 ms returned sat
[2022-05-15 19:09:56] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 19:09:56] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 1 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2022-05-15 19:09:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1166 ms
[2022-05-15 19:09:58] [INFO ] After 1377ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:09:58] [INFO ] After 1496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:09:58] [INFO ] [Nat]Absence check using 64 positive place invariants in 18 ms returned sat
[2022-05-15 19:09:58] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 10 ms returned sat
[2022-05-15 19:09:58] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 1 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 0 ms to minimize.
[2022-05-15 19:09:58] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 0 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 1 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 0 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2022-05-15 19:09:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1092 ms
[2022-05-15 19:09:59] [INFO ] After 1279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-15 19:09:59] [INFO ] After 1404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 542 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 542/542 places, 475/475 transitions.
Graph (trivial) has 254 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1206 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 535 transition count 396
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 465 transition count 396
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 142 place count 465 transition count 284
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 246 rules applied. Total rules applied 388 place count 331 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 390 place count 329 transition count 282
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 329 transition count 282
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 678 place count 184 transition count 141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 682 place count 182 transition count 148
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 684 place count 182 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 686 place count 180 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 687 place count 180 transition count 146
Applied a total of 687 rules in 33 ms. Remains 180 /542 variables (removed 362) and now considering 146/475 (removed 329) transitions.
Finished structural reductions, in 1 iterations. Remains : 180/542 places, 146/475 transitions.
Finished random walk after 92 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND (NOT p3) p2))), (X (X p1)), (X (X p0)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 717 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 542 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 542/542 places, 475/475 transitions.
Graph (trivial) has 252 edges and 542 vertex of which 6 / 542 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1207 edges and 537 vertex of which 535 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 534 transition count 396
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 464 transition count 396
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 142 place count 464 transition count 286
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 384 place count 332 transition count 286
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 672 place count 186 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 676 place count 184 transition count 151
Applied a total of 676 rules in 27 ms. Remains 184 /542 variables (removed 358) and now considering 151/475 (removed 324) transitions.
[2022-05-15 19:10:00] [INFO ] Flow matrix only has 150 transitions (discarded 1 similar events)
// Phase 1: matrix 150 rows 184 cols
[2022-05-15 19:10:00] [INFO ] Computed 81 place invariants in 3 ms
[2022-05-15 19:10:00] [INFO ] Implicit Places using invariants in 127 ms returned [27, 28, 29, 30, 31, 36, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 129 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/542 places, 151/475 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 160/542 places, 151/475 transitions.
Computed a total of 84 stabilizing places and 96 stable transitions
Computed a total of 84 stabilizing places and 96 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1775 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 449 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1039 steps, run visited all 1 properties in 9 ms. (steps per millisecond=115 )
Probabilistic random walk after 1039 steps, saw 474 distinct states, run finished after 10 ms. (steps per millisecond=103 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 825 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15705 reset in 219 ms.
Product exploration explored 100000 steps with 15767 reset in 248 ms.
Built C files in :
/tmp/ltsmin1548878303576510809
[2022-05-15 19:10:02] [INFO ] Computing symmetric may disable matrix : 151 transitions.
[2022-05-15 19:10:02] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:10:02] [INFO ] Computing symmetric may enable matrix : 151 transitions.
[2022-05-15 19:10:02] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:10:02] [INFO ] Computing Do-Not-Accords matrix : 151 transitions.
[2022-05-15 19:10:02] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:10:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1548878303576510809
Running compilation step : cd /tmp/ltsmin1548878303576510809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 329 ms.
Running link step : cd /tmp/ltsmin1548878303576510809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1548878303576510809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16937479195734030255.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 151/151 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 158 transition count 149
Applied a total of 4 rules in 12 ms. Remains 158 /160 variables (removed 2) and now considering 149/151 (removed 2) transitions.
[2022-05-15 19:10:17] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 158 cols
[2022-05-15 19:10:17] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-15 19:10:17] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-15 19:10:17] [INFO ] Flow matrix only has 148 transitions (discarded 1 similar events)
// Phase 1: matrix 148 rows 158 cols
[2022-05-15 19:10:17] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-15 19:10:17] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 19:10:17] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [5, 44, 47, 48, 56, 90, 92, 94, 96, 98, 100, 102]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 286 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/160 places, 149/151 transitions.
Graph (complete) has 528 edges and 146 vertex of which 137 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 137 transition count 141
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 133 transition count 141
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 20 place count 122 transition count 102
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 122 transition count 102
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 122 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 121 transition count 101
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 35 place count 119 transition count 99
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 119 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 119 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 40 place count 118 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 44 place count 116 transition count 95
Applied a total of 44 rules in 10 ms. Remains 116 /146 variables (removed 30) and now considering 95/149 (removed 54) transitions.
[2022-05-15 19:10:17] [INFO ] Flow matrix only has 94 transitions (discarded 1 similar events)
// Phase 1: matrix 94 rows 116 cols
[2022-05-15 19:10:17] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-15 19:10:17] [INFO ] Implicit Places using invariants in 69 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 69 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/160 places, 95/151 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 113/160 places, 95/151 transitions.
Built C files in :
/tmp/ltsmin14299029188331814318
[2022-05-15 19:10:17] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2022-05-15 19:10:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:10:17] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2022-05-15 19:10:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:10:17] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2022-05-15 19:10:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:10:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14299029188331814318
Running compilation step : cd /tmp/ltsmin14299029188331814318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 217 ms.
Running link step : cd /tmp/ltsmin14299029188331814318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14299029188331814318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased904728809656196416.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 19:10:32] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:10:32] [INFO ] Flatten gal took : 11 ms
[2022-05-15 19:10:32] [INFO ] Time to serialize gal into /tmp/LTL7963088240519012053.gal : 2 ms
[2022-05-15 19:10:32] [INFO ] Time to serialize properties into /tmp/LTL11105109162195969143.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7963088240519012053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11105109162195969143.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7963088...267
Read 1 LTL properties
Checking formula 0 : !(((F(!(("(p664!=1)")U("(p664==1)"))))||(X(((X("(p664==0)"))&&("(p520==1)"))||("(p405==1)")))))
Formula 0 simplified : !(F!("(p664!=1)" U "(p664==1)") | X("(p405==1)" | ("(p520==1)" & X"(p664==0)")))
Detected timeout of ITS tools.
[2022-05-15 19:10:47] [INFO ] Flatten gal took : 15 ms
[2022-05-15 19:10:47] [INFO ] Applying decomposition
[2022-05-15 19:10:47] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10926252226967093529.txt' '-o' '/tmp/graph10926252226967093529.bin' '-w' '/tmp/graph10926252226967093529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10926252226967093529.bin' '-l' '-1' '-v' '-w' '/tmp/graph10926252226967093529.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:10:47] [INFO ] Decomposing Gal with order
[2022-05-15 19:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:10:47] [INFO ] Removed a total of 185 redundant transitions.
[2022-05-15 19:10:47] [INFO ] Flatten gal took : 19 ms
[2022-05-15 19:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 16 ms.
[2022-05-15 19:10:47] [INFO ] Time to serialize gal into /tmp/LTL16595104738204825634.gal : 3 ms
[2022-05-15 19:10:47] [INFO ] Time to serialize properties into /tmp/LTL2777923856283479290.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16595104738204825634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2777923856283479290.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1659510...246
Read 1 LTL properties
Checking formula 0 : !(((F(!(("(i4.i1.u38.p664!=1)")U("(i4.i1.u38.p664==1)"))))||(X(((X("(i4.i1.u38.p664==0)"))&&("(u27.p520==1)"))||("(i6.u8.p405==1)"))))...156
Formula 0 simplified : !(F!("(i4.i1.u38.p664!=1)" U "(i4.i1.u38.p664==1)") | X("(i6.u8.p405==1)" | ("(u27.p520==1)" & X"(i4.i1.u38.p664==0)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12311349006725407625
[2022-05-15 19:11:02] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12311349006725407625
Running compilation step : cd /tmp/ltsmin12311349006725407625;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin12311349006725407625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12311349006725407625;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(!((LTLAPp0==true) U !(LTLAPp0==true)))||X(((X((LTLAPp1==true))&&(LTLAPp2==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-20-LTLFireability-14 finished in 86654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(p0))||p1))))'
Support contains 5 out of 561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 561/561 places, 494/494 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 545 transition count 478
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 545 transition count 478
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 538 transition count 471
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 538 transition count 471
Applied a total of 46 rules in 33 ms. Remains 538 /561 variables (removed 23) and now considering 471/494 (removed 23) transitions.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:11:18] [INFO ] Computed 107 place invariants in 8 ms
[2022-05-15 19:11:18] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:11:18] [INFO ] Computed 107 place invariants in 6 ms
[2022-05-15 19:11:18] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:11:18] [INFO ] Computed 107 place invariants in 5 ms
[2022-05-15 19:11:19] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/561 places, 471/494 transitions.
Finished structural reductions, in 1 iterations. Remains : 538/561 places, 471/494 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s126 0) (EQ s361 0) (EQ s503 0)), p1:(AND (EQ s122 1) (EQ s224 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 507 reset in 197 ms.
Product exploration explored 100000 steps with 514 reset in 219 ms.
Computed a total of 470 stabilizing places and 413 stable transitions
Graph (complete) has 1209 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 470 stabilizing places and 413 stable transitions
Detected a total of 470/538 stabilizing places and 413/471 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 877456 steps, run timeout after 3001 ms. (steps per millisecond=292 ) properties seen :{}
Probabilistic random walk after 877456 steps, saw 137168 distinct states, run finished after 3001 ms. (steps per millisecond=292 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:11:23] [INFO ] Computed 107 place invariants in 4 ms
[2022-05-15 19:11:23] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:23] [INFO ] [Nat]Absence check using 64 positive place invariants in 18 ms returned sat
[2022-05-15 19:11:23] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 12 ms returned sat
[2022-05-15 19:11:23] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:23] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:11:23] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2022-05-15 19:11:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2022-05-15 19:11:23] [INFO ] After 440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-15 19:11:23] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 356 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=89 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 538 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 471/471 transitions.
Applied a total of 0 rules in 14 ms. Remains 538 /538 variables (removed 0) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:11:24] [INFO ] Computed 107 place invariants in 8 ms
[2022-05-15 19:11:24] [INFO ] Implicit Places using invariants in 188 ms returned []
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:11:24] [INFO ] Computed 107 place invariants in 3 ms
[2022-05-15 19:11:24] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:11:24] [INFO ] Computed 107 place invariants in 9 ms
[2022-05-15 19:11:25] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 538/538 places, 471/471 transitions.
Computed a total of 470 stabilizing places and 413 stable transitions
Graph (complete) has 1209 edges and 538 vertex of which 536 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 470 stabilizing places and 413 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 934386 steps, run timeout after 3001 ms. (steps per millisecond=311 ) properties seen :{}
Probabilistic random walk after 934386 steps, saw 145070 distinct states, run finished after 3001 ms. (steps per millisecond=311 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 471 rows 538 cols
[2022-05-15 19:11:28] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 19:11:28] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 19:11:28] [INFO ] [Nat]Absence check using 64 positive place invariants in 18 ms returned sat
[2022-05-15 19:11:28] [INFO ] [Nat]Absence check using 64 positive and 43 generalized place invariants in 13 ms returned sat
[2022-05-15 19:11:28] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 19:11:28] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 0 ms to minimize.
[2022-05-15 19:11:29] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:11:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2022-05-15 19:11:29] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-15 19:11:29] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 353 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=117 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 75643 steps with 382 reset in 133 ms.
FORMULA BusinessProcesses-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-20-LTLFireability-15 finished in 11643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(X(p1)&&p0)) U G((F(p2)||!p3))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U !p0))||X(((X(p1)&&p2)||p3))))'
[2022-05-15 19:11:29] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13220892166936601249
[2022-05-15 19:11:29] [INFO ] Computing symmetric may disable matrix : 494 transitions.
[2022-05-15 19:11:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:11:29] [INFO ] Computing symmetric may enable matrix : 494 transitions.
[2022-05-15 19:11:29] [INFO ] Applying decomposition
[2022-05-15 19:11:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:11:29] [INFO ] Flatten gal took : 22 ms
[2022-05-15 19:11:30] [INFO ] Computing Do-Not-Accords matrix : 494 transitions.
[2022-05-15 19:11:30] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 19:11:30] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13220892166936601249
Running compilation step : cd /tmp/ltsmin13220892166936601249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10479305846344704087.txt' '-o' '/tmp/graph10479305846344704087.bin' '-w' '/tmp/graph10479305846344704087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10479305846344704087.bin' '-l' '-1' '-v' '-w' '/tmp/graph10479305846344704087.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:11:30] [INFO ] Decomposing Gal with order
[2022-05-15 19:11:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:11:30] [INFO ] Removed a total of 276 redundant transitions.
[2022-05-15 19:11:30] [INFO ] Flatten gal took : 33 ms
[2022-05-15 19:11:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 7 ms.
[2022-05-15 19:11:30] [INFO ] Time to serialize gal into /tmp/LTLFireability4385704606165489421.gal : 5 ms
[2022-05-15 19:11:30] [INFO ] Time to serialize properties into /tmp/LTLFireability8624820133550942659.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4385704606165489421.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8624820133550942659.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !(((X(!(((X("(i16.i0.u113.p383==1)"))&&("(i7.i0.u61.p219==1)"))&&("((i7.i1.u137.p502==1)&&(i7.i2.u169.p679==1))"))))U(G((F("(i18.u183....246
Formula 0 simplified : !(X!("((i7.i1.u137.p502==1)&&(i7.i2.u169.p679==1))" & "(i7.i0.u61.p219==1)" & X"(i16.i0.u113.p383==1)") U G(!"(((i0.i0.u86.p292==1)&...227
Compilation finished in 1064 ms.
Running link step : cd /tmp/ltsmin13220892166936601249;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13220892166936601249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(!(X((LTLAPp1==true))&&(LTLAPp0==true))) U []((<>((LTLAPp2==true))||!(LTLAPp3==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t54, t223, t316, t334, t395, t396, t398, t400, t402, t404, t407, t414, t418, ...1700
Computing Next relation with stutter on 1.99596e+09 deadlock states
Detected timeout of ITS tools.
[2022-05-15 19:32:50] [INFO ] Applying decomposition
[2022-05-15 19:32:50] [INFO ] Flatten gal took : 54 ms
[2022-05-15 19:32:50] [INFO ] Decomposing Gal with order
[2022-05-15 19:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:32:51] [INFO ] Removed a total of 144 redundant transitions.
[2022-05-15 19:32:51] [INFO ] Flatten gal took : 95 ms
[2022-05-15 19:32:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 310 labels/synchronizations in 740 ms.
[2022-05-15 19:32:52] [INFO ] Time to serialize gal into /tmp/LTLFireability16145551091344030896.gal : 27 ms
[2022-05-15 19:32:52] [INFO ] Time to serialize properties into /tmp/LTLFireability11774789162065053877.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16145551091344030896.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11774789162065053877.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 2 LTL properties
Checking formula 0 : !(((X(!(((X("(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u13...466
Formula 0 simplified : !(X!("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u154.p502==1)&&(i1.u182.p679==1))" & "(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...447
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin13220892166936601249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(!(X((LTLAPp1==true))&&(LTLAPp0==true))) U []((<>((LTLAPp2==true))||!(LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13220892166936601249;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(!((LTLAPp4==true) U !(LTLAPp4==true)))||X(((X((LTLAPp5==true))&&(LTLAPp6==true))||(LTLAPp7==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 19:54:18] [INFO ] Flatten gal took : 215 ms
[2022-05-15 19:54:20] [INFO ] Input system was already deterministic with 494 transitions.
[2022-05-15 19:54:20] [INFO ] Transformed 561 places.
[2022-05-15 19:54:20] [INFO ] Transformed 494 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 19:54:50] [INFO ] Time to serialize gal into /tmp/LTLFireability12602398390206622985.gal : 29 ms
[2022-05-15 19:54:50] [INFO ] Time to serialize properties into /tmp/LTLFireability9083624349635148389.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12602398390206622985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9083624349635148389.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(!(((X("(p383==1)"))&&("(p219==1)"))&&("((p502==1)&&(p679==1))"))))U(G((F("(p746==1)"))||(!("(((p292==1)&&(p557==1))&&(p733==1))"...161
Formula 0 simplified : !(X!("((p502==1)&&(p679==1))" & "(p219==1)" & X"(p383==1)") U G(!"(((p292==1)&&(p557==1))&&(p733==1))" | F"(p746==1)"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="BusinessProcesses-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918600476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;