About the Execution of LTSMin+red for AutoFlight-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 779.348 | 2524367.00 | 8728197.00 | 1582.00 | FTFFFF?FFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167100164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutoFlight-PT-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 266K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-00
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-01
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-02
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-03
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-04
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-05
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-06
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-07
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-08
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-09
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-10
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-11
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-12
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-13
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-14
FORMULA_NAME AutoFlight-PT-12b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717190934894
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:28:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:28:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:28:57] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2024-05-31 21:28:57] [INFO ] Transformed 1126 places.
[2024-05-31 21:28:58] [INFO ] Transformed 1124 transitions.
[2024-05-31 21:28:58] [INFO ] Found NUPN structural information;
[2024-05-31 21:28:58] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Support contains 44 out of 1126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 980 transition count 978
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 980 transition count 978
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 313 place count 980 transition count 957
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 377 place count 916 transition count 893
Iterating global reduction 1 with 64 rules applied. Total rules applied 441 place count 916 transition count 893
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 452 place count 905 transition count 882
Iterating global reduction 1 with 11 rules applied. Total rules applied 463 place count 905 transition count 882
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 472 place count 896 transition count 873
Iterating global reduction 1 with 9 rules applied. Total rules applied 481 place count 896 transition count 873
Applied a total of 481 rules in 695 ms. Remains 896 /1126 variables (removed 230) and now considering 873/1124 (removed 251) transitions.
// Phase 1: matrix 873 rows 896 cols
[2024-05-31 21:28:59] [INFO ] Computed 76 invariants in 62 ms
[2024-05-31 21:29:00] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2024-05-31 21:29:00] [INFO ] Invariant cache hit.
[2024-05-31 21:29:02] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2892 ms to find 0 implicit places.
Running 872 sub problems to find dead transitions.
[2024-05-31 21:29:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/895 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 872 unsolved
SMT process timed out in 30454ms, After SMT, problems are : Problem set: 0 solved, 872 unsolved
Search for dead transitions found 0 dead transitions in 30529ms
Starting structural reductions in LTL mode, iteration 1 : 896/1126 places, 873/1124 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34170 ms. Remains : 896/1126 places, 873/1124 transitions.
Support contains 44 out of 896 places after structural reductions.
[2024-05-31 21:29:33] [INFO ] Flatten gal took : 191 ms
[2024-05-31 21:29:33] [INFO ] Flatten gal took : 99 ms
[2024-05-31 21:29:33] [INFO ] Input system was already deterministic with 873 transitions.
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 40000 steps (72 resets) in 2619 ms. (15 steps per ms) remains 7/36 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
[2024-05-31 21:29:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 182/194 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 640/834 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:29:35] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 74 ms to minimize.
[2024-05-31 21:29:36] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 5 ms to minimize.
[2024-05-31 21:29:36] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 3 ms to minimize.
[2024-05-31 21:29:36] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 3 ms to minimize.
[2024-05-31 21:29:36] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 4 ms to minimize.
[2024-05-31 21:29:36] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 62/896 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 21:29:37] [INFO ] Deduced a trap composed of 37 places in 482 ms of which 9 ms to minimize.
[2024-05-31 21:29:38] [INFO ] Deduced a trap composed of 21 places in 442 ms of which 8 ms to minimize.
[2024-05-31 21:29:38] [INFO ] Deduced a trap composed of 25 places in 367 ms of which 8 ms to minimize.
[2024-05-31 21:29:39] [INFO ] Deduced a trap composed of 19 places in 597 ms of which 9 ms to minimize.
[2024-05-31 21:29:39] [INFO ] Deduced a trap composed of 34 places in 527 ms of which 9 ms to minimize.
SMT process timed out in 5191ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 896 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 896/896 places, 873/873 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 318 transitions
Trivial Post-agglo rules discarded 318 transitions
Performed 318 trivial Post agglomeration. Transition count delta: 318
Iterating post reduction 0 with 318 rules applied. Total rules applied 318 place count 896 transition count 555
Reduce places removed 318 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 357 rules applied. Total rules applied 675 place count 578 transition count 516
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 700 place count 554 transition count 515
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 701 place count 553 transition count 515
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 701 place count 553 transition count 412
Deduced a syphon composed of 103 places in 2 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 907 place count 450 transition count 412
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 913 place count 444 transition count 406
Iterating global reduction 4 with 6 rules applied. Total rules applied 919 place count 444 transition count 406
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 919 place count 444 transition count 403
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 925 place count 441 transition count 403
Performed 169 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 169 places in 4 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1263 place count 272 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1264 place count 272 transition count 212
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1266 place count 272 transition count 210
Free-agglomeration rule applied 46 times.
Iterating global reduction 5 with 46 rules applied. Total rules applied 1312 place count 272 transition count 164
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 1358 place count 226 transition count 164
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1359 place count 225 transition count 163
Reduce places removed 51 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 6 with 120 rules applied. Total rules applied 1479 place count 174 transition count 94
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 70 rules applied. Total rules applied 1549 place count 105 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1550 place count 104 transition count 93
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 27 Pre rules applied. Total rules applied 1550 place count 104 transition count 66
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 9 with 54 rules applied. Total rules applied 1604 place count 77 transition count 66
Applied a total of 1604 rules in 557 ms. Remains 77 /896 variables (removed 819) and now considering 66/873 (removed 807) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 77/896 places, 66/873 transitions.
RANDOM walk for 40000 steps (1458 resets) in 1564 ms. (25 steps per ms) remains 1/7 properties
BEST_FIRST walk for 25748 steps (144 resets) in 47 ms. (536 steps per ms) remains 0/1 properties
Computed a total of 223 stabilizing places and 223 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(G(p0))||(p0&&F(p1))))||(X(p1)&&G(p2))))'
Support contains 4 out of 896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 882 transition count 859
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 882 transition count 859
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 882 transition count 856
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 877 transition count 851
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 874 transition count 848
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 873 transition count 847
Applied a total of 49 rules in 286 ms. Remains 873 /896 variables (removed 23) and now considering 847/873 (removed 26) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-31 21:29:41] [INFO ] Computed 76 invariants in 27 ms
[2024-05-31 21:29:42] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-05-31 21:29:42] [INFO ] Invariant cache hit.
[2024-05-31 21:29:43] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-31 21:29:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-31 21:30:13] [INFO ] Deduced a trap composed of 105 places in 636 ms of which 9 ms to minimize.
SMT process timed out in 30426ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30444ms
Starting structural reductions in LTL mode, iteration 1 : 873/896 places, 847/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32416 ms. Remains : 873/896 places, 847/873 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-00
Stuttering criterion allowed to conclude after 569 steps with 0 reset in 13 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-00 finished in 32948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(F(p0))))||(p1 U (p2||G(p1))))))'
Support contains 3 out of 896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 882 transition count 859
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 882 transition count 859
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 882 transition count 857
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 877 transition count 852
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 877 transition count 852
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 874 transition count 849
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 874 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 873 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 873 transition count 848
Applied a total of 48 rules in 152 ms. Remains 873 /896 variables (removed 23) and now considering 848/873 (removed 25) transitions.
// Phase 1: matrix 848 rows 873 cols
[2024-05-31 21:30:14] [INFO ] Computed 76 invariants in 7 ms
[2024-05-31 21:30:14] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-31 21:30:14] [INFO ] Invariant cache hit.
[2024-05-31 21:30:16] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1486 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-31 21:30:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-31 21:30:45] [INFO ] Deduced a trap composed of 112 places in 667 ms of which 9 ms to minimize.
[2024-05-31 21:30:46] [INFO ] Deduced a trap composed of 16 places in 652 ms of which 9 ms to minimize.
[2024-05-31 21:30:46] [INFO ] Deduced a trap composed of 35 places in 691 ms of which 8 ms to minimize.
SMT process timed out in 30699ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30710ms
Starting structural reductions in LTL mode, iteration 1 : 873/896 places, 848/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32350 ms. Remains : 873/896 places, 848/873 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Product exploration explored 100000 steps with 50000 reset in 382 ms.
Computed a total of 210 stabilizing places and 210 stable transitions
Computed a total of 210 stabilizing places and 210 stable transitions
Detected a total of 210/873 stabilizing places and 210/848 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 22 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLFireability-01 finished in 33578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Support contains 1 out of 896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 895 transition count 550
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 363 rules applied. Total rules applied 685 place count 573 transition count 509
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 710 place count 549 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 711 place count 548 transition count 508
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 711 place count 548 transition count 404
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 919 place count 444 transition count 404
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 929 place count 434 transition count 394
Iterating global reduction 4 with 10 rules applied. Total rules applied 939 place count 434 transition count 394
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 939 place count 434 transition count 388
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 951 place count 428 transition count 388
Performed 167 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 4 with 334 rules applied. Total rules applied 1285 place count 261 transition count 199
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1286 place count 260 transition count 198
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 34 rules applied. Total rules applied 1320 place count 237 transition count 187
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1331 place count 226 transition count 187
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1331 place count 226 transition count 175
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1355 place count 214 transition count 175
Applied a total of 1355 rules in 120 ms. Remains 214 /896 variables (removed 682) and now considering 175/873 (removed 698) transitions.
// Phase 1: matrix 175 rows 214 cols
[2024-05-31 21:30:48] [INFO ] Computed 53 invariants in 3 ms
[2024-05-31 21:30:48] [INFO ] Implicit Places using invariants in 192 ms returned [87, 125, 163, 167, 171, 176, 180, 184, 188, 192, 196, 200, 204, 208, 213]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 196 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/896 places, 175/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 186 transition count 162
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 184 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 183 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 183 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 182 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 182 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 181 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 181 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 180 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 179 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 179 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 178 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 178 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 177 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 177 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 176 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 176 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 175 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 175 transition count 151
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 174 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 174 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 173 transition count 149
Applied a total of 52 rules in 84 ms. Remains 173 /199 variables (removed 26) and now considering 149/175 (removed 26) transitions.
// Phase 1: matrix 149 rows 173 cols
[2024-05-31 21:30:48] [INFO ] Computed 38 invariants in 1 ms
[2024-05-31 21:30:48] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 21:30:48] [INFO ] Invariant cache hit.
[2024-05-31 21:30:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:30:48] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 173/896 places, 149/873 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 780 ms. Remains : 173/896 places, 149/873 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-02
Product exploration explored 100000 steps with 4370 reset in 331 ms.
Stack based approach found an accepted trace after 4291 steps with 182 reset with depth 4 and stack size 4 in 16 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-02 finished in 1188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 895 transition count 550
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 363 rules applied. Total rules applied 685 place count 573 transition count 509
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 709 place count 549 transition count 509
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 709 place count 549 transition count 404
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 919 place count 444 transition count 404
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 928 place count 435 transition count 395
Iterating global reduction 3 with 9 rules applied. Total rules applied 937 place count 435 transition count 395
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 937 place count 435 transition count 390
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 947 place count 430 transition count 390
Performed 168 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 1283 place count 262 transition count 200
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1284 place count 261 transition count 199
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 34 rules applied. Total rules applied 1318 place count 238 transition count 188
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1329 place count 227 transition count 188
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1329 place count 227 transition count 176
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1353 place count 215 transition count 176
Applied a total of 1353 rules in 112 ms. Remains 215 /896 variables (removed 681) and now considering 176/873 (removed 697) transitions.
// Phase 1: matrix 176 rows 215 cols
[2024-05-31 21:30:49] [INFO ] Computed 53 invariants in 2 ms
[2024-05-31 21:30:49] [INFO ] Implicit Places using invariants in 187 ms returned [88, 126, 164, 168, 172, 177, 181, 185, 189, 193, 197, 201, 205, 209, 214]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 190 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/896 places, 176/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 187 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 187 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 186 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 184 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 183 transition count 159
Applied a total of 34 rules in 34 ms. Remains 183 /200 variables (removed 17) and now considering 159/176 (removed 17) transitions.
// Phase 1: matrix 159 rows 183 cols
[2024-05-31 21:30:49] [INFO ] Computed 38 invariants in 1 ms
[2024-05-31 21:30:49] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 21:30:49] [INFO ] Invariant cache hit.
[2024-05-31 21:30:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:30:50] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 183/896 places, 159/873 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 793 ms. Remains : 183/896 places, 159/873 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-03
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-03 finished in 875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 882 transition count 859
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 882 transition count 859
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 882 transition count 856
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 878 transition count 852
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 878 transition count 852
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 876 transition count 850
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 876 transition count 850
Applied a total of 43 rules in 130 ms. Remains 876 /896 variables (removed 20) and now considering 850/873 (removed 23) transitions.
// Phase 1: matrix 850 rows 876 cols
[2024-05-31 21:30:50] [INFO ] Computed 76 invariants in 6 ms
[2024-05-31 21:30:50] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-31 21:30:50] [INFO ] Invariant cache hit.
[2024-05-31 21:30:51] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
Running 849 sub problems to find dead transitions.
[2024-05-31 21:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/875 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (OVERLAPS) 1/876 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/876 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-05-31 21:31:21] [INFO ] Deduced a trap composed of 117 places in 668 ms of which 9 ms to minimize.
[2024-05-31 21:31:22] [INFO ] Deduced a trap composed of 17 places in 642 ms of which 8 ms to minimize.
SMT process timed out in 30397ms, After SMT, problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 30407ms
Starting structural reductions in LTL mode, iteration 1 : 876/896 places, 850/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32086 ms. Remains : 876/896 places, 850/873 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-04 finished in 32249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 323 place count 895 transition count 549
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 363 rules applied. Total rules applied 686 place count 572 transition count 509
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 710 place count 548 transition count 509
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 710 place count 548 transition count 405
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 918 place count 444 transition count 405
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 928 place count 434 transition count 395
Iterating global reduction 3 with 10 rules applied. Total rules applied 938 place count 434 transition count 395
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 938 place count 434 transition count 389
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 950 place count 428 transition count 389
Performed 167 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 1284 place count 261 transition count 200
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1285 place count 260 transition count 199
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 34 rules applied. Total rules applied 1319 place count 237 transition count 188
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1330 place count 226 transition count 188
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1330 place count 226 transition count 176
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1354 place count 214 transition count 176
Applied a total of 1354 rules in 87 ms. Remains 214 /896 variables (removed 682) and now considering 176/873 (removed 697) transitions.
// Phase 1: matrix 176 rows 214 cols
[2024-05-31 21:31:22] [INFO ] Computed 53 invariants in 2 ms
[2024-05-31 21:31:22] [INFO ] Implicit Places using invariants in 195 ms returned [87, 125, 163, 167, 171, 176, 180, 184, 188, 192, 196, 200, 204, 208, 213]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 198 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 199/896 places, 176/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 186 transition count 163
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 186 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 185 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 185 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 184 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 184 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 183 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 183 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 182 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 182 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 181 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 181 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 180 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 180 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 179 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 179 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 178 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 178 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 177 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 177 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 176 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 176 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 175 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 175 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 174 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 174 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 173 transition count 150
Applied a total of 52 rules in 49 ms. Remains 173 /199 variables (removed 26) and now considering 150/176 (removed 26) transitions.
// Phase 1: matrix 150 rows 173 cols
[2024-05-31 21:31:22] [INFO ] Computed 38 invariants in 1 ms
[2024-05-31 21:31:22] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 21:31:22] [INFO ] Invariant cache hit.
[2024-05-31 21:31:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:31:23] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 173/896 places, 150/873 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 709 ms. Remains : 173/896 places, 150/873 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-05
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-05 finished in 809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1) U (G(p2) U (p3||X(p4)))))))'
Support contains 5 out of 896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 882 transition count 859
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 882 transition count 859
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 882 transition count 856
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 878 transition count 852
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 878 transition count 852
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 875 transition count 849
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 875 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 874 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 874 transition count 848
Applied a total of 47 rules in 157 ms. Remains 874 /896 variables (removed 22) and now considering 848/873 (removed 25) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-31 21:31:23] [INFO ] Computed 76 invariants in 5 ms
[2024-05-31 21:31:23] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-31 21:31:23] [INFO ] Invariant cache hit.
[2024-05-31 21:31:24] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-31 21:31:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 35 places in 640 ms of which 9 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 117 places in 548 ms of which 7 ms to minimize.
[2024-05-31 21:31:54] [INFO ] Deduced a trap composed of 16 places in 605 ms of which 9 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 113 places in 552 ms of which 8 ms to minimize.
SMT process timed out in 30266ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30274ms
Starting structural reductions in LTL mode, iteration 1 : 874/896 places, 848/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31922 ms. Remains : 874/896 places, 848/873 transitions.
Stuttering acceptance computed with spot in 620 ms :[(AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p4)), (AND (NOT p0) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p1) (NOT p4)), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p4)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-06
Product exploration explored 100000 steps with 452 reset in 260 ms.
Product exploration explored 100000 steps with 457 reset in 519 ms.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Detected a total of 212/874 stabilizing places and 212/848 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)), (X p2), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p3) p2 (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p4)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p4))))), (X (X (AND (NOT p0) (NOT p1) (NOT p4)))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1) (NOT p4))))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)))), (X (X (AND (NOT p0) p2 (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4))))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p0) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1 (NOT p4))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 32 factoid took 423 ms. Reduced automaton from 11 states, 30 edges and 5 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 27919 steps (48 resets) in 129 ms. (214 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)), (X p2), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p3) p2 (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p4)))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p4))))), (X (X (AND (NOT p0) (NOT p1) (NOT p4)))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1) (NOT p4))))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p1) (NOT p4)))), (X (X (AND (NOT p0) p2 (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4))))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p4)))), (X (X (NOT (AND (NOT p0) p1 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 p1 (NOT p4))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2))), (F p0), (F (NOT (AND (NOT p0) (NOT p3) p2 (NOT p4)))), (F (NOT p2)), (F p4), (F p3), (F (NOT (OR p0 p2 p4))), (F (NOT (AND (NOT p0) p2 (NOT p4))))]
Knowledge based reduction with 32 factoid took 1178 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
[2024-05-31 21:31:58] [INFO ] Invariant cache hit.
[2024-05-31 21:31:59] [INFO ] [Real]Absence check using 75 positive place invariants in 52 ms returned sat
[2024-05-31 21:31:59] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-31 21:32:01] [INFO ] [Real]Absence check using state equation in 1831 ms returned sat
[2024-05-31 21:32:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:02] [INFO ] [Nat]Absence check using 75 positive place invariants in 54 ms returned sat
[2024-05-31 21:32:02] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-31 21:32:03] [INFO ] [Nat]Absence check using state equation in 1746 ms returned sat
[2024-05-31 21:32:03] [INFO ] Computed and/alt/rep : 845/1177/845 causal constraints (skipped 2 transitions) in 76 ms.
Could not prove EG (AND (NOT p0) (NOT p3) (NOT p4))
Support contains 4 out of 874 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Applied a total of 0 rules in 31 ms. Remains 874 /874 variables (removed 0) and now considering 848/848 (removed 0) transitions.
[2024-05-31 21:32:16] [INFO ] Invariant cache hit.
[2024-05-31 21:32:16] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-31 21:32:16] [INFO ] Invariant cache hit.
[2024-05-31 21:32:17] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-31 21:32:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 35 places in 621 ms of which 9 ms to minimize.
[2024-05-31 21:32:47] [INFO ] Deduced a trap composed of 117 places in 601 ms of which 9 ms to minimize.
[2024-05-31 21:32:48] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 9 ms to minimize.
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30239ms
Finished structural reductions in LTL mode , in 1 iterations and 31868 ms. Remains : 874/874 places, 848/848 transitions.
Computed a total of 212 stabilizing places and 212 stable transitions
Computed a total of 212 stabilizing places and 212 stable transitions
Detected a total of 212/874 stabilizing places and 212/848 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p4)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p4)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 156 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (72 resets) in 153 ms. (259 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
[2024-05-31 21:32:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 779/811 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:32:49] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/874 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 848/1722 variables, 874/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1722 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1722 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1722/1722 variables, and 951 constraints, problems are : Problem set: 0 solved, 1 unsolved in 862 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 874/874 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 779/811 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/811 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/811 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/874 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/874 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 848/1722 variables, 874/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1722 variables, 1/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1722 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1722 variables, 0/952 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 952 constraints, problems are : Problem set: 0 solved, 1 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 874/874 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1515ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 249 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p3) p2 (NOT p4)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (AND (NOT p0) (NOT p3) p2 (NOT p4)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p2 (NOT p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) p2))), (F p0), (F (NOT (AND (NOT p0) p2 (NOT p4) (NOT p3)))), (F (NOT p2)), (F p4), (F p3), (F (NOT (OR p0 p2 p4))), (F (NOT (AND (NOT p0) p2 (NOT p4))))]
Knowledge based reduction with 10 factoid took 485 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
[2024-05-31 21:32:51] [INFO ] Invariant cache hit.
[2024-05-31 21:32:51] [INFO ] [Real]Absence check using 75 positive place invariants in 56 ms returned sat
[2024-05-31 21:32:51] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-31 21:32:53] [INFO ] [Real]Absence check using state equation in 1827 ms returned sat
[2024-05-31 21:32:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:54] [INFO ] [Nat]Absence check using 75 positive place invariants in 52 ms returned sat
[2024-05-31 21:32:54] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 9 ms returned sat
[2024-05-31 21:32:56] [INFO ] [Nat]Absence check using state equation in 1702 ms returned sat
[2024-05-31 21:32:56] [INFO ] Computed and/alt/rep : 845/1177/845 causal constraints (skipped 2 transitions) in 70 ms.
Could not prove EG (AND (NOT p0) (NOT p3) (NOT p4))
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 454 reset in 398 ms.
Product exploration explored 100000 steps with 455 reset in 296 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 874 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Performed 275 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 874 transition count 848
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 24 rules applied. Total rules applied 299 place count 874 transition count 836
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 299 place count 874 transition count 836
Deduced a syphon composed of 401 places in 2 ms
Iterating global reduction 2 with 114 rules applied. Total rules applied 413 place count 874 transition count 836
Discarding 235 places :
Symmetric choice reduction at 2 with 235 rule applications. Total rules 648 place count 639 transition count 601
Deduced a syphon composed of 166 places in 2 ms
Iterating global reduction 2 with 235 rules applied. Total rules applied 883 place count 639 transition count 601
Performed 207 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 373 places in 1 ms
Iterating global reduction 2 with 207 rules applied. Total rules applied 1090 place count 639 transition count 578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1091 place count 639 transition count 577
Renaming transitions due to excessive name length > 1024 char.
Discarding 131 places :
Symmetric choice reduction at 3 with 131 rule applications. Total rules 1222 place count 508 transition count 446
Deduced a syphon composed of 242 places in 0 ms
Iterating global reduction 3 with 131 rules applied. Total rules applied 1353 place count 508 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 243 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1354 place count 508 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1355 place count 507 transition count 445
Deduced a syphon composed of 242 places in 1 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 1356 place count 507 transition count 445
Deduced a syphon composed of 242 places in 0 ms
Applied a total of 1356 rules in 269 ms. Remains 507 /874 variables (removed 367) and now considering 445/848 (removed 403) transitions.
[2024-05-31 21:33:10] [INFO ] Redundant transitions in 28 ms returned []
Running 444 sub problems to find dead transitions.
// Phase 1: matrix 445 rows 507 cols
[2024-05-31 21:33:10] [INFO ] Computed 76 invariants in 6 ms
[2024-05-31 21:33:10] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/506 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 1/507 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-31 21:33:24] [INFO ] Deduced a trap composed of 2 places in 252 ms of which 4 ms to minimize.
[2024-05-31 21:33:24] [INFO ] Deduced a trap composed of 2 places in 267 ms of which 4 ms to minimize.
[2024-05-31 21:33:24] [INFO ] Deduced a trap composed of 2 places in 207 ms of which 4 ms to minimize.
[2024-05-31 21:33:25] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 5 ms to minimize.
[2024-05-31 21:33:25] [INFO ] Deduced a trap composed of 2 places in 248 ms of which 4 ms to minimize.
[2024-05-31 21:33:25] [INFO ] Deduced a trap composed of 2 places in 230 ms of which 4 ms to minimize.
[2024-05-31 21:33:26] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 4 ms to minimize.
[2024-05-31 21:33:26] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 4 ms to minimize.
[2024-05-31 21:33:26] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 4 ms to minimize.
[2024-05-31 21:33:26] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-05-31 21:33:26] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 3 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 2 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 2 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 2 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 3 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD421 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 20/96 constraints. Problems are: Problem set: 112 solved, 332 unsolved
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 2 places in 181 ms of which 14 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 20/116 constraints. Problems are: Problem set: 149 solved, 295 unsolved
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-31 21:33:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 3 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 3 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 3 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 20/136 constraints. Problems are: Problem set: 189 solved, 255 unsolved
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 2 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 16/152 constraints. Problems are: Problem set: 242 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/152 constraints. Problems are: Problem set: 242 solved, 202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 445/952 variables, 507/659 constraints. Problems are: Problem set: 242 solved, 202 unsolved
SMT process timed out in 30366ms, After SMT, problems are : Problem set: 242 solved, 202 unsolved
Search for dead transitions found 242 dead transitions in 30372ms
Found 242 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 242 transitions
Dead transitions reduction (with SMT) removed 242 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 507/874 places, 203/848 transitions.
Graph (complete) has 683 edges and 507 vertex of which 265 are kept as prefixes of interest. Removing 242 places using SCC suffix rule.3 ms
Discarding 242 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 265 /507 variables (removed 242) and now considering 203/203 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 265/874 places, 203/848 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30696 ms. Remains : 265/874 places, 203/848 transitions.
Support contains 4 out of 874 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 874/874 places, 848/848 transitions.
Applied a total of 0 rules in 25 ms. Remains 874 /874 variables (removed 0) and now considering 848/848 (removed 0) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-31 21:33:40] [INFO ] Computed 76 invariants in 4 ms
[2024-05-31 21:33:41] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-31 21:33:41] [INFO ] Invariant cache hit.
[2024-05-31 21:33:42] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-31 21:33:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-31 21:34:11] [INFO ] Deduced a trap composed of 35 places in 563 ms of which 8 ms to minimize.
[2024-05-31 21:34:11] [INFO ] Deduced a trap composed of 117 places in 608 ms of which 9 ms to minimize.
[2024-05-31 21:34:12] [INFO ] Deduced a trap composed of 16 places in 604 ms of which 8 ms to minimize.
SMT process timed out in 30151ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30166ms
Finished structural reductions in LTL mode , in 1 iterations and 31602 ms. Remains : 874/874 places, 848/848 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-06 finished in 169365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(p2))))'
Support contains 3 out of 896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 895 transition count 550
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 360 rules applied. Total rules applied 682 place count 573 transition count 512
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 704 place count 551 transition count 512
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 704 place count 551 transition count 407
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 914 place count 446 transition count 407
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 923 place count 437 transition count 398
Iterating global reduction 3 with 9 rules applied. Total rules applied 932 place count 437 transition count 398
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 932 place count 437 transition count 392
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 944 place count 431 transition count 392
Performed 165 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 165 places in 0 ms
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 330 rules applied. Total rules applied 1274 place count 266 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1275 place count 266 transition count 205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1277 place count 265 transition count 205
Applied a total of 1277 rules in 64 ms. Remains 265 /896 variables (removed 631) and now considering 205/873 (removed 668) transitions.
// Phase 1: matrix 205 rows 265 cols
[2024-05-31 21:34:12] [INFO ] Computed 76 invariants in 1 ms
[2024-05-31 21:34:12] [INFO ] Implicit Places using invariants in 289 ms returned [88, 89, 90, 91, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 112, 113, 114, 115, 153, 191, 197, 203, 209, 215, 221, 227, 233, 239, 245, 251, 257, 264]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 292 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 228/896 places, 205/873 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 228 transition count 183
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 206 transition count 183
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 57 place count 193 transition count 170
Iterating global reduction 2 with 13 rules applied. Total rules applied 70 place count 193 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 192 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 192 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 191 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 191 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 190 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 190 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 189 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 189 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 188 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 188 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 187 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 187 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 186 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 186 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 185 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 185 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 184 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 184 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 183 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 183 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 182 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 182 transition count 159
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 181 transition count 158
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 181 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 180 transition count 157
Applied a total of 96 rules in 42 ms. Remains 180 /228 variables (removed 48) and now considering 157/205 (removed 48) transitions.
// Phase 1: matrix 157 rows 180 cols
[2024-05-31 21:34:12] [INFO ] Computed 39 invariants in 1 ms
[2024-05-31 21:34:13] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-31 21:34:13] [INFO ] Invariant cache hit.
[2024-05-31 21:34:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:34:13] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 180/896 places, 157/873 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 851 ms. Remains : 180/896 places, 157/873 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-07
Stuttering criterion allowed to conclude after 66 steps with 2 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-07 finished in 1027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((G(p0)&&(p1 U (p2||G(p1)))) U (G(p4)&&p3))))))'
Support contains 5 out of 896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 882 transition count 859
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 882 transition count 859
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 882 transition count 856
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 877 transition count 851
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 874 transition count 848
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 873 transition count 847
Applied a total of 49 rules in 151 ms. Remains 873 /896 variables (removed 23) and now considering 847/873 (removed 26) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-31 21:34:13] [INFO ] Computed 76 invariants in 3 ms
[2024-05-31 21:34:14] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-31 21:34:14] [INFO ] Invariant cache hit.
[2024-05-31 21:34:15] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1511 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-31 21:34:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-31 21:34:44] [INFO ] Deduced a trap composed of 88 places in 566 ms of which 8 ms to minimize.
[2024-05-31 21:34:45] [INFO ] Deduced a trap composed of 17 places in 604 ms of which 8 ms to minimize.
[2024-05-31 21:34:45] [INFO ] Deduced a trap composed of 35 places in 516 ms of which 8 ms to minimize.
SMT process timed out in 30476ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30486ms
Starting structural reductions in LTL mode, iteration 1 : 873/896 places, 847/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32150 ms. Remains : 873/896 places, 847/873 transitions.
Stuttering acceptance computed with spot in 511 ms :[(OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), true, (NOT p0), (NOT p4), (AND (NOT p2) (NOT p1)), (OR (NOT p4) (NOT p3)), (NOT p4)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-08 finished in 32698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0) U p1))||F(p2)))'
Support contains 3 out of 896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 895 transition count 551
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 361 rules applied. Total rules applied 682 place count 574 transition count 511
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 706 place count 550 transition count 511
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 105 Pre rules applied. Total rules applied 706 place count 550 transition count 406
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 916 place count 445 transition count 406
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 925 place count 436 transition count 397
Iterating global reduction 3 with 9 rules applied. Total rules applied 934 place count 436 transition count 397
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 934 place count 436 transition count 392
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 944 place count 431 transition count 392
Performed 167 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 1278 place count 264 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1279 place count 264 transition count 203
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1280 place count 263 transition count 202
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 34 rules applied. Total rules applied 1314 place count 240 transition count 191
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1325 place count 229 transition count 191
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1325 place count 229 transition count 179
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1349 place count 217 transition count 179
Applied a total of 1349 rules in 64 ms. Remains 217 /896 variables (removed 679) and now considering 179/873 (removed 694) transitions.
// Phase 1: matrix 179 rows 217 cols
[2024-05-31 21:34:46] [INFO ] Computed 53 invariants in 1 ms
[2024-05-31 21:34:46] [INFO ] Implicit Places using invariants in 189 ms returned [90, 128, 166, 170, 174, 179, 183, 187, 191, 195, 199, 203, 207, 211, 216]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 191 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/896 places, 179/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 189 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 189 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 188 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 188 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 187 transition count 164
Applied a total of 30 rules in 12 ms. Remains 187 /202 variables (removed 15) and now considering 164/179 (removed 15) transitions.
// Phase 1: matrix 164 rows 187 cols
[2024-05-31 21:34:46] [INFO ] Computed 38 invariants in 1 ms
[2024-05-31 21:34:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 21:34:46] [INFO ] Invariant cache hit.
[2024-05-31 21:34:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:34:46] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/896 places, 164/873 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 670 ms. Remains : 187/896 places, 164/873 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-09
Stuttering criterion allowed to conclude after 79 steps with 2 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-09 finished in 873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(X(G(p1))))))))'
Support contains 2 out of 896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 882 transition count 859
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 882 transition count 859
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 882 transition count 856
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 878 transition count 852
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 878 transition count 852
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 875 transition count 849
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 875 transition count 849
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 874 transition count 848
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 874 transition count 848
Applied a total of 47 rules in 150 ms. Remains 874 /896 variables (removed 22) and now considering 848/873 (removed 25) transitions.
// Phase 1: matrix 848 rows 874 cols
[2024-05-31 21:34:47] [INFO ] Computed 76 invariants in 4 ms
[2024-05-31 21:34:47] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-31 21:34:47] [INFO ] Invariant cache hit.
[2024-05-31 21:34:48] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1482 ms to find 0 implicit places.
Running 847 sub problems to find dead transitions.
[2024-05-31 21:34:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 1 (OVERLAPS) 1/874 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 847 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/874 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 847 unsolved
[2024-05-31 21:35:17] [INFO ] Deduced a trap composed of 94 places in 625 ms of which 8 ms to minimize.
[2024-05-31 21:35:18] [INFO ] Deduced a trap composed of 18 places in 686 ms of which 8 ms to minimize.
[2024-05-31 21:35:19] [INFO ] Deduced a trap composed of 16 places in 599 ms of which 8 ms to minimize.
SMT process timed out in 30282ms, After SMT, problems are : Problem set: 0 solved, 847 unsolved
Search for dead transitions found 0 dead transitions in 30292ms
Starting structural reductions in LTL mode, iteration 1 : 874/896 places, 848/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31927 ms. Remains : 874/896 places, 848/873 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-10 finished in 32146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 881 transition count 858
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 881 transition count 858
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 881 transition count 855
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 876 transition count 850
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 876 transition count 850
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 873 transition count 847
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 873 transition count 847
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 872 transition count 846
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 872 transition count 846
Applied a total of 51 rules in 154 ms. Remains 872 /896 variables (removed 24) and now considering 846/873 (removed 27) transitions.
// Phase 1: matrix 846 rows 872 cols
[2024-05-31 21:35:19] [INFO ] Computed 76 invariants in 4 ms
[2024-05-31 21:35:19] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-31 21:35:19] [INFO ] Invariant cache hit.
[2024-05-31 21:35:20] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2024-05-31 21:35:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 1 (OVERLAPS) 1/872 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 845 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 845 unsolved
[2024-05-31 21:35:49] [INFO ] Deduced a trap composed of 35 places in 538 ms of which 9 ms to minimize.
[2024-05-31 21:35:49] [INFO ] Deduced a trap composed of 100 places in 476 ms of which 7 ms to minimize.
[2024-05-31 21:35:50] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 6 ms to minimize.
[2024-05-31 21:35:50] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 5 ms to minimize.
[2024-05-31 21:35:51] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 5 ms to minimize.
SMT process timed out in 30286ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30295ms
Starting structural reductions in LTL mode, iteration 1 : 872/896 places, 846/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31855 ms. Remains : 872/896 places, 846/873 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-11 finished in 32022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 895 transition count 550
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 362 rules applied. Total rules applied 684 place count 573 transition count 510
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 708 place count 549 transition count 510
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 708 place count 549 transition count 406
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 916 place count 445 transition count 406
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 925 place count 436 transition count 397
Iterating global reduction 3 with 9 rules applied. Total rules applied 934 place count 436 transition count 397
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 934 place count 436 transition count 392
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 944 place count 431 transition count 392
Performed 168 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 1280 place count 263 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1281 place count 263 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1282 place count 262 transition count 201
Reduce places removed 22 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 32 rules applied. Total rules applied 1314 place count 240 transition count 191
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1324 place count 230 transition count 191
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 1324 place count 230 transition count 180
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1346 place count 219 transition count 180
Applied a total of 1346 rules in 82 ms. Remains 219 /896 variables (removed 677) and now considering 180/873 (removed 693) transitions.
// Phase 1: matrix 180 rows 219 cols
[2024-05-31 21:35:51] [INFO ] Computed 54 invariants in 1 ms
[2024-05-31 21:35:51] [INFO ] Implicit Places using invariants in 300 ms returned [90, 128, 166, 170, 174, 179, 183, 187, 191, 195, 199, 203, 209, 213, 218]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 302 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/896 places, 180/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 191 transition count 167
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 191 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 190 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 190 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 189 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 189 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 188 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 188 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 187 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 187 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 186 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 184 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 183 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 183 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 182 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 182 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 181 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 181 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 180 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 179 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 179 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 178 transition count 154
Applied a total of 52 rules in 38 ms. Remains 178 /204 variables (removed 26) and now considering 154/180 (removed 26) transitions.
// Phase 1: matrix 154 rows 178 cols
[2024-05-31 21:35:51] [INFO ] Computed 39 invariants in 1 ms
[2024-05-31 21:35:51] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-31 21:35:51] [INFO ] Invariant cache hit.
[2024-05-31 21:35:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:35:52] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 178/896 places, 154/873 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 852 ms. Remains : 178/896 places, 154/873 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-12
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-12 finished in 901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !p1)))'
Support contains 4 out of 896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 895 transition count 550
Reduce places removed 322 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 363 rules applied. Total rules applied 685 place count 573 transition count 509
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 710 place count 549 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 711 place count 548 transition count 508
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 711 place count 548 transition count 406
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 915 place count 446 transition count 406
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 924 place count 437 transition count 397
Iterating global reduction 4 with 9 rules applied. Total rules applied 933 place count 437 transition count 397
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 933 place count 437 transition count 391
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 945 place count 431 transition count 391
Performed 167 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 167 places in 1 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 4 with 334 rules applied. Total rules applied 1279 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1280 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 33 rules applied. Total rules applied 1313 place count 240 transition count 191
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1323 place count 230 transition count 191
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1323 place count 230 transition count 179
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1347 place count 218 transition count 179
Applied a total of 1347 rules in 64 ms. Remains 218 /896 variables (removed 678) and now considering 179/873 (removed 694) transitions.
// Phase 1: matrix 179 rows 218 cols
[2024-05-31 21:35:52] [INFO ] Computed 53 invariants in 0 ms
[2024-05-31 21:35:52] [INFO ] Implicit Places using invariants in 231 ms returned [88, 126, 164, 168, 172, 177, 181, 185, 189, 195, 200, 204, 208, 212, 217]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 233 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/896 places, 179/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 190 transition count 166
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 190 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 189 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 189 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 188 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 188 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 187 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 187 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 186 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 184 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 183 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 183 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 182 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 182 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 177 transition count 153
Applied a total of 52 rules in 40 ms. Remains 177 /203 variables (removed 26) and now considering 153/179 (removed 26) transitions.
// Phase 1: matrix 153 rows 177 cols
[2024-05-31 21:35:52] [INFO ] Computed 38 invariants in 1 ms
[2024-05-31 21:35:52] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 21:35:52] [INFO ] Invariant cache hit.
[2024-05-31 21:35:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:35:52] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 177/896 places, 153/873 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 800 ms. Remains : 177/896 places, 153/873 transitions.
Stuttering acceptance computed with spot in 83 ms :[p1, true, p1]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-13
Product exploration explored 100000 steps with 2242 reset in 461 ms.
Product exploration explored 100000 steps with 2250 reset in 635 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 187 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[p1, true, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (913 resets) in 649 ms. (61 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 233 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
[2024-05-31 21:35:54] [INFO ] Invariant cache hit.
[2024-05-31 21:35:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 91/95 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/202 variables, 95/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 128/330 variables, 82/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 35/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 216 constraints, problems are : Problem set: 1 solved, 2 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 177/177 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/95 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/202 variables, 95/98 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 2/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 128/330 variables, 82/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 35/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/330 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 218 constraints, problems are : Problem set: 1 solved, 2 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 177/177 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 11 factoid took 218 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-12b-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-12b-LTLFireability-13 finished in 3335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 896 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 323 place count 895 transition count 549
Reduce places removed 323 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 363 rules applied. Total rules applied 686 place count 572 transition count 509
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 710 place count 548 transition count 509
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 710 place count 548 transition count 405
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 918 place count 444 transition count 405
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 927 place count 435 transition count 396
Iterating global reduction 3 with 9 rules applied. Total rules applied 936 place count 435 transition count 396
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 936 place count 435 transition count 391
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 946 place count 430 transition count 391
Performed 168 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 168 places in 0 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 1282 place count 262 transition count 201
Renaming transitions due to excessive name length > 1024 char.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1283 place count 262 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1284 place count 261 transition count 200
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 34 rules applied. Total rules applied 1318 place count 238 transition count 189
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1329 place count 227 transition count 189
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 1329 place count 227 transition count 177
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 1353 place count 215 transition count 177
Applied a total of 1353 rules in 59 ms. Remains 215 /896 variables (removed 681) and now considering 177/873 (removed 696) transitions.
// Phase 1: matrix 177 rows 215 cols
[2024-05-31 21:35:55] [INFO ] Computed 53 invariants in 0 ms
[2024-05-31 21:35:55] [INFO ] Implicit Places using invariants in 230 ms returned [88, 126, 164, 168, 172, 177, 181, 185, 189, 193, 197, 201, 205, 209, 214]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 232 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/896 places, 177/873 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 187 transition count 164
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 187 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 186 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 186 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 184 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 184 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 183 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 183 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 182 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 182 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 181 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 181 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 179 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 179 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 178 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 178 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 177 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 177 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 176 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 176 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 175 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 175 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 174 transition count 151
Applied a total of 52 rules in 30 ms. Remains 174 /200 variables (removed 26) and now considering 151/177 (removed 26) transitions.
// Phase 1: matrix 151 rows 174 cols
[2024-05-31 21:35:55] [INFO ] Computed 38 invariants in 1 ms
[2024-05-31 21:35:56] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-31 21:35:56] [INFO ] Invariant cache hit.
[2024-05-31 21:35:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:35:56] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 174/896 places, 151/873 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 795 ms. Remains : 174/896 places, 151/873 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-14
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-12b-LTLFireability-14 finished in 843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Support contains 2 out of 896 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 882 transition count 859
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 882 transition count 859
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 882 transition count 856
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 877 transition count 851
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 877 transition count 851
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 874 transition count 848
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 874 transition count 848
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 873 transition count 847
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 873 transition count 847
Applied a total of 49 rules in 152 ms. Remains 873 /896 variables (removed 23) and now considering 847/873 (removed 26) transitions.
// Phase 1: matrix 847 rows 873 cols
[2024-05-31 21:35:56] [INFO ] Computed 76 invariants in 3 ms
[2024-05-31 21:35:56] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-31 21:35:56] [INFO ] Invariant cache hit.
[2024-05-31 21:35:57] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1400 ms to find 0 implicit places.
Running 846 sub problems to find dead transitions.
[2024-05-31 21:35:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/872 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 1 (OVERLAPS) 1/873 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 846 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 846 unsolved
[2024-05-31 21:36:27] [INFO ] Deduced a trap composed of 35 places in 623 ms of which 8 ms to minimize.
[2024-05-31 21:36:27] [INFO ] Deduced a trap composed of 111 places in 616 ms of which 9 ms to minimize.
[2024-05-31 21:36:28] [INFO ] Deduced a trap composed of 17 places in 600 ms of which 8 ms to minimize.
SMT process timed out in 30510ms, After SMT, problems are : Problem set: 0 solved, 846 unsolved
Search for dead transitions found 0 dead transitions in 30519ms
Starting structural reductions in LTL mode, iteration 1 : 873/896 places, 847/873 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32074 ms. Remains : 873/896 places, 847/873 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-15
Product exploration explored 100000 steps with 764 reset in 242 ms.
Product exploration explored 100000 steps with 737 reset in 275 ms.
Computed a total of 211 stabilizing places and 211 stable transitions
Computed a total of 211 stabilizing places and 211 stable transitions
Detected a total of 211/873 stabilizing places and 211/847 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 253 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (72 resets) in 114 ms. (347 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2024-05-31 21:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 245/247 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 563/810 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/873 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 37 places in 311 ms of which 6 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 5 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 6 ms to minimize.
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 5 ms to minimize.
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 4 ms to minimize.
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 62 places in 275 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/873 variables, 6/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/873 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 847/1720 variables, 873/957 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1720 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1720/1720 variables, and 957 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2813 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 245/247 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/247 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 563/810 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/810 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 2 ms to minimize.
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/873 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/873 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 847/1720 variables, 873/959 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1720 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1720 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1720 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 960 constraints, problems are : Problem set: 0 solved, 1 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 873/873 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3625ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 343 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=114 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 501 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 873 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 873/873 places, 847/847 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 310 transitions
Trivial Post-agglo rules discarded 310 transitions
Performed 310 trivial Post agglomeration. Transition count delta: 310
Iterating post reduction 0 with 310 rules applied. Total rules applied 310 place count 872 transition count 536
Reduce places removed 310 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 346 rules applied. Total rules applied 656 place count 562 transition count 500
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 681 place count 538 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 682 place count 537 transition count 499
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 682 place count 537 transition count 395
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 890 place count 433 transition count 395
Performed 170 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 4 with 340 rules applied. Total rules applied 1230 place count 263 transition count 201
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1231 place count 262 transition count 200
Reduce places removed 24 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 36 rules applied. Total rules applied 1267 place count 238 transition count 188
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1279 place count 226 transition count 188
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1279 place count 226 transition count 176
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1303 place count 214 transition count 176
Applied a total of 1303 rules in 36 ms. Remains 214 /873 variables (removed 659) and now considering 176/847 (removed 671) transitions.
// Phase 1: matrix 176 rows 214 cols
[2024-05-31 21:36:33] [INFO ] Computed 52 invariants in 1 ms
[2024-05-31 21:36:34] [INFO ] Implicit Places using invariants in 235 ms returned [86, 124, 162, 166, 170, 174, 178, 182, 186, 196, 200, 204, 208, 213]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 236 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/873 places, 176/847 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 188 transition count 164
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 188 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 187 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 187 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 186 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 186 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 185 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 185 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 184 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 184 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 183 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 183 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 182 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 182 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 181 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 181 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 180 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 180 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 179 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 179 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 178 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 178 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 177 transition count 153
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 177 transition count 153
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 176 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 176 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 174 transition count 150
Applied a total of 52 rules in 25 ms. Remains 174 /200 variables (removed 26) and now considering 150/176 (removed 26) transitions.
// Phase 1: matrix 150 rows 174 cols
[2024-05-31 21:36:34] [INFO ] Computed 38 invariants in 3 ms
[2024-05-31 21:36:34] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 21:36:34] [INFO ] Invariant cache hit.
[2024-05-31 21:36:34] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 21:36:34] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 174/873 places, 150/847 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 775 ms. Remains : 174/873 places, 150/847 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/174 stabilizing places and 4/150 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 598 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 235 steps (3 resets) in 5 ms. (39 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 726 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 3874 reset in 303 ms.
Product exploration explored 100000 steps with 3853 reset in 340 ms.
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 150/150 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 150/150 (removed 0) transitions.
[2024-05-31 21:36:37] [INFO ] Invariant cache hit.
[2024-05-31 21:36:37] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-31 21:36:37] [INFO ] Invariant cache hit.
[2024-05-31 21:36:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 21:36:37] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-31 21:36:37] [INFO ] Redundant transitions in 2 ms returned []
Running 100 sub problems to find dead transitions.
[2024-05-31 21:36:37] [INFO ] Invariant cache hit.
[2024-05-31 21:36:37] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 2/174 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-31 21:36:38] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 150/324 variables, 174/213 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 223 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4486 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 174/174 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 2/174 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 150/324 variables, 174/213 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 10/223 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 100/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 0/324 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 323 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5206 ms.
Refiners :[Positive P Invariants (semi-flows): 38/38 constraints, State Equation: 174/174 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 1/1 constraints]
After SMT, in 9711ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 9712ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10210 ms. Remains : 174/174 places, 150/150 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-15 finished in 51004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1) U (G(p2) U (p3||X(p4)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Found a Lengthening insensitive property : AutoFlight-PT-12b-LTLFireability-15
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 896 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 896/896 places, 873/873 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 895 transition count 551
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 1 with 362 rules applied. Total rules applied 683 place count 574 transition count 510
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 708 place count 550 transition count 509
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 709 place count 549 transition count 509
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 709 place count 549 transition count 404
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 919 place count 444 transition count 404
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 928 place count 435 transition count 395
Iterating global reduction 4 with 9 rules applied. Total rules applied 937 place count 435 transition count 395
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 937 place count 435 transition count 390
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 947 place count 430 transition count 390
Performed 166 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 166 places in 0 ms
Reduce places removed 166 places and 0 transitions.
Iterating global reduction 4 with 332 rules applied. Total rules applied 1279 place count 264 transition count 202
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1280 place count 263 transition count 201
Reduce places removed 23 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 4 with 34 rules applied. Total rules applied 1314 place count 240 transition count 190
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1325 place count 229 transition count 190
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1325 place count 229 transition count 178
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1349 place count 217 transition count 178
Applied a total of 1349 rules in 53 ms. Remains 217 /896 variables (removed 679) and now considering 178/873 (removed 695) transitions.
// Phase 1: matrix 178 rows 217 cols
[2024-05-31 21:36:47] [INFO ] Computed 53 invariants in 1 ms
[2024-05-31 21:36:48] [INFO ] Implicit Places using invariants in 225 ms returned [88, 126, 164, 168, 172, 177, 181, 185, 189, 199, 203, 207, 211, 216]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 240 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 203/896 places, 178/873 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 191 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 191 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 190 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 190 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 189 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 189 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 188 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 188 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 187 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 187 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 186 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 186 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 185 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 185 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 184 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 184 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 183 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 183 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 182 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 182 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 177 transition count 152
Applied a total of 52 rules in 26 ms. Remains 177 /203 variables (removed 26) and now considering 152/178 (removed 26) transitions.
// Phase 1: matrix 152 rows 177 cols
[2024-05-31 21:36:48] [INFO ] Computed 39 invariants in 1 ms
[2024-05-31 21:36:48] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-31 21:36:48] [INFO ] Invariant cache hit.
[2024-05-31 21:36:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 21:36:48] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 177/896 places, 152/873 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 828 ms. Remains : 177/896 places, 152/873 transitions.
Running random walk in product with property : AutoFlight-PT-12b-LTLFireability-15
Product exploration explored 100000 steps with 3787 reset in 297 ms.
Product exploration explored 100000 steps with 3847 reset in 332 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/177 stabilizing places and 5/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 531 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 157 steps (2 resets) in 5 ms. (26 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 679 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 152/152 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-31 21:36:50] [INFO ] Invariant cache hit.
[2024-05-31 21:36:50] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-31 21:36:50] [INFO ] Invariant cache hit.
[2024-05-31 21:36:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 21:36:51] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-31 21:36:51] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-31 21:36:51] [INFO ] Invariant cache hit.
[2024-05-31 21:36:51] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/177 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-31 21:36:52] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 152/329 variables, 177/217 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 11/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 228 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4549 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 177/177 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 2/177 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 152/329 variables, 177/217 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 11/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 102/330 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 330 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6914 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 177/177 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints]
After SMT, in 11477ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11478ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11995 ms. Remains : 177/177 places, 152/152 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Computed a total of 6 stabilizing places and 5 stable transitions
Detected a total of 6/177 stabilizing places and 5/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 606 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
RANDOM walk for 94 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 723 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 3763 reset in 298 ms.
Product exploration explored 100000 steps with 3788 reset in 330 ms.
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 152/152 transitions.
Applied a total of 0 rules in 3 ms. Remains 177 /177 variables (removed 0) and now considering 152/152 (removed 0) transitions.
[2024-05-31 21:37:05] [INFO ] Invariant cache hit.
[2024-05-31 21:37:05] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 21:37:05] [INFO ] Invariant cache hit.
[2024-05-31 21:37:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-31 21:37:05] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2024-05-31 21:37:05] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-31 21:37:05] [INFO ] Invariant cache hit.
[2024-05-31 21:37:05] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 2/177 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-31 21:37:06] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 152/329 variables, 177/217 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 11/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/329 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 228 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4521 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 177/177 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/175 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 2/177 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 152/329 variables, 177/217 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 11/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 102/330 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 330 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6506 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 177/177 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 1/1 constraints]
After SMT, in 11046ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11047ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11587 ms. Remains : 177/177 places, 152/152 transitions.
Treatment of property AutoFlight-PT-12b-LTLFireability-15 finished in 29300 ms.
[2024-05-31 21:37:16] [INFO ] Flatten gal took : 68 ms
[2024-05-31 21:37:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-31 21:37:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 896 places, 873 transitions and 2116 arcs took 16 ms.
Total runtime 499543 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : AutoFlight-PT-12b-LTLFireability-06
FORMULA AutoFlight-PT-12b-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717193459261
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-12b-LTLFireability-06
ltl formula formula --ltl=/tmp/2295/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 896 places, 873 transitions and 2116 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2295/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2295/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2295/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.030 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2295/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 898 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 897, there are 1216 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~540 levels ~10000 states ~34812 transitions
pnml2lts-mc( 2/ 4): ~540 levels ~20000 states ~57668 transitions
pnml2lts-mc( 2/ 4): ~540 levels ~40000 states ~108364 transitions
pnml2lts-mc( 2/ 4): ~540 levels ~80000 states ~218864 transitions
pnml2lts-mc( 2/ 4): ~540 levels ~160000 states ~464120 transitions
pnml2lts-mc( 0/ 4): ~535 levels ~320000 states ~1079392 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~640000 states ~2109420 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~1280000 states ~4342128 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~2560000 states ~9541436 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~5120000 states ~19420504 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~10240000 states ~40547572 transitions
pnml2lts-mc( 1/ 4): ~541 levels ~20480000 states ~85617508 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 21851802
pnml2lts-mc( 0/ 4): unique states count: 21853878
pnml2lts-mc( 0/ 4): unique transitions count: 88776847
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 66902229
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 21853895
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2160
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21853895 states 88776878 transitions, fanout: 4.062
pnml2lts-mc( 0/ 4): Total exploration time 776.710 sec (776.710 sec minimum, 776.710 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28136, Transitions per second: 114299
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 230.9MB, 11.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 65.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 885 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 230.9MB (~256.0MB paged-in)
ltl formula name AutoFlight-PT-12b-LTLFireability-15
ltl formula formula --ltl=/tmp/2295/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 896 places, 873 transitions and 2116 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2295/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2295/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2295/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2295/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 897 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 897, there are 889 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~567 levels ~10000 states ~50024 transitions
pnml2lts-mc( 1/ 4): ~567 levels ~20000 states ~90928 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~40000 states ~169388 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~80000 states ~382488 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~160000 states ~786960 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~320000 states ~1732588 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~640000 states ~3682460 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~1280000 states ~7848300 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~2560000 states ~16388536 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~5120000 states ~33574264 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~10240000 states ~72112588 transitions
pnml2lts-mc( 1/ 4): ~568 levels ~20480000 states ~154394516 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33528566
pnml2lts-mc( 0/ 4): unique states count: 33530633
pnml2lts-mc( 0/ 4): unique transitions count: 254728505
pnml2lts-mc( 0/ 4): - self-loop count: 24
pnml2lts-mc( 0/ 4): - claim dead count: 221174051
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33530650
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2192
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33530650 states 254728539 transitions, fanout: 7.597
pnml2lts-mc( 0/ 4): Total exploration time 1243.650 sec (1243.640 sec minimum, 1243.645 sec on average)
pnml2lts-mc( 0/ 4): States per second: 26961, Transitions per second: 204823
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.7MB, 8.2 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/8.0%
pnml2lts-mc( 0/ 4): Stored 885 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.7MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-12b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-12b, 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 r468-smll-171620167100164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 ;