About the Execution of LTSMin+red for MedleyA-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1103.191 | 443486.00 | 967362.00 | 1102.50 | FFTTFFTTFFFFFTFT | 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.r579-smll-171734921200068.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 MedleyA-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-09-LTLFireability-00
FORMULA_NAME MedleyA-PT-09-LTLFireability-01
FORMULA_NAME MedleyA-PT-09-LTLFireability-02
FORMULA_NAME MedleyA-PT-09-LTLFireability-03
FORMULA_NAME MedleyA-PT-09-LTLFireability-04
FORMULA_NAME MedleyA-PT-09-LTLFireability-05
FORMULA_NAME MedleyA-PT-09-LTLFireability-06
FORMULA_NAME MedleyA-PT-09-LTLFireability-07
FORMULA_NAME MedleyA-PT-09-LTLFireability-08
FORMULA_NAME MedleyA-PT-09-LTLFireability-09
FORMULA_NAME MedleyA-PT-09-LTLFireability-10
FORMULA_NAME MedleyA-PT-09-LTLFireability-11
FORMULA_NAME MedleyA-PT-09-LTLFireability-12
FORMULA_NAME MedleyA-PT-09-LTLFireability-13
FORMULA_NAME MedleyA-PT-09-LTLFireability-14
FORMULA_NAME MedleyA-PT-09-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717355040366
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:04:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:04:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:04:02] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-06-02 19:04:02] [INFO ] Transformed 147 places.
[2024-06-02 19:04:02] [INFO ] Transformed 315 transitions.
[2024-06-02 19:04:02] [INFO ] Found NUPN structural information;
[2024-06-02 19:04:02] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 113 transition count 279
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 113 transition count 279
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 112 transition count 277
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 112 transition count 277
Applied a total of 64 rules in 68 ms. Remains 112 /145 variables (removed 33) and now considering 277/313 (removed 36) transitions.
// Phase 1: matrix 277 rows 112 cols
[2024-06-02 19:04:02] [INFO ] Computed 10 invariants in 28 ms
[2024-06-02 19:04:03] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-06-02 19:04:03] [INFO ] Invariant cache hit.
[2024-06-02 19:04:03] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-06-02 19:04:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/112 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 212 unsolved
[2024-06-02 19:04:06] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 18 ms to minimize.
[2024-06-02 19:04:06] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 3 ms to minimize.
[2024-06-02 19:04:07] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/13 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 277/389 variables, 112/125 constraints. Problems are: Problem set: 64 solved, 212 unsolved
[2024-06-02 19:04:09] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:04:10] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-02 19:04:10] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-06-02 19:04:10] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 4/129 constraints. Problems are: Problem set: 64 solved, 212 unsolved
[2024-06-02 19:04:12] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 1/130 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/130 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/389 variables, 0/130 constraints. Problems are: Problem set: 64 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 130 constraints, problems are : Problem set: 64 solved, 212 unsolved in 13811 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 64 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 8/18 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/18 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 277/389 variables, 112/130 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 212/342 constraints. Problems are: Problem set: 64 solved, 212 unsolved
[2024-06-02 19:04:22] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:04:23] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 5/347 constraints. Problems are: Problem set: 64 solved, 212 unsolved
[2024-06-02 19:04:28] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 1/348 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/348 constraints. Problems are: Problem set: 64 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 0/389 variables, 0/348 constraints. Problems are: Problem set: 64 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 348 constraints, problems are : Problem set: 64 solved, 212 unsolved in 25969 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 212/276 constraints, Known Traps: 14/14 constraints]
After SMT, in 40641ms problems are : Problem set: 64 solved, 212 unsolved
Search for dead transitions found 64 dead transitions in 40690ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 112/145 places, 213/313 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41361 ms. Remains : 112/145 places, 213/313 transitions.
Support contains 34 out of 112 places after structural reductions.
[2024-06-02 19:04:44] [INFO ] Flatten gal took : 68 ms
[2024-06-02 19:04:44] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:04:44] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 31 out of 112 places (down from 34) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 27 to 26
RANDOM walk for 40000 steps (1328 resets) in 1960 ms. (20 steps per ms) remains 15/26 properties
BEST_FIRST walk for 4003 steps (25 resets) in 86 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (29 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (26 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (29 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (29 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (24 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (26 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (25 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (27 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (25 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
// Phase 1: matrix 213 rows 112 cols
[2024-06-02 19:04:45] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/61 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 3 (OVERLAPS) 32/93 variables, 5/9 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 200/293 variables, 93/102 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/102 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 17/310 variables, 11/113 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/114 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/114 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 11/321 variables, 6/120 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/321 variables, 0/120 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 4/325 variables, 2/122 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 0/122 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/325 variables, 0/122 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 122 constraints, problems are : Problem set: 6 solved, 9 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 9 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 42/61 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 8 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 3 (OVERLAPS) 32/93 variables, 5/9 constraints. Problems are: Problem set: 8 solved, 7 unsolved
[2024-06-02 19:04:46] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/10 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 200/293 variables, 93/103 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 4/107 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/107 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 17/310 variables, 11/118 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 1/119 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 3/122 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 0/122 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 11/321 variables, 6/128 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/128 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 4/325 variables, 2/130 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 0/130 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/325 variables, 0/130 constraints. Problems are: Problem set: 8 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 130 constraints, problems are : Problem set: 8 solved, 7 unsolved in 1084 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 7/15 constraints, Known Traps: 1/1 constraints]
After SMT, in 1717ms problems are : Problem set: 8 solved, 7 unsolved
Parikh walk visited 5 properties in 5200 ms.
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 213/213 transitions.
Graph (complete) has 383 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 110 transition count 192
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 92 transition count 188
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 90 transition count 186
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 46 place count 90 transition count 179
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 60 place count 83 transition count 179
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 78 transition count 172
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 78 transition count 172
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 117 place count 54 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 54 transition count 146
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 131 place count 48 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 151 place count 48 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 155 place count 46 transition count 172
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 46 transition count 168
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 163 place count 42 transition count 168
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 42 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 167 place count 40 transition count 166
Applied a total of 167 rules in 104 ms. Remains 40 /112 variables (removed 72) and now considering 166/213 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 40/112 places, 166/213 transitions.
RANDOM walk for 33722 steps (5924 resets) in 373 ms. (90 steps per ms) remains 0/2 properties
FORMULA MedleyA-PT-09-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 15 stable transitions
Graph (complete) has 383 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
FORMULA MedleyA-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)&&F(p1)))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 213/213 transitions.
Graph (complete) has 383 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 109 transition count 193
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 92 transition count 189
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 90 transition count 187
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 43 place count 90 transition count 179
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 59 place count 82 transition count 179
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 64 place count 77 transition count 172
Iterating global reduction 3 with 5 rules applied. Total rules applied 69 place count 77 transition count 172
Performed 25 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 121 place count 50 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 50 transition count 143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 135 place count 44 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 147 place count 44 transition count 155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 151 place count 42 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 41 transition count 176
Applied a total of 152 rules in 63 ms. Remains 41 /112 variables (removed 71) and now considering 176/213 (removed 37) transitions.
// Phase 1: matrix 176 rows 41 cols
[2024-06-02 19:04:52] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:04:53] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:04:53] [INFO ] Invariant cache hit.
[2024-06-02 19:04:53] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:04:53] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-06-02 19:04:53] [INFO ] Redundant transitions in 7 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-02 19:04:53] [INFO ] Invariant cache hit.
[2024-06-02 19:04:53] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 176/217 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 94/143 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/217 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 143 constraints, problems are : Problem set: 0 solved, 172 unsolved in 4245 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 176/217 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 94/143 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 172/315 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 315 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6971 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 41/41 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
After SMT, in 11499ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 11508ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/112 places, 176/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11802 ms. Remains : 41/112 places, 176/213 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-00 finished in 12181 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' '!((((!(p0 U p1)||G(F(p0))) U p1)||G(F(X(p2)))))'
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 213/213 transitions.
Graph (complete) has 383 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 109 transition count 196
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 95 transition count 193
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 94 transition count 190
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 39 place count 92 transition count 189
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 39 place count 92 transition count 181
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 55 place count 84 transition count 181
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 61 place count 78 transition count 173
Iterating global reduction 4 with 6 rules applied. Total rules applied 67 place count 78 transition count 173
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 111 place count 55 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 113 place count 55 transition count 148
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 125 place count 49 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 133 place count 49 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 137 place count 47 transition count 185
Applied a total of 137 rules in 40 ms. Remains 47 /112 variables (removed 65) and now considering 185/213 (removed 28) transitions.
// Phase 1: matrix 185 rows 47 cols
[2024-06-02 19:05:05] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:05:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:05:05] [INFO ] Invariant cache hit.
[2024-06-02 19:05:05] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 19:05:05] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 19:05:05] [INFO ] Redundant transitions in 8 ms returned []
Running 182 sub problems to find dead transitions.
[2024-06-02 19:05:05] [INFO ] Invariant cache hit.
[2024-06-02 19:05:05] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:05:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 19 ms to minimize.
[2024-06-02 19:05:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 185/231 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 65/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 1/232 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:05:09] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 123 constraints, problems are : Problem set: 0 solved, 182 unsolved in 6314 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 185/231 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 65/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 182/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 1/232 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:05:18] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:05:23] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/232 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (OVERLAPS) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 307 constraints, problems are : Problem set: 0 solved, 182 unsolved in 18803 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 5/5 constraints]
After SMT, in 25492ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 25495ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/112 places, 185/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25765 ms. Remains : 47/112 places, 185/213 transitions.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-03
Product exploration explored 100000 steps with 19195 reset in 555 ms.
Product exploration explored 100000 steps with 19089 reset in 371 ms.
Computed a total of 7 stabilizing places and 55 stable transitions
Computed a total of 7 stabilizing places and 55 stable transitions
Detected a total of 7/47 stabilizing places and 55/185 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 14 factoid took 595 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter insensitive) to 7 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (3466 resets) in 429 ms. (93 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (887 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (870 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (758 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
[2024-06-02 19:05:33] [INFO ] Invariant cache hit.
[2024-06-02 19:05:33] [INFO ] State equation strengthened by 65 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/38 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 185/226 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 65/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/232 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/232 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 120 constraints, problems are : Problem set: 0 solved, 3 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 7/38 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 185/226 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 65/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/232 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/232 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 123 constraints, problems are : Problem set: 0 solved, 3 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 462ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 20 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR p2 (NOT p1)))), (F p0), (F (NOT (OR p2 p1 (NOT p0))))]
Knowledge based reduction with 14 factoid took 951 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter insensitive) to 7 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-06-02 19:05:35] [INFO ] Invariant cache hit.
[2024-06-02 19:05:35] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:05:35] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 19:05:35] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 19:05:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:05:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 19:05:35] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 19:05:35] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-06-02 19:05:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 19:05:35] [INFO ] [Nat]Added 65 Read/Feed constraints in 15 ms returned sat
[2024-06-02 19:05:35] [INFO ] Computed and/alt/rep : 34/151/34 causal constraints (skipped 148 transitions) in 25 ms.
[2024-06-02 19:05:35] [INFO ] Added : 2 causal constraints over 1 iterations in 64 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 185/185 transitions.
Applied a total of 0 rules in 6 ms. Remains 47 /47 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-06-02 19:05:35] [INFO ] Invariant cache hit.
[2024-06-02 19:05:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 19:05:35] [INFO ] Invariant cache hit.
[2024-06-02 19:05:35] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 19:05:35] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-02 19:05:35] [INFO ] Redundant transitions in 2 ms returned []
Running 182 sub problems to find dead transitions.
[2024-06-02 19:05:35] [INFO ] Invariant cache hit.
[2024-06-02 19:05:35] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:05:37] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-02 19:05:37] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 185/231 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 65/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 1/232 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:05:39] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 123 constraints, problems are : Problem set: 0 solved, 182 unsolved in 5949 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 185/231 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 65/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 182/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 1/232 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:05:48] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:05:52] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/232 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (OVERLAPS) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 307 constraints, problems are : Problem set: 0 solved, 182 unsolved in 18213 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 5/5 constraints]
After SMT, in 24573ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 24578ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24809 ms. Remains : 47/47 places, 185/185 transitions.
Computed a total of 7 stabilizing places and 55 stable transitions
Computed a total of 7 stabilizing places and 55 stable transitions
Detected a total of 7/47 stabilizing places and 55/185 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
Knowledge based reduction with 14 factoid took 585 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter insensitive) to 7 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 39531 steps (3421 resets) in 272 ms. (144 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p2 (NOT p1) p0))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR p2 (NOT p1)))), (F p0), (F (NOT (OR p2 p1 (NOT p0))))]
Knowledge based reduction with 14 factoid took 960 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter insensitive) to 7 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
[2024-06-02 19:06:03] [INFO ] Invariant cache hit.
[2024-06-02 19:06:03] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:06:03] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 19:06:03] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-02 19:06:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 19:06:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 19:06:03] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 19:06:03] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-02 19:06:03] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 19:06:03] [INFO ] [Nat]Added 65 Read/Feed constraints in 12 ms returned sat
[2024-06-02 19:06:03] [INFO ] Computed and/alt/rep : 34/151/34 causal constraints (skipped 148 transitions) in 22 ms.
[2024-06-02 19:06:03] [INFO ] Added : 2 causal constraints over 1 iterations in 50 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 19096 reset in 254 ms.
Product exploration explored 100000 steps with 19202 reset in 269 ms.
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 185/185 transitions.
Applied a total of 0 rules in 7 ms. Remains 47 /47 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-06-02 19:06:04] [INFO ] Invariant cache hit.
[2024-06-02 19:06:04] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 19:06:04] [INFO ] Invariant cache hit.
[2024-06-02 19:06:04] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-02 19:06:04] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-06-02 19:06:04] [INFO ] Redundant transitions in 2 ms returned []
Running 182 sub problems to find dead transitions.
[2024-06-02 19:06:04] [INFO ] Invariant cache hit.
[2024-06-02 19:06:04] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:06:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:06:05] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 185/231 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 65/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 1/232 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:06:08] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/232 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 123 constraints, problems are : Problem set: 0 solved, 182 unsolved in 6340 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 185/231 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 65/121 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 182/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 1/232 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:06:17] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:06:22] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/232 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (OVERLAPS) 0/232 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 307 constraints, problems are : Problem set: 0 solved, 182 unsolved in 18625 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 5/5 constraints]
After SMT, in 25270ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 25274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25492 ms. Remains : 47/47 places, 185/185 transitions.
Treatment of property MedleyA-PT-09-LTLFireability-03 finished in 84965 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((X(p1)&&(F(p3)||p2)))))'
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 213/213 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 106 transition count 207
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 106 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 105 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 105 transition count 205
Applied a total of 14 rules in 10 ms. Remains 105 /112 variables (removed 7) and now considering 205/213 (removed 8) transitions.
// Phase 1: matrix 205 rows 105 cols
[2024-06-02 19:06:30] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:06:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 19:06:30] [INFO ] Invariant cache hit.
[2024-06-02 19:06:30] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-06-02 19:06:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:06:31] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:06:31] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:06:32] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:06:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:06:32] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
[2024-06-02 19:06:32] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:06:34] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:06:34] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:06:34] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:06:34] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 125 constraints, problems are : Problem set: 0 solved, 204 unsolved in 8167 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:06:42] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:06:46] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:06:46] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/310 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 332 constraints, problems are : Problem set: 0 solved, 204 unsolved in 19177 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 13/13 constraints]
After SMT, in 27511ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 27514ms
Starting structural reductions in LTL mode, iteration 1 : 105/112 places, 205/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27746 ms. Remains : 105/112 places, 205/213 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p3), true]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-04
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-04 finished in 27998 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(F(p0))))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 213/213 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 206
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 104 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 104 transition count 204
Applied a total of 16 rules in 12 ms. Remains 104 /112 variables (removed 8) and now considering 204/213 (removed 9) transitions.
// Phase 1: matrix 204 rows 104 cols
[2024-06-02 19:06:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:06:58] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:06:58] [INFO ] Invariant cache hit.
[2024-06-02 19:06:58] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-06-02 19:06:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 19:06:59] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:06:59] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-06-02 19:07:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:07:00] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
[2024-06-02 19:07:00] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:07:00] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 19:07:02] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:07:02] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:07:02] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:07:02] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:07:02] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:07:02] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:07:02] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 127 constraints, problems are : Problem set: 0 solved, 203 unsolved in 8320 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 204/308 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 203/330 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 19:07:10] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 8 ms to minimize.
[2024-06-02 19:07:10] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 332 constraints, problems are : Problem set: 0 solved, 203 unsolved in 13178 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 15/15 constraints]
After SMT, in 21666ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 21669ms
Starting structural reductions in LTL mode, iteration 1 : 104/112 places, 204/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21940 ms. Remains : 104/112 places, 204/213 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 82 ms.
Product exploration explored 100000 steps with 33333 reset in 86 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 367 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-09-LTLFireability-06 finished in 22255 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 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 213/213 transitions.
Graph (complete) has 383 edges and 112 vertex of which 110 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 109 transition count 195
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 94 transition count 191
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 92 transition count 189
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 92 transition count 180
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 57 place count 83 transition count 180
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 63 place count 77 transition count 172
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 77 transition count 172
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 117 place count 52 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 52 transition count 146
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 129 place count 47 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 139 place count 47 transition count 152
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 45 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 44 transition count 173
Applied a total of 144 rules in 33 ms. Remains 44 /112 variables (removed 68) and now considering 173/213 (removed 40) transitions.
// Phase 1: matrix 173 rows 44 cols
[2024-06-02 19:07:20] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:07:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 19:07:20] [INFO ] Invariant cache hit.
[2024-06-02 19:07:20] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 19:07:20] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-02 19:07:20] [INFO ] Redundant transitions in 1 ms returned []
Running 168 sub problems to find dead transitions.
[2024-06-02 19:07:20] [INFO ] Invariant cache hit.
[2024-06-02 19:07:20] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 173/216 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 88/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 1/217 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 140 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5105 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 173/216 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 88/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 166/305 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 1/217 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 308 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9767 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 15089ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 15092ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/112 places, 173/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15335 ms. Remains : 44/112 places, 173/213 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 15587 reset in 320 ms.
Product exploration explored 100000 steps with 15615 reset in 291 ms.
Computed a total of 8 stabilizing places and 94 stable transitions
Computed a total of 8 stabilizing places and 94 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 44 /44 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-06-02 19:07:36] [INFO ] Invariant cache hit.
[2024-06-02 19:07:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 19:07:36] [INFO ] Invariant cache hit.
[2024-06-02 19:07:36] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 19:07:37] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-06-02 19:07:37] [INFO ] Redundant transitions in 1 ms returned []
Running 168 sub problems to find dead transitions.
[2024-06-02 19:07:37] [INFO ] Invariant cache hit.
[2024-06-02 19:07:37] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 173/216 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 88/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 1/217 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 140 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5265 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 173/216 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 88/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 166/305 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 1/217 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 308 constraints, problems are : Problem set: 0 solved, 168 unsolved in 10740 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 16220ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 16225ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16441 ms. Remains : 44/44 places, 173/173 transitions.
Computed a total of 8 stabilizing places and 94 stable transitions
Computed a total of 8 stabilizing places and 94 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15654 reset in 405 ms.
Product exploration explored 100000 steps with 15662 reset in 402 ms.
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 173/173 transitions.
Applied a total of 0 rules in 8 ms. Remains 44 /44 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-06-02 19:07:54] [INFO ] Invariant cache hit.
[2024-06-02 19:07:54] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:07:54] [INFO ] Invariant cache hit.
[2024-06-02 19:07:55] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 19:07:55] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-06-02 19:07:55] [INFO ] Redundant transitions in 0 ms returned []
Running 168 sub problems to find dead transitions.
[2024-06-02 19:07:55] [INFO ] Invariant cache hit.
[2024-06-02 19:07:55] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 173/216 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 88/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 1/217 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 140 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7836 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 173/216 variables, 43/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 88/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 166/305 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 1/217 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 308 constraints, problems are : Problem set: 0 solved, 168 unsolved in 12357 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 44/44 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints]
After SMT, in 20384ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 20387ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20699 ms. Remains : 44/44 places, 173/173 transitions.
Treatment of property MedleyA-PT-09-LTLFireability-07 finished in 55323 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(G(p0))))))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 213/213 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 106 transition count 207
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 106 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 105 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 105 transition count 205
Applied a total of 14 rules in 6 ms. Remains 105 /112 variables (removed 7) and now considering 205/213 (removed 8) transitions.
// Phase 1: matrix 205 rows 105 cols
[2024-06-02 19:08:15] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:08:15] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 19:08:15] [INFO ] Invariant cache hit.
[2024-06-02 19:08:15] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2024-06-02 19:08:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:08:17] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:08:17] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:08:18] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:08:18] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:08:18] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:08:20] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-06-02 19:08:20] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:08:20] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:08:20] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:08:21] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/310 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 125 constraints, problems are : Problem set: 0 solved, 204 unsolved in 10765 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 205/310 variables, 105/125 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 204/329 constraints. Problems are: Problem set: 0 solved, 204 unsolved
[2024-06-02 19:08:31] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:08:31] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:08:31] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 9 (OVERLAPS) 0/310 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 332 constraints, problems are : Problem set: 0 solved, 204 unsolved in 18895 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 13/13 constraints]
After SMT, in 29861ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 29865ms
Starting structural reductions in LTL mode, iteration 1 : 105/112 places, 205/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30250 ms. Remains : 105/112 places, 205/213 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLFireability-10
Entered a terminal (fully accepting) state of product in 222 steps with 6 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLFireability-10 finished in 30478 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' '!((((!(p0 U p1)||G(F(p0))) U p1)||G(F(X(p2)))))'
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)))'
[2024-06-02 19:08:46] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:08:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 19:08:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 213 transitions and 993 arcs took 7 ms.
Total runtime 284653 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-09-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-09-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717355483852
--------------------
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 MedleyA-PT-09-LTLFireability-03
ltl formula formula --ltl=/tmp/1515/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 112 places, 213 transitions and 993 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.040 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1515/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1515/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1515/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1515/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 114 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 113, there are 363 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): ~35 levels ~10000 states ~110236 transitions
pnml2lts-mc( 2/ 4): ~31 levels ~20000 states ~236900 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 23393
pnml2lts-mc( 0/ 4): unique states count: 23393
pnml2lts-mc( 0/ 4): unique transitions count: 280549
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 271206
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 25444
pnml2lts-mc( 0/ 4): - cum. max stack depth: 134
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 25444 states 317277 transitions, fanout: 12.470
pnml2lts-mc( 0/ 4): Total exploration time 0.460 sec (0.460 sec minimum, 0.460 sec on average)
pnml2lts-mc( 0/ 4): States per second: 55313, Transitions per second: 689733
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 8.3 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 213 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-09-LTLFireability-07
ltl formula formula --ltl=/tmp/1515/ltl_1_
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 112 places, 213 transitions and 993 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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1515/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1515/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1515/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1515/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 114 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 113, there are 218 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): ~37 levels ~10000 states ~33540 transitions
pnml2lts-mc( 1/ 4): ~56 levels ~20000 states ~69020 transitions
pnml2lts-mc( 1/ 4): ~90 levels ~40000 states ~147540 transitions
pnml2lts-mc( 2/ 4): ~288 levels ~80000 states ~308060 transitions
pnml2lts-mc( 1/ 4): ~138 levels ~160000 states ~659076 transitions
pnml2lts-mc( 2/ 4): ~411 levels ~320000 states ~1445588 transitions
pnml2lts-mc( 2/ 4): ~1040 levels ~640000 states ~3076772 transitions
pnml2lts-mc( 1/ 4): ~655 levels ~1280000 states ~6450596 transitions
pnml2lts-mc( 1/ 4): ~755 levels ~2560000 states ~13628176 transitions
pnml2lts-mc( 1/ 4): ~755 levels ~5120000 states ~28641112 transitions
pnml2lts-mc( 1/ 4): ~4166 levels ~10240000 states ~59097268 transitions
pnml2lts-mc( 1/ 4): ~5335 levels ~20480000 states ~128721596 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30951214
pnml2lts-mc( 0/ 4): unique states count: 33550403
pnml2lts-mc( 0/ 4): unique transitions count: 232886803
pnml2lts-mc( 0/ 4): - self-loop count: 3677
pnml2lts-mc( 0/ 4): - claim dead count: 190538339
pnml2lts-mc( 0/ 4): - claim found count: 8838390
pnml2lts-mc( 0/ 4): - claim success count: 33564646
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16914
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33570367 states 233069236 transitions, fanout: 6.943
pnml2lts-mc( 0/ 4): Total exploration time 155.580 sec (155.530 sec minimum, 155.548 sec on average)
pnml2lts-mc( 0/ 4): States per second: 215776, Transitions per second: 1498067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.6MB, 8.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 213 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.6MB (~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="MedleyA-PT-09"
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 MedleyA-PT-09, 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 r579-smll-171734921200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-09.tgz
mv MedleyA-PT-09 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 ;