About the Execution of LTSMin+red for Peterson-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6702.235 | 1644889.00 | 5994602.00 | 1745.80 | ?F?TFFF??FFFFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r265-smll-167863540200572.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Peterson-COL-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540200572
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 7.5K Feb 25 22:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 22:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 22:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 22:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 22:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 22:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 25 22:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:23 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 Peterson-COL-4-LTLFireability-00
FORMULA_NAME Peterson-COL-4-LTLFireability-01
FORMULA_NAME Peterson-COL-4-LTLFireability-02
FORMULA_NAME Peterson-COL-4-LTLFireability-03
FORMULA_NAME Peterson-COL-4-LTLFireability-04
FORMULA_NAME Peterson-COL-4-LTLFireability-05
FORMULA_NAME Peterson-COL-4-LTLFireability-06
FORMULA_NAME Peterson-COL-4-LTLFireability-07
FORMULA_NAME Peterson-COL-4-LTLFireability-08
FORMULA_NAME Peterson-COL-4-LTLFireability-09
FORMULA_NAME Peterson-COL-4-LTLFireability-10
FORMULA_NAME Peterson-COL-4-LTLFireability-11
FORMULA_NAME Peterson-COL-4-LTLFireability-12
FORMULA_NAME Peterson-COL-4-LTLFireability-13
FORMULA_NAME Peterson-COL-4-LTLFireability-14
FORMULA_NAME Peterson-COL-4-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679098987475
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 00:23:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 00:23:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 00:23:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 00:23:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 00:23:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 859 ms
[2023-03-18 00:23:11] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 00:23:11] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2023-03-18 00:23:11] [INFO ] Skeletonized 15 HLPN properties in 1 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-COL-4-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1584 steps, including 0 resets, run visited all 13 properties in 47 ms. (steps per millisecond=33 )
[2023-03-18 00:23:11] [INFO ] Flatten gal took : 19 ms
[2023-03-18 00:23:11] [INFO ] Flatten gal took : 4 ms
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-18 00:23:11] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 39 ms.
[2023-03-18 00:23:11] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 40 transitions.
Support contains 480 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 18 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 00:23:11] [INFO ] Computed 19 place invariants in 30 ms
[2023-03-18 00:23:12] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-18 00:23:12] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:12] [INFO ] Invariant cache hit.
[2023-03-18 00:23:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:12] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-18 00:23:12] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:12] [INFO ] Invariant cache hit.
[2023-03-18 00:23:13] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1810 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 480 out of 480 places after structural reductions.
[2023-03-18 00:23:13] [INFO ] Flatten gal took : 91 ms
[2023-03-18 00:23:14] [INFO ] Flatten gal took : 104 ms
[2023-03-18 00:23:14] [INFO ] Input system was already deterministic with 690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:23:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:14] [INFO ] Invariant cache hit.
[2023-03-18 00:23:14] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2023-03-18 00:23:14] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2023-03-18 00:23:14] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:23:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 00:23:14] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2023-03-18 00:23:15] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:23:15] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:15] [INFO ] After 68ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:23:15] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 6 ms to minimize.
[2023-03-18 00:23:15] [INFO ] Deduced a trap composed of 49 places in 211 ms of which 1 ms to minimize.
[2023-03-18 00:23:16] [INFO ] Deduced a trap composed of 86 places in 186 ms of which 1 ms to minimize.
[2023-03-18 00:23:16] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 1 ms to minimize.
[2023-03-18 00:23:16] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 1 ms to minimize.
[2023-03-18 00:23:16] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 1 ms to minimize.
[2023-03-18 00:23:17] [INFO ] Deduced a trap composed of 69 places in 250 ms of which 1 ms to minimize.
[2023-03-18 00:23:17] [INFO ] Deduced a trap composed of 73 places in 173 ms of which 2 ms to minimize.
[2023-03-18 00:23:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1909 ms
[2023-03-18 00:23:17] [INFO ] After 2013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-18 00:23:17] [INFO ] After 2551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 20 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 288 transition count 394
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 184 transition count 394
Applied a total of 592 rules in 77 ms. Remains 184 /480 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 184/480 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46 steps, run visited all 1 properties in 6 ms. (steps per millisecond=7 )
Probabilistic random walk after 46 steps, saw 41 distinct states, run finished after 7 ms. (steps per millisecond=6 ) properties seen :1
FORMULA Peterson-COL-4-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 41 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:18] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:18] [INFO ] Invariant cache hit.
[2023-03-18 00:23:18] [INFO ] Implicit Places using invariants in 196 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 200 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 21 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 265 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (AND (GEQ s33 1) (GEQ s62 1)) (AND (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s35 1) (GEQ s51 1)) (AND (GEQ s37 1) (GEQ s59 1)) (AND (GEQ s31 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20426 reset in 751 ms.
Product exploration explored 100000 steps with 20375 reset in 680 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 3 factoid took 241 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-18 00:23:20] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 00:23:21] [INFO ] Computed 14 place invariants in 4 ms
[2023-03-18 00:23:22] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2023-03-18 00:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:23:22] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2023-03-18 00:23:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:23:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-18 00:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:23:24] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2023-03-18 00:23:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:24] [INFO ] [Nat]Added 116 Read/Feed constraints in 31 ms returned sat
[2023-03-18 00:23:24] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 50 ms.
[2023-03-18 00:23:29] [INFO ] Added : 387 causal constraints over 78 iterations in 4726 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 17 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:29] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:29] [INFO ] Invariant cache hit.
[2023-03-18 00:23:29] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-18 00:23:29] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:29] [INFO ] Invariant cache hit.
[2023-03-18 00:23:29] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:30] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
[2023-03-18 00:23:30] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:30] [INFO ] Invariant cache hit.
[2023-03-18 00:23:30] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1411 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-18 00:23:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:31] [INFO ] Invariant cache hit.
[2023-03-18 00:23:32] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 00:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:23:33] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2023-03-18 00:23:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:23:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 12 ms returned sat
[2023-03-18 00:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:23:34] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2023-03-18 00:23:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:35] [INFO ] [Nat]Added 116 Read/Feed constraints in 37 ms returned sat
[2023-03-18 00:23:35] [INFO ] Deduced a trap composed of 33 places in 237 ms of which 1 ms to minimize.
[2023-03-18 00:23:35] [INFO ] Deduced a trap composed of 19 places in 259 ms of which 1 ms to minimize.
[2023-03-18 00:23:35] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 0 ms to minimize.
[2023-03-18 00:23:36] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 1 ms to minimize.
[2023-03-18 00:23:36] [INFO ] Deduced a trap composed of 25 places in 216 ms of which 1 ms to minimize.
[2023-03-18 00:23:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1416 ms
[2023-03-18 00:23:36] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 50 ms.
[2023-03-18 00:23:40] [INFO ] Added : 399 causal constraints over 80 iterations in 4436 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20499 reset in 461 ms.
Product exploration explored 100000 steps with 20448 reset in 498 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 475 transition count 690
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 116 place count 475 transition count 690
Deduced a syphon composed of 205 places in 1 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 205 place count 475 transition count 690
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 321 place count 359 transition count 574
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 437 place count 359 transition count 574
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 189 places in 1 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 537 place count 359 transition count 574
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 621 place count 275 transition count 490
Deduced a syphon composed of 105 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 705 place count 275 transition count 490
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 705 rules in 93 ms. Remains 275 /475 variables (removed 200) and now considering 490/690 (removed 200) transitions.
[2023-03-18 00:23:42] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-18 00:23:42] [INFO ] Flow matrix only has 430 transitions (discarded 60 similar events)
// Phase 1: matrix 430 rows 275 cols
[2023-03-18 00:23:42] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 00:23:42] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/475 places, 490/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 452 ms. Remains : 275/475 places, 490/690 transitions.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 17 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:42] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 00:23:42] [INFO ] Computed 14 place invariants in 12 ms
[2023-03-18 00:23:43] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-18 00:23:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:43] [INFO ] Invariant cache hit.
[2023-03-18 00:23:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:43] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-18 00:23:43] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:43] [INFO ] Invariant cache hit.
[2023-03-18 00:23:44] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1477 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-COL-4-LTLFireability-00 finished in 26507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((X((G(p0) U (p2&&G(p0))))||p1))))))'
Support contains 110 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 480 transition count 686
Reduce places removed 4 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 1 with 104 rules applied. Total rules applied 108 place count 476 transition count 586
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 208 place count 376 transition count 586
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 208 place count 376 transition count 566
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 248 place count 356 transition count 566
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 280 place count 340 transition count 550
Applied a total of 280 rules in 49 ms. Remains 340 /480 variables (removed 140) and now considering 550/690 (removed 140) transitions.
[2023-03-18 00:23:44] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
// Phase 1: matrix 490 rows 340 cols
[2023-03-18 00:23:44] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-18 00:23:44] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-18 00:23:44] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-18 00:23:44] [INFO ] Invariant cache hit.
[2023-03-18 00:23:45] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:45] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2023-03-18 00:23:45] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-18 00:23:45] [INFO ] Flow matrix only has 490 transitions (discarded 60 similar events)
[2023-03-18 00:23:45] [INFO ] Invariant cache hit.
[2023-03-18 00:23:45] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 340/480 places, 550/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1399 ms. Remains : 340/480 places, 550/690 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={1} source=2 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s116 1) (GEQ s120 1) (GEQ s124 1) (GEQ s128 1) (GEQ s63 1) (GEQ s132 1) (GEQ s67 1) (GEQ s136 1) (GEQ s71 1) (GEQ s140 1) (GEQ s75 1) (GEQ s14...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2 reset in 923 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 2 ms.
FORMULA Peterson-COL-4-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-01 finished in 2596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 00:23:47] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-18 00:23:47] [INFO ] Implicit Places using invariants in 235 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 237 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 249 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s427 1) (GEQ s425 1) (GEQ s423 1) (GEQ s437 1) (GEQ s435 1) (GEQ s433 1) (GEQ s431 1) (GEQ s382 1) (GEQ s445 1) (GEQ s380 1) (GEQ s443 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1249 ms.
Product exploration explored 100000 steps with 0 reset in 1228 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 124 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 00:23:50] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-18 00:23:51] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-18 00:23:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:51] [INFO ] Invariant cache hit.
[2023-03-18 00:23:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:51] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2023-03-18 00:23:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:51] [INFO ] Invariant cache hit.
[2023-03-18 00:23:52] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1460 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 246 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 183 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 176 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1162 ms.
Product exploration explored 100000 steps with 0 reset in 1257 ms.
Support contains 130 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:55] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:55] [INFO ] Invariant cache hit.
[2023-03-18 00:23:56] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-18 00:23:56] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:56] [INFO ] Invariant cache hit.
[2023-03-18 00:23:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:23:56] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2023-03-18 00:23:56] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:56] [INFO ] Invariant cache hit.
[2023-03-18 00:23:57] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1493 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-COL-4-LTLFireability-02 finished in 10293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(!p1))||p0)) U (F(p2)&&X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:57] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 00:23:57] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-18 00:23:57] [INFO ] Implicit Places using invariants in 190 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 192 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p0) (NOT p3) p1), (NOT p3), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (GEQ s188 1) (GEQ s187 1) (GEQ s170 1) (GEQ s174 1) (GEQ s172 1) (GEQ s171 1) (GEQ s178 1) (GEQ s176 1) (GEQ s175 1) (GEQ s182 1) (GEQ s180 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6676 reset in 1085 ms.
Stack based approach found an accepted trace after 11487 steps with 766 reset with depth 8 and stack size 8 in 127 ms.
FORMULA Peterson-COL-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-05 finished in 1857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((X(p1)||p0)))) U (G(p2)||X(p3))))'
Support contains 200 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:59] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:59] [INFO ] Invariant cache hit.
[2023-03-18 00:23:59] [INFO ] Implicit Places using invariants in 232 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 237 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 397 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 6}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(OR (GEQ s427 1) (GEQ s425 1) (GEQ s423 1) (GEQ s437 1) (GEQ s435 1) (GEQ s433 1) (GEQ s431 1) (GEQ s382 1) (GEQ s445 1) (GEQ s380 1) (GEQ s443 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-06 finished in 672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(((p1||X(X(F(p2)))) U (p3&&(p1||X(X(F(p2)))))))||p0))))'
Support contains 225 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:23:59] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:23:59] [INFO ] Invariant cache hit.
[2023-03-18 00:24:00] [INFO ] Implicit Places using invariants in 116 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 128 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s313 1)) (AND (GEQ s3 1) (GEQ s360 1)) (AND (GEQ s3 1) (GEQ s307 1)) (AND (GEQ s9 1) (GEQ s310 1)) (AND (GEQ s7 1) (GEQ s366 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13359 reset in 746 ms.
Product exploration explored 100000 steps with 13400 reset in 679 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 6 states, 7 edges and 4 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Finished random walk after 14 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p3), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
[2023-03-18 00:24:02] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 00:24:02] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-18 00:24:03] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 00:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:04] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2023-03-18 00:24:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:24:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 00:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:06] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2023-03-18 00:24:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:06] [INFO ] [Nat]Added 116 Read/Feed constraints in 47 ms returned sat
[2023-03-18 00:24:06] [INFO ] Deduced a trap composed of 27 places in 203 ms of which 1 ms to minimize.
[2023-03-18 00:24:06] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 1 ms to minimize.
[2023-03-18 00:24:07] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 1 ms to minimize.
[2023-03-18 00:24:07] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 0 ms to minimize.
[2023-03-18 00:24:07] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 1 ms to minimize.
[2023-03-18 00:24:07] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 0 ms to minimize.
[2023-03-18 00:24:08] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 0 ms to minimize.
[2023-03-18 00:24:08] [INFO ] Deduced a trap composed of 95 places in 184 ms of which 1 ms to minimize.
[2023-03-18 00:24:08] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 1 ms to minimize.
[2023-03-18 00:24:08] [INFO ] Deduced a trap composed of 55 places in 112 ms of which 1 ms to minimize.
[2023-03-18 00:24:08] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 1 ms to minimize.
[2023-03-18 00:24:09] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 1 ms to minimize.
[2023-03-18 00:24:09] [INFO ] Deduced a trap composed of 91 places in 159 ms of which 1 ms to minimize.
[2023-03-18 00:24:09] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 1 ms to minimize.
[2023-03-18 00:24:09] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3136 ms
[2023-03-18 00:24:09] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 48 ms.
[2023-03-18 00:24:14] [INFO ] Added : 441 causal constraints over 89 iterations in 5065 ms. Result :sat
Could not prove EG (NOT p3)
[2023-03-18 00:24:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:24:14] [INFO ] Invariant cache hit.
[2023-03-18 00:24:16] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-18 00:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:17] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2023-03-18 00:24:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:24:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 14 ms returned sat
[2023-03-18 00:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:19] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2023-03-18 00:24:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:19] [INFO ] [Nat]Added 116 Read/Feed constraints in 48 ms returned sat
[2023-03-18 00:24:19] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 1 ms to minimize.
[2023-03-18 00:24:20] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 1 ms to minimize.
[2023-03-18 00:24:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2023-03-18 00:24:20] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 48 ms.
[2023-03-18 00:24:22] [INFO ] Added : 201 causal constraints over 41 iterations in 2292 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:24:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:24:22] [INFO ] Invariant cache hit.
[2023-03-18 00:24:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 00:24:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:24:22] [INFO ] Invariant cache hit.
[2023-03-18 00:24:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:22] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-18 00:24:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:24:22] [INFO ] Invariant cache hit.
[2023-03-18 00:24:23] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 999 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F p3), (F p2), (F p1)]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
[2023-03-18 00:24:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:24:24] [INFO ] Invariant cache hit.
[2023-03-18 00:24:25] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2023-03-18 00:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:26] [INFO ] [Real]Absence check using state equation in 693 ms returned sat
[2023-03-18 00:24:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:24:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-18 00:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:28] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2023-03-18 00:24:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:28] [INFO ] [Nat]Added 116 Read/Feed constraints in 46 ms returned sat
[2023-03-18 00:24:28] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2023-03-18 00:24:28] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 1 ms to minimize.
[2023-03-18 00:24:28] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 1 ms to minimize.
[2023-03-18 00:24:29] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 2 ms to minimize.
[2023-03-18 00:24:29] [INFO ] Deduced a trap composed of 39 places in 380 ms of which 11 ms to minimize.
[2023-03-18 00:24:29] [INFO ] Deduced a trap composed of 14 places in 248 ms of which 0 ms to minimize.
[2023-03-18 00:24:30] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 1 ms to minimize.
[2023-03-18 00:24:30] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 1 ms to minimize.
[2023-03-18 00:24:30] [INFO ] Deduced a trap composed of 34 places in 238 ms of which 1 ms to minimize.
[2023-03-18 00:24:31] [INFO ] Deduced a trap composed of 91 places in 279 ms of which 1 ms to minimize.
[2023-03-18 00:24:31] [INFO ] Deduced a trap composed of 116 places in 281 ms of which 1 ms to minimize.
[2023-03-18 00:24:31] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 0 ms to minimize.
[2023-03-18 00:24:31] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 1 ms to minimize.
[2023-03-18 00:24:32] [INFO ] Deduced a trap composed of 64 places in 233 ms of which 1 ms to minimize.
[2023-03-18 00:24:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4190 ms
[2023-03-18 00:24:32] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 46 ms.
[2023-03-18 00:24:37] [INFO ] Added : 442 causal constraints over 89 iterations in 5392 ms. Result :sat
Could not prove EG (NOT p3)
[2023-03-18 00:24:37] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:24:37] [INFO ] Invariant cache hit.
[2023-03-18 00:24:39] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-18 00:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:40] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2023-03-18 00:24:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:24:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-18 00:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:42] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2023-03-18 00:24:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:42] [INFO ] [Nat]Added 116 Read/Feed constraints in 47 ms returned sat
[2023-03-18 00:24:42] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 0 ms to minimize.
[2023-03-18 00:24:43] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 0 ms to minimize.
[2023-03-18 00:24:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 486 ms
[2023-03-18 00:24:43] [INFO ] Computed and/alt/rep : 589/1046/589 causal constraints (skipped 36 transitions) in 49 ms.
[2023-03-18 00:24:45] [INFO ] Added : 201 causal constraints over 41 iterations in 2271 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 13370 reset in 584 ms.
Product exploration explored 100000 steps with 13366 reset in 609 ms.
Applying partial POR strategy [false, false, false, false, false, true]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2)]
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 475 transition count 690
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 36 place count 475 transition count 690
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 125 place count 475 transition count 690
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 177 place count 423 transition count 638
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 229 place count 423 transition count 638
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 249 place count 423 transition count 638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 253 place count 419 transition count 634
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 257 place count 419 transition count 634
Deduced a syphon composed of 89 places in 1 ms
Applied a total of 257 rules in 49 ms. Remains 419 /475 variables (removed 56) and now considering 634/690 (removed 56) transitions.
[2023-03-18 00:24:47] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 00:24:47] [INFO ] Flow matrix only has 574 transitions (discarded 60 similar events)
// Phase 1: matrix 574 rows 419 cols
[2023-03-18 00:24:47] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 00:24:47] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/475 places, 634/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 482 ms. Remains : 419/475 places, 634/690 transitions.
Support contains 225 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:24:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 00:24:47] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-18 00:24:47] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-18 00:24:47] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:24:47] [INFO ] Invariant cache hit.
[2023-03-18 00:24:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:48] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-18 00:24:48] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:24:48] [INFO ] Invariant cache hit.
[2023-03-18 00:24:48] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 968 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-COL-4-LTLFireability-07 finished in 48828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 80 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 480 transition count 634
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 424 transition count 634
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 112 place count 424 transition count 550
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 280 place count 340 transition count 550
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 320 place count 320 transition count 530
Applied a total of 320 rules in 34 ms. Remains 320 /480 variables (removed 160) and now considering 530/690 (removed 160) transitions.
[2023-03-18 00:24:48] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
// Phase 1: matrix 470 rows 320 cols
[2023-03-18 00:24:48] [INFO ] Computed 19 place invariants in 7 ms
[2023-03-18 00:24:49] [INFO ] Implicit Places using invariants in 186 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 188 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 315/480 places, 530/690 transitions.
Applied a total of 0 rules in 10 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 315/480 places, 530/690 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s144 1) (GEQ s142 1) (GEQ s96 1) (GEQ s150 1) (GEQ s152 1) (GEQ s147 1) (GEQ s99 1) (GEQ s98 1) (GEQ s149 1) (GEQ s157 1) (GEQ s101 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7726 reset in 495 ms.
Product exploration explored 100000 steps with 7802 reset in 507 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-18 00:24:50] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
// Phase 1: matrix 470 rows 315 cols
[2023-03-18 00:24:50] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 00:24:50] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-18 00:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:51] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2023-03-18 00:24:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:24:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-18 00:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:51] [INFO ] [Nat]Absence check using state equation in 298 ms returned sat
[2023-03-18 00:24:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:52] [INFO ] [Nat]Added 116 Read/Feed constraints in 33 ms returned sat
[2023-03-18 00:24:52] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2023-03-18 00:24:52] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2023-03-18 00:24:52] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 1 ms to minimize.
[2023-03-18 00:24:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 472 ms
[2023-03-18 00:24:52] [INFO ] Computed and/alt/rep : 429/946/429 causal constraints (skipped 36 transitions) in 33 ms.
[2023-03-18 00:24:53] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-18 00:24:53] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2023-03-18 00:24:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 342 ms
[2023-03-18 00:24:54] [INFO ] Added : 141 causal constraints over 29 iterations in 1618 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Applied a total of 0 rules in 10 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2023-03-18 00:24:54] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-18 00:24:54] [INFO ] Invariant cache hit.
[2023-03-18 00:24:54] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-18 00:24:54] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-18 00:24:54] [INFO ] Invariant cache hit.
[2023-03-18 00:24:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:54] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2023-03-18 00:24:54] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 00:24:54] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-18 00:24:54] [INFO ] Invariant cache hit.
[2023-03-18 00:24:55] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1262 ms. Remains : 315/315 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-18 00:24:55] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-18 00:24:55] [INFO ] Invariant cache hit.
[2023-03-18 00:24:56] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-18 00:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:56] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-03-18 00:24:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 00:24:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-18 00:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 00:24:57] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2023-03-18 00:24:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:24:57] [INFO ] [Nat]Added 116 Read/Feed constraints in 46 ms returned sat
[2023-03-18 00:24:57] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 0 ms to minimize.
[2023-03-18 00:24:57] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2023-03-18 00:24:57] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2023-03-18 00:24:57] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2023-03-18 00:24:58] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2023-03-18 00:24:58] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 10 ms to minimize.
[2023-03-18 00:24:58] [INFO ] Deduced a trap composed of 41 places in 100 ms of which 0 ms to minimize.
[2023-03-18 00:24:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1042 ms
[2023-03-18 00:24:58] [INFO ] Computed and/alt/rep : 429/946/429 causal constraints (skipped 36 transitions) in 34 ms.
[2023-03-18 00:24:59] [INFO ] Added : 169 causal constraints over 34 iterations in 1370 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7770 reset in 487 ms.
Product exploration explored 100000 steps with 7802 reset in 502 ms.
Support contains 80 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 530/530 transitions.
Applied a total of 0 rules in 9 ms. Remains 315 /315 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2023-03-18 00:25:00] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-18 00:25:00] [INFO ] Invariant cache hit.
[2023-03-18 00:25:00] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-18 00:25:00] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-18 00:25:00] [INFO ] Invariant cache hit.
[2023-03-18 00:25:01] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:01] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2023-03-18 00:25:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 00:25:01] [INFO ] Flow matrix only has 470 transitions (discarded 60 similar events)
[2023-03-18 00:25:01] [INFO ] Invariant cache hit.
[2023-03-18 00:25:02] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1323 ms. Remains : 315/315 places, 530/530 transitions.
Treatment of property Peterson-COL-4-LTLFireability-08 finished in 13364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 40 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 400 place count 280 transition count 390
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 600 place count 180 transition count 390
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 640 place count 160 transition count 370
Applied a total of 640 rules in 26 ms. Remains 160 /480 variables (removed 320) and now considering 370/690 (removed 320) transitions.
[2023-03-18 00:25:02] [INFO ] Flow matrix only has 310 transitions (discarded 60 similar events)
// Phase 1: matrix 310 rows 160 cols
[2023-03-18 00:25:02] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 00:25:02] [INFO ] Implicit Places using invariants in 143 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 159 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/480 places, 370/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 155/480 places, 370/690 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s43 1)) (AND (GEQ s20 1) (GEQ s44 1)) (AND (GEQ s25 1) (GEQ s49 1)) (AND (GEQ s30 1) (GEQ s46 1)) (AND (GEQ s15 1) (GEQ s47 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12902 reset in 731 ms.
Stack based approach found an accepted trace after 105 steps with 13 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-09 finished in 981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 120 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 480 transition count 634
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 424 transition count 634
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 112 place count 424 transition count 565
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 250 place count 355 transition count 565
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 290 place count 335 transition count 545
Applied a total of 290 rules in 26 ms. Remains 335 /480 variables (removed 145) and now considering 545/690 (removed 145) transitions.
[2023-03-18 00:25:03] [INFO ] Flow matrix only has 485 transitions (discarded 60 similar events)
// Phase 1: matrix 485 rows 335 cols
[2023-03-18 00:25:03] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 00:25:03] [INFO ] Implicit Places using invariants in 166 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 177 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 330/480 places, 545/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 330 /330 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 330/480 places, 545/690 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s159 1) (GEQ s157 1) (GEQ s111 1) (GEQ s165 1) (GEQ s167 1) (GEQ s162 1) (GEQ s114 1) (GEQ s113 1) (GEQ s164 1) (GEQ s172 1) (GEQ s116 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-4-LTLFireability-10 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 15 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:25:03] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 00:25:03] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 00:25:03] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-18 00:25:03] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:25:03] [INFO ] Invariant cache hit.
[2023-03-18 00:25:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:04] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2023-03-18 00:25:04] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:25:04] [INFO ] Invariant cache hit.
[2023-03-18 00:25:05] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1974 ms. Remains : 480/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (GEQ s178 1) (GEQ s194 1) (GEQ s182 1) (GEQ s186 1) (GEQ s190 1)), p0:(OR (AND (GEQ s0 1) (GEQ s5 1)) (AND (GEQ s3 1) (GEQ s11 1)) (AND (GEQ s2 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 834 reset in 193 ms.
Stack based approach found an accepted trace after 948 steps with 8 reset with depth 51 and stack size 51 in 2 ms.
FORMULA Peterson-COL-4-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-11 finished in 2286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 480 transition count 570
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 360 transition count 570
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 240 place count 360 transition count 475
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 430 place count 265 transition count 475
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 470 place count 245 transition count 455
Applied a total of 470 rules in 20 ms. Remains 245 /480 variables (removed 235) and now considering 455/690 (removed 235) transitions.
[2023-03-18 00:25:05] [INFO ] Flow matrix only has 395 transitions (discarded 60 similar events)
// Phase 1: matrix 395 rows 245 cols
[2023-03-18 00:25:05] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-18 00:25:05] [INFO ] Implicit Places using invariants in 91 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 102 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/480 places, 455/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 240/480 places, 455/690 transitions.
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : Peterson-COL-4-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (NOT (OR (AND (GEQ s7 1) (GEQ s118 1)) (AND (GEQ s3 1) (GEQ s165 1)) (AND (GEQ s3 1) (GEQ s112 1)) (AND (GEQ s9 1) (GEQ s115 1)) (AND (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1886 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA Peterson-COL-4-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-12 finished in 2080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((F(p0)&&F(G(!p1)))))))'
Support contains 160 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 480 transition count 682
Reduce places removed 8 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 24 rules applied. Total rules applied 32 place count 472 transition count 666
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 48 place count 456 transition count 666
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 48 place count 456 transition count 642
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 96 place count 432 transition count 642
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 128 place count 416 transition count 626
Applied a total of 128 rules in 27 ms. Remains 416 /480 variables (removed 64) and now considering 626/690 (removed 64) transitions.
[2023-03-18 00:25:07] [INFO ] Flow matrix only has 566 transitions (discarded 60 similar events)
// Phase 1: matrix 566 rows 416 cols
[2023-03-18 00:25:07] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 00:25:08] [INFO ] Implicit Places using invariants in 268 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 269 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 411/480 places, 626/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 411 /411 variables (removed 0) and now considering 626/626 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 411/480 places, 626/690 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Peterson-COL-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s373 1) (GEQ s371 1) (GEQ s370 1) (GEQ s381 1) (GEQ s379 1) (GEQ s378 1) (GEQ s376 1) (GEQ s337 1) (GEQ s387 1) (GEQ s335 1) (GEQ s386 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 182 reset in 495 ms.
Stack based approach found an accepted trace after 796 steps with 29 reset with depth 45 and stack size 45 in 4 ms.
FORMULA Peterson-COL-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-13 finished in 925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&X(X(X(F((!p1||G(p0))))))))))'
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:25:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2023-03-18 00:25:08] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-18 00:25:08] [INFO ] Implicit Places using invariants in 224 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 226 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 239 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LT s429 1) (LT s459 1) (LT s394 1) (LT s424 1) (LT s469 1) (LT s404 1) (LT s434 1) (LT s399 1) (LT s464 1) (LT s414 1) (LT s379 1) (LT s444 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17855 reset in 469 ms.
Product exploration explored 100000 steps with 17689 reset in 481 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 00:25:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 00:25:11] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 00:25:11] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-18 00:25:11] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 00:25:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 00:25:12] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 00:25:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:12] [INFO ] After 399ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 00:25:12] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2023-03-18 00:25:12] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 0 ms to minimize.
[2023-03-18 00:25:12] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 1 ms to minimize.
[2023-03-18 00:25:13] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 0 ms to minimize.
[2023-03-18 00:25:13] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 1 ms to minimize.
[2023-03-18 00:25:13] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 0 ms to minimize.
[2023-03-18 00:25:13] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2023-03-18 00:25:13] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2023-03-18 00:25:13] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2023-03-18 00:25:14] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 1 ms to minimize.
[2023-03-18 00:25:14] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 4 ms to minimize.
[2023-03-18 00:25:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1626 ms
[2023-03-18 00:25:14] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 1 ms to minimize.
[2023-03-18 00:25:15] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-18 00:25:15] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 1 ms to minimize.
[2023-03-18 00:25:15] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 0 ms to minimize.
[2023-03-18 00:25:15] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2023-03-18 00:25:15] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 0 ms to minimize.
[2023-03-18 00:25:16] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 0 ms to minimize.
[2023-03-18 00:25:16] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 0 ms to minimize.
[2023-03-18 00:25:16] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 1 ms to minimize.
[2023-03-18 00:25:16] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 0 ms to minimize.
[2023-03-18 00:25:16] [INFO ] Deduced a trap composed of 80 places in 165 ms of which 0 ms to minimize.
[2023-03-18 00:25:17] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 1 ms to minimize.
[2023-03-18 00:25:17] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 0 ms to minimize.
[2023-03-18 00:25:17] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 0 ms to minimize.
[2023-03-18 00:25:17] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3161 ms
[2023-03-18 00:25:17] [INFO ] After 5625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 646 ms.
[2023-03-18 00:25:18] [INFO ] After 7053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 475 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 283 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 283 transition count 394
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 179 transition count 394
Applied a total of 592 rules in 43 ms. Remains 179 /475 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 179/475 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 686292 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{0=1}
Probabilistic random walk after 686292 steps, saw 115087 distinct states, run finished after 3003 ms. (steps per millisecond=228 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-18 00:25:21] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-18 00:25:21] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-18 00:25:21] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:25:21] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:25:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-18 00:25:22] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:25:22] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:22] [INFO ] After 309ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:25:23] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2023-03-18 00:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-18 00:25:23] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-18 00:25:23] [INFO ] After 1513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 753126 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 753126 steps, saw 126237 distinct states, run finished after 3002 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:25:26] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:25:26] [INFO ] Invariant cache hit.
[2023-03-18 00:25:26] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:25:26] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:25:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:25:27] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:25:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:27] [INFO ] After 311ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:25:27] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-18 00:25:28] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2023-03-18 00:25:28] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-18 00:25:28] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-18 00:25:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 408 ms
[2023-03-18 00:25:28] [INFO ] After 1013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 310 ms.
[2023-03-18 00:25:28] [INFO ] After 1831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 179/179 places, 394/394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-18 00:25:28] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:25:28] [INFO ] Invariant cache hit.
[2023-03-18 00:25:28] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-18 00:25:28] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:25:28] [INFO ] Invariant cache hit.
[2023-03-18 00:25:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:29] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-18 00:25:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 00:25:29] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:25:29] [INFO ] Invariant cache hit.
[2023-03-18 00:25:29] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 179/179 places, 394/394 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 179 transition count 334
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 169 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 164 transition count 324
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 145 place count 164 transition count 264
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 185 place count 164 transition count 224
Reduce places removed 40 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 60 rules applied. Total rules applied 245 place count 124 transition count 204
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 265 place count 104 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 104 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 273 place count 100 transition count 200
Applied a total of 273 rules in 69 ms. Remains 100 /179 variables (removed 79) and now considering 200/394 (removed 194) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 100 cols
[2023-03-18 00:25:29] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 00:25:29] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-18 00:25:29] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:25:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-18 00:25:29] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:25:30] [INFO ] After 584ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-18 00:25:30] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 15 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:25:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 00:25:31] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 00:25:31] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-18 00:25:31] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:25:31] [INFO ] Invariant cache hit.
[2023-03-18 00:25:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:32] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1033 ms to find 0 implicit places.
[2023-03-18 00:25:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:25:32] [INFO ] Invariant cache hit.
[2023-03-18 00:25:32] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1580 ms. Remains : 475/475 places, 690/690 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 00:25:33] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:25:33] [INFO ] Invariant cache hit.
[2023-03-18 00:25:33] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 00:25:33] [INFO ] After 402ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 00:25:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-18 00:25:34] [INFO ] After 673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 00:25:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:35] [INFO ] After 500ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 00:25:35] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 1 ms to minimize.
[2023-03-18 00:25:35] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 1 ms to minimize.
[2023-03-18 00:25:35] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 0 ms to minimize.
[2023-03-18 00:25:35] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 0 ms to minimize.
[2023-03-18 00:25:35] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 0 ms to minimize.
[2023-03-18 00:25:36] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 1 ms to minimize.
[2023-03-18 00:25:36] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 0 ms to minimize.
[2023-03-18 00:25:36] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 0 ms to minimize.
[2023-03-18 00:25:36] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 0 ms to minimize.
[2023-03-18 00:25:36] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 1 ms to minimize.
[2023-03-18 00:25:37] [INFO ] Deduced a trap composed of 61 places in 160 ms of which 1 ms to minimize.
[2023-03-18 00:25:37] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 0 ms to minimize.
[2023-03-18 00:25:37] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 0 ms to minimize.
[2023-03-18 00:25:37] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 0 ms to minimize.
[2023-03-18 00:25:37] [INFO ] Deduced a trap composed of 40 places in 174 ms of which 1 ms to minimize.
[2023-03-18 00:25:38] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 1 ms to minimize.
[2023-03-18 00:25:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3024 ms
[2023-03-18 00:25:38] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 1 ms to minimize.
[2023-03-18 00:25:39] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
[2023-03-18 00:25:39] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 0 ms to minimize.
[2023-03-18 00:25:39] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 1 ms to minimize.
[2023-03-18 00:25:39] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 0 ms to minimize.
[2023-03-18 00:25:39] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 1 ms to minimize.
[2023-03-18 00:25:40] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 1 ms to minimize.
[2023-03-18 00:25:40] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 1 ms to minimize.
[2023-03-18 00:25:40] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 0 ms to minimize.
[2023-03-18 00:25:40] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 1 ms to minimize.
[2023-03-18 00:25:41] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 0 ms to minimize.
[2023-03-18 00:25:41] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 0 ms to minimize.
[2023-03-18 00:25:41] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 0 ms to minimize.
[2023-03-18 00:25:41] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2023-03-18 00:25:42] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 1 ms to minimize.
[2023-03-18 00:25:42] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 0 ms to minimize.
[2023-03-18 00:25:42] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 1 ms to minimize.
[2023-03-18 00:25:43] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 1 ms to minimize.
[2023-03-18 00:25:43] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2023-03-18 00:25:43] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-18 00:25:43] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 1 ms to minimize.
[2023-03-18 00:25:43] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5149 ms
[2023-03-18 00:25:43] [INFO ] After 9213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 825 ms.
[2023-03-18 00:25:44] [INFO ] After 10838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 65 ms.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 475 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 283 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 283 transition count 394
Deduced a syphon composed of 104 places in 0 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 179 transition count 394
Applied a total of 592 rules in 17 ms. Remains 179 /475 variables (removed 296) and now considering 394/690 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 179/475 places, 394/690 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Finished probabilistic random walk after 773782 steps, run visited all 2 properties in 2575 ms. (steps per millisecond=300 )
Probabilistic random walk after 773782 steps, saw 129645 distinct states, run finished after 2576 ms. (steps per millisecond=300 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17913 reset in 456 ms.
Product exploration explored 100000 steps with 17759 reset in 469 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 475 transition count 690
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 89 Pre rules applied. Total rules applied 112 place count 475 transition count 690
Deduced a syphon composed of 201 places in 1 ms
Iterating global reduction 1 with 89 rules applied. Total rules applied 201 place count 475 transition count 690
Discarding 112 places :
Symmetric choice reduction at 1 with 112 rule applications. Total rules 313 place count 363 transition count 578
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 425 place count 363 transition count 578
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 184 places in 1 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 520 place count 363 transition count 578
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 600 place count 283 transition count 498
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 680 place count 283 transition count 498
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 680 rules in 51 ms. Remains 283 /475 variables (removed 192) and now considering 498/690 (removed 192) transitions.
[2023-03-18 00:25:49] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 00:25:49] [INFO ] Flow matrix only has 438 transitions (discarded 60 similar events)
// Phase 1: matrix 438 rows 283 cols
[2023-03-18 00:25:49] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 00:25:50] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/475 places, 498/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 283/475 places, 498/690 transitions.
Support contains 60 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2023-03-18 00:25:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 475 cols
[2023-03-18 00:25:50] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 00:25:50] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-18 00:25:50] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:25:50] [INFO ] Invariant cache hit.
[2023-03-18 00:25:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:51] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
[2023-03-18 00:25:51] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2023-03-18 00:25:51] [INFO ] Invariant cache hit.
[2023-03-18 00:25:51] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1586 ms. Remains : 475/475 places, 690/690 transitions.
Treatment of property Peterson-COL-4-LTLFireability-14 finished in 42978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 80 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 480 transition count 602
Reduce places removed 88 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 168 rules applied. Total rules applied 256 place count 392 transition count 522
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 336 place count 312 transition count 522
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 336 place count 312 transition count 482
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 416 place count 272 transition count 482
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 448 place count 256 transition count 466
Applied a total of 448 rules in 26 ms. Remains 256 /480 variables (removed 224) and now considering 466/690 (removed 224) transitions.
[2023-03-18 00:25:51] [INFO ] Flow matrix only has 406 transitions (discarded 60 similar events)
// Phase 1: matrix 406 rows 256 cols
[2023-03-18 00:25:51] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-18 00:25:51] [INFO ] Implicit Places using invariants in 209 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 211 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/480 places, 466/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 251 /251 variables (removed 0) and now considering 466/466 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 251/480 places, 466/690 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Peterson-COL-4-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s213 1) (GEQ s211 1) (GEQ s210 1) (GEQ s221 1) (GEQ s219 1) (GEQ s218 1) (GEQ s216 1) (GEQ s177 1) (GEQ s227 1) (GEQ s175 1) (GEQ s226 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 611 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 48 in 0 ms.
FORMULA Peterson-COL-4-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-4-LTLFireability-15 finished in 909 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Found a Shortening insensitive property : Peterson-COL-4-LTLFireability-00
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 400 place count 280 transition count 405
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 570 place count 195 transition count 405
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 610 place count 175 transition count 385
Applied a total of 610 rules in 17 ms. Remains 175 /480 variables (removed 305) and now considering 385/690 (removed 305) transitions.
[2023-03-18 00:25:52] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
// Phase 1: matrix 325 rows 175 cols
[2023-03-18 00:25:52] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 00:25:53] [INFO ] Implicit Places using invariants in 138 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 139 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 170/480 places, 385/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 160 ms. Remains : 170/480 places, 385/690 transitions.
Running random walk in product with property : Peterson-COL-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (OR (AND (GEQ s33 1) (GEQ s62 1)) (AND (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s35 1) (GEQ s51 1)) (AND (GEQ s37 1) (GEQ s59 1)) (AND (GEQ s31 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20495 reset in 417 ms.
Stack based approach found an accepted trace after 50609 steps with 10376 reset with depth 8 and stack size 8 in 218 ms.
Treatment of property Peterson-COL-4-LTLFireability-00 finished in 1088 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Found a Lengthening insensitive property : Peterson-COL-4-LTLFireability-02
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 480 transition count 602
Reduce places removed 88 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 168 rules applied. Total rules applied 256 place count 392 transition count 522
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 336 place count 312 transition count 522
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 336 place count 312 transition count 502
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 376 place count 292 transition count 502
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 408 place count 276 transition count 486
Applied a total of 408 rules in 19 ms. Remains 276 /480 variables (removed 204) and now considering 486/690 (removed 204) transitions.
[2023-03-18 00:25:53] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 276 cols
[2023-03-18 00:25:53] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-18 00:25:54] [INFO ] Implicit Places using invariants in 161 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 162 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 271/480 places, 486/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 185 ms. Remains : 271/480 places, 486/690 transitions.
Running random walk in product with property : Peterson-COL-4-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (GEQ s233 1) (GEQ s231 1) (GEQ s230 1) (GEQ s241 1) (GEQ s239 1) (GEQ s238 1) (GEQ s236 1) (GEQ s197 1) (GEQ s247 1) (GEQ s195 1) (GEQ s246 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1252 ms.
Product exploration explored 100000 steps with 0 reset in 1258 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 129 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-18 00:25:57] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
// Phase 1: matrix 426 rows 271 cols
[2023-03-18 00:25:57] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-18 00:25:57] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-18 00:25:57] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 00:25:57] [INFO ] Invariant cache hit.
[2023-03-18 00:25:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:25:58] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-18 00:25:58] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 00:25:58] [INFO ] Invariant cache hit.
[2023-03-18 00:25:58] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 271/271 places, 486/486 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 89 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1206 ms.
Product exploration explored 100000 steps with 0 reset in 1222 ms.
Support contains 130 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 486/486 transitions.
Applied a total of 0 rules in 2 ms. Remains 271 /271 variables (removed 0) and now considering 486/486 (removed 0) transitions.
[2023-03-18 00:26:01] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 00:26:01] [INFO ] Invariant cache hit.
[2023-03-18 00:26:01] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-18 00:26:01] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 00:26:01] [INFO ] Invariant cache hit.
[2023-03-18 00:26:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:26:02] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-18 00:26:02] [INFO ] Flow matrix only has 426 transitions (discarded 60 similar events)
[2023-03-18 00:26:02] [INFO ] Invariant cache hit.
[2023-03-18 00:26:02] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 968 ms. Remains : 271/271 places, 486/486 transitions.
Treatment of property Peterson-COL-4-LTLFireability-02 finished in 9062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(((p1||X(X(F(p2)))) U (p3&&(p1||X(X(F(p2)))))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&X(X(X(F((!p1||G(p0))))))))))'
Found a Shortening insensitive property : Peterson-COL-4-LTLFireability-14
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 480 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 384 place count 288 transition count 394
Deduced a syphon composed of 104 places in 1 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 592 place count 184 transition count 394
Applied a total of 592 rules in 13 ms. Remains 184 /480 variables (removed 296) and now considering 394/690 (removed 296) transitions.
[2023-03-18 00:26:03] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 184 cols
[2023-03-18 00:26:03] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-18 00:26:03] [INFO ] Implicit Places using invariants in 139 ms returned [0, 1, 2, 3, 4]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 140 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 179/480 places, 394/690 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 157 ms. Remains : 179/480 places, 394/690 transitions.
Running random walk in product with property : Peterson-COL-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (LT s138 1) (LT s163 1) (LT s110 1) (LT s134 1) (LT s173 1) (LT s118 1) (LT s142 1) (LT s114 1) (LT s168 1) (LT s126 1) (LT s98 1) (LT s150 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17759 reset in 391 ms.
Product exploration explored 100000 steps with 17512 reset in 405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 00:26:05] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-18 00:26:05] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-18 00:26:05] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:26:05] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 00:26:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-18 00:26:05] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 00:26:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:26:06] [INFO ] After 328ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2023-03-18 00:26:06] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2023-03-18 00:26:07] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2023-03-18 00:26:07] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 1 ms to minimize.
[2023-03-18 00:26:07] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2023-03-18 00:26:07] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-18 00:26:07] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2023-03-18 00:26:07] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1340 ms
[2023-03-18 00:26:07] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2023-03-18 00:26:07] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 0 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 0 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2023-03-18 00:26:08] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-18 00:26:09] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2092 ms
[2023-03-18 00:26:09] [INFO ] After 4078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 369 ms.
[2023-03-18 00:26:10] [INFO ] After 4954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 753384 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{0=1}
Probabilistic random walk after 753384 steps, saw 126293 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-18 00:26:13] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:13] [INFO ] Invariant cache hit.
[2023-03-18 00:26:13] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:26:13] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:26:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:26:14] [INFO ] After 435ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:26:14] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:26:14] [INFO ] After 312ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:26:14] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2023-03-18 00:26:15] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-18 00:26:15] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-18 00:26:15] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-18 00:26:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 405 ms
[2023-03-18 00:26:15] [INFO ] After 1017ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-18 00:26:15] [INFO ] After 1815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 754356 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 754356 steps, saw 126436 distinct states, run finished after 3001 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 00:26:18] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:18] [INFO ] Invariant cache hit.
[2023-03-18 00:26:18] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:26:18] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:26:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:26:19] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:26:19] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:26:19] [INFO ] After 308ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 00:26:19] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2023-03-18 00:26:20] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-18 00:26:20] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-18 00:26:20] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-18 00:26:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 396 ms
[2023-03-18 00:26:20] [INFO ] After 996ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 303 ms.
[2023-03-18 00:26:20] [INFO ] After 1790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 179/179 places, 394/394 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-18 00:26:20] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:20] [INFO ] Invariant cache hit.
[2023-03-18 00:26:20] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-18 00:26:20] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:20] [INFO ] Invariant cache hit.
[2023-03-18 00:26:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:26:21] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-03-18 00:26:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 00:26:21] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:21] [INFO ] Invariant cache hit.
[2023-03-18 00:26:21] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 814 ms. Remains : 179/179 places, 394/394 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 179 transition count 334
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 75 place count 169 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 164 transition count 324
Drop transitions removed 60 transitions
Redundant transition composition rules discarded 60 transitions
Iterating global reduction 1 with 60 rules applied. Total rules applied 145 place count 164 transition count 264
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 185 place count 164 transition count 224
Reduce places removed 40 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 60 rules applied. Total rules applied 245 place count 124 transition count 204
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 265 place count 104 transition count 204
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 104 transition count 200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 273 place count 100 transition count 200
Applied a total of 273 rules in 32 ms. Remains 100 /179 variables (removed 79) and now considering 200/394 (removed 194) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 200 rows 100 cols
[2023-03-18 00:26:21] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-18 00:26:21] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-18 00:26:21] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 00:26:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-18 00:26:21] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 00:26:22] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 224 ms.
[2023-03-18 00:26:22] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-18 00:26:22] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
// Phase 1: matrix 334 rows 179 cols
[2023-03-18 00:26:22] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-18 00:26:23] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-18 00:26:23] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:23] [INFO ] Invariant cache hit.
[2023-03-18 00:26:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:26:23] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-18 00:26:23] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:23] [INFO ] Invariant cache hit.
[2023-03-18 00:26:23] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 781 ms. Remains : 179/179 places, 394/394 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 00:26:24] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:24] [INFO ] Invariant cache hit.
[2023-03-18 00:26:24] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-18 00:26:24] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 00:26:24] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-18 00:26:25] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 00:26:25] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:26:25] [INFO ] After 325ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 00:26:25] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-03-18 00:26:25] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-03-18 00:26:25] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-18 00:26:25] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 0 ms to minimize.
[2023-03-18 00:26:25] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-18 00:26:25] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 1 ms to minimize.
[2023-03-18 00:26:26] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-18 00:26:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 647 ms
[2023-03-18 00:26:26] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-18 00:26:26] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-18 00:26:26] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-18 00:26:26] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-18 00:26:26] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2023-03-18 00:26:26] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-18 00:26:27] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-03-18 00:26:27] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2023-03-18 00:26:27] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2023-03-18 00:26:27] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 1 ms to minimize.
[2023-03-18 00:26:27] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 0 ms to minimize.
[2023-03-18 00:26:27] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2023-03-18 00:26:27] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2023-03-18 00:26:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1324 ms
[2023-03-18 00:26:27] [INFO ] After 2635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-18 00:26:28] [INFO ] After 3475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 179/179 places, 394/394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Finished probabilistic random walk after 773782 steps, run visited all 2 properties in 2566 ms. (steps per millisecond=301 )
Probabilistic random walk after 773782 steps, saw 129645 distinct states, run finished after 2567 ms. (steps per millisecond=301 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F p1)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 17607 reset in 372 ms.
Product exploration explored 100000 steps with 17618 reset in 391 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-18 00:26:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 00:26:32] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:32] [INFO ] Invariant cache hit.
[2023-03-18 00:26:33] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 179/179 places, 394/394 transitions.
Support contains 60 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 394/394 transitions.
Applied a total of 0 rules in 1 ms. Remains 179 /179 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-18 00:26:33] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:33] [INFO ] Invariant cache hit.
[2023-03-18 00:26:33] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-18 00:26:33] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:33] [INFO ] Invariant cache hit.
[2023-03-18 00:26:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-03-18 00:26:33] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2023-03-18 00:26:33] [INFO ] Flow matrix only has 334 transitions (discarded 60 similar events)
[2023-03-18 00:26:33] [INFO ] Invariant cache hit.
[2023-03-18 00:26:33] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 765 ms. Remains : 179/179 places, 394/394 transitions.
Treatment of property Peterson-COL-4-LTLFireability-14 finished in 30921 ms.
[2023-03-18 00:26:33] [INFO ] Flatten gal took : 48 ms
[2023-03-18 00:26:33] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2023-03-18 00:26:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 4 ms.
Total runtime 203729 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3142/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 9646564 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16124732 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3142/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3142/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 9464124 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16115752 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3142/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3142/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Peterson-COL-4-LTLFireability-00
Could not compute solution for formula : Peterson-COL-4-LTLFireability-02
Could not compute solution for formula : Peterson-COL-4-LTLFireability-07
Could not compute solution for formula : Peterson-COL-4-LTLFireability-08
Could not compute solution for formula : Peterson-COL-4-LTLFireability-14
BK_STOP 1679100632364
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Peterson-COL-4-LTLFireability-00
ltl formula formula --ltl=/tmp/3142/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 480 places, 690 transitions and 2120 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.070 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3142/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3142/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3142/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3142/ltl_0_
Killing (15) : 3148 3149 3150 3151 3152
Killing (9) : 3148 3149 3150 3151 3152
ltl formula name Peterson-COL-4-LTLFireability-02
ltl formula formula --ltl=/tmp/3142/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 480 places, 690 transitions and 2120 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.100 real 0.000 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3142/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3142/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3142/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3142/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Peterson-COL-4-LTLFireability-07
ltl formula formula --ltl=/tmp/3142/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 480 places, 690 transitions and 2120 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.080 real 0.040 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3142/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3142/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3142/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3142/ltl_2_
Killing (15) : 3171 3172 3173 3174 3175
Killing (9) : 3171 3172 3173 3174 3175
ltl formula name Peterson-COL-4-LTLFireability-08
ltl formula formula --ltl=/tmp/3142/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 480 places, 690 transitions and 2120 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.080 real 0.040 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3142/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3142/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3142/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3142/ltl_3_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
ltl formula name Peterson-COL-4-LTLFireability-14
ltl formula formula --ltl=/tmp/3142/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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 480 places, 690 transitions and 2120 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.080 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3142/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3142/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3142/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3142/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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="Peterson-COL-4"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Peterson-COL-4, 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 r265-smll-167863540200572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;