About the Execution of LTSMin+red for LamportFastMutEx-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16224.611 | 1693477.00 | 6265366.00 | 18810.90 | ?FTFF???TFTTFTTT | 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.r233-tall-167856418900436.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 LamportFastMutEx-PT-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418900436
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 30K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 198K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 165K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 240K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 93K Feb 25 13:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 499K Feb 25 13:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 265K Mar 5 18:22 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 LamportFastMutEx-PT-7-LTLFireability-00
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-01
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-02
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-03
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-04
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-05
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-06
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-07
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-08
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-09
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-10
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-11
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-12
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-13
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-14
FORMULA_NAME LamportFastMutEx-PT-7-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679522261087
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=LamportFastMutEx-PT-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 21:57:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 21:57:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:57:42] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-22 21:57:42] [INFO ] Transformed 264 places.
[2023-03-22 21:57:42] [INFO ] Transformed 536 transitions.
[2023-03-22 21:57:42] [INFO ] Found NUPN structural information;
[2023-03-22 21:57:42] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_start_1_5, P_start_1_6, P_start_1_7, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_b_5_false, P_b_5_true, P_b_6_false, P_b_6_true, P_b_7_false, P_b_7_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setx_3_5, P_setx_3_6, P_setx_3_7, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_setbi_5_5, P_setbi_5_6, P_setbi_5_7, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_ify0_4_5, P_ify0_4_6, P_ify0_4_7, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_sety_9_5, P_sety_9_6, P_sety_9_7, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_ifxi_10_5, P_ifxi_10_6, P_ifxi_10_7, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_setbi_11_5, P_setbi_11_6, P_setbi_11_7, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_fordo_12_5, P_fordo_12_6, P_fordo_12_7, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_0_5, P_wait_0_6, P_wait_0_7, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_1_5, P_wait_1_6, P_wait_1_7, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_2_5, P_wait_2_6, P_wait_2_7, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_3_5, P_wait_3_6, P_wait_3_7, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_wait_4_5, P_wait_4_6, P_wait_4_7, P_wait_5_0, P_wait_5_1, P_wait_5_2, P_wait_5_3, P_wait_5_4, P_wait_5_5, P_wait_5_6, P_wait_5_7, P_wait_6_0, P_wait_6_1, P_wait_6_2, P_wait_6_3, P_wait_6_4, P_wait_6_5, P_wait_6_6, P_wait_6_7, P_wait_7_0, P_wait_7_1, P_wait_7_2, P_wait_7_3, P_wait_7_4, P_wait_7_5, P_wait_7_6, P_wait_7_7, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_await_13_5, P_await_13_6, P_await_13_7, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_0_5, P_done_0_6, P_done_0_7, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_1_5, P_done_1_6, P_done_1_7, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_2_5, P_done_2_6, P_done_2_7, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_3_5, P_done_3_6, P_done_3_7, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_done_4_5, P_done_4_6, P_done_4_7, P_done_5_0, P_done_5_1, P_done_5_2, P_done_5_3, P_done_5_4, P_done_5_5, P_done_5_6, P_done_5_7, P_done_6_0, P_done_6_1, P_done_6_2, P_done_6_3, P_done_6_4, P_done_6_5, P_done_6_6, P_done_6_7, P_done_7_0, P_done_7_1, P_done_7_2, P_done_7_3, P_done_7_4, P_done_7_5, P_done_7_6, P_done_7_7, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_ifyi_15_5, P_ifyi_15_6, P_ifyi_15_7, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_awaity_5, P_awaity_6, P_awaity_7, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_CS_21_5, P_CS_21_6, P_CS_21_7, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4, P_setbi_24_5, P_setbi_24_6, P_setbi_24_7]
[2023-03-22 21:57:42] [INFO ] Parsed PT model containing 264 places and 536 transitions and 2352 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
FORMULA LamportFastMutEx-PT-7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 149 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 16 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:57:43] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 21:57:43] [INFO ] Computed 65 place invariants in 10 ms
[2023-03-22 21:57:43] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-22 21:57:43] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:57:43] [INFO ] Invariant cache hit.
[2023-03-22 21:57:43] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 21:57:43] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-22 21:57:43] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:57:43] [INFO ] Invariant cache hit.
[2023-03-22 21:57:43] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 712 ms. Remains : 219/219 places, 462/462 transitions.
Support contains 149 out of 219 places after structural reductions.
[2023-03-22 21:57:44] [INFO ] Flatten gal took : 70 ms
[2023-03-22 21:57:44] [INFO ] Flatten gal took : 62 ms
[2023-03-22 21:57:44] [INFO ] Input system was already deterministic with 462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 21:57:44] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:57:44] [INFO ] Invariant cache hit.
[2023-03-22 21:57:45] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2023-03-22 21:57:45] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-22 21:57:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 21:57:45] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-22 21:57:45] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 21:57:45] [INFO ] After 71ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-22 21:57:45] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 10 ms to minimize.
[2023-03-22 21:57:45] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-22 21:57:45] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2023-03-22 21:57:45] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2023-03-22 21:57:46] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-22 21:57:46] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-22 21:57:46] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-22 21:57:46] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-22 21:57:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 21:57:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 789 ms
[2023-03-22 21:57:46] [INFO ] After 887ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 21:57:46] [INFO ] After 1121ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 448
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 448
Applied a total of 28 rules in 62 ms. Remains 205 /219 variables (removed 14) and now considering 448/462 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 205/219 places, 448/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1126922 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1126922 steps, saw 478596 distinct states, run finished after 3002 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:57:49] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 21:57:49] [INFO ] Computed 65 place invariants in 11 ms
[2023-03-22 21:57:49] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 21:57:49] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:57:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 21:57:49] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:57:49] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 21:57:49] [INFO ] After 35ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:57:49] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-22 21:57:49] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 21 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 21:57:49] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:57:49] [INFO ] Invariant cache hit.
[2023-03-22 21:57:50] [INFO ] Implicit Places using invariants in 248 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 250 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 276 ms. Remains : 198/205 places, 448/448 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1127506 steps, run timeout after 3001 ms. (steps per millisecond=375 ) properties seen :{}
Probabilistic random walk after 1127506 steps, saw 479765 distinct states, run finished after 3002 ms. (steps per millisecond=375 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:57:53] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 21:57:53] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-22 21:57:53] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 21:57:53] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:57:53] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 21:57:53] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:57:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:57:53] [INFO ] After 78ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:57:53] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2023-03-22 21:57:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-22 21:57:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2023-03-22 21:57:53] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 21:57:53] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 14 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 21:57:53] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:57:53] [INFO ] Invariant cache hit.
[2023-03-22 21:57:54] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-22 21:57:54] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:57:54] [INFO ] Invariant cache hit.
[2023-03-22 21:57:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:57:54] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-22 21:57:54] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-22 21:57:54] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:57:54] [INFO ] Invariant cache hit.
[2023-03-22 21:57:54] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 745 ms. Remains : 198/198 places, 448/448 transitions.
Graph (trivial) has 208 edges and 198 vertex of which 59 / 198 are part of one of the 7 SCC in 3 ms
Free SCC test removed 52 places
Drop transitions removed 107 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 203 transitions.
Graph (complete) has 392 edges and 146 vertex of which 138 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 138 transition count 196
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 51 place count 138 transition count 147
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 191 place count 47 transition count 147
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 203 place count 41 transition count 141
Graph (trivial) has 18 edges and 41 vertex of which 17 / 41 are part of one of the 7 SCC in 0 ms
Free SCC test removed 10 places
Discarding 12 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Remove reverse transitions (loop back) rule discarded transition t449 and 12 places that fell out of Prefix Of Interest.
Iterating global reduction 1 with 2 rules applied. Total rules applied 205 place count 13 transition count 123
Drop transitions removed 17 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (trivial) has 37 edges and 13 vertex of which 6 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 1 with 55 rules applied. Total rules applied 260 place count 8 transition count 69
Drop transitions removed 30 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 314 place count 8 transition count 15
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 8 transition count 13
Applied a total of 316 rules in 21 ms. Remains 8 /198 variables (removed 190) and now considering 13/448 (removed 435) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-22 21:57:54] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 21:57:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 21:57:54] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:57:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 21:57:54] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:57:54] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-22 21:57:54] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA LamportFastMutEx-PT-7-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-7-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 7 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' '!(X(X(F((G(F(!p0))||(p1&&F(!p0)))))))'
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:57:54] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 21:57:54] [INFO ] Computed 65 place invariants in 4 ms
[2023-03-22 21:57:55] [INFO ] Implicit Places using invariants in 177 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 180 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 597 ms :[p0, p0, p0, p0]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s21 1) (EQ s51 1)) (AND (EQ s17 1) (EQ s56 1)) (AND (EQ s22 1) (EQ s53 1)) (AND (EQ s16 1) (EQ s54 1)) (AND (EQ s22 1) (EQ s51 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7116 reset in 561 ms.
Product exploration explored 100000 steps with 7127 reset in 447 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, p0]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 185 ms :[p0, p0, p0, p0]
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:57:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:57:57] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:57:57] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-22 21:57:57] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:57:57] [INFO ] Invariant cache hit.
[2023-03-22 21:57:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:57:58] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-22 21:57:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:57:58] [INFO ] Invariant cache hit.
[2023-03-22 21:57:58] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0]
Finished random walk after 28 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 7127 reset in 406 ms.
Product exploration explored 100000 steps with 7149 reset in 397 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 170 ms :[p0, p0, p0, p0]
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 7 rules in 28 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:00] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 21:58:00] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:00] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:58:00] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 212/212 places, 462/462 transitions.
Support contains 28 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:00] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:00] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:58:00] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-22 21:58:00] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:00] [INFO ] Invariant cache hit.
[2023-03-22 21:58:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:01] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-22 21:58:01] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:01] [INFO ] Invariant cache hit.
[2023-03-22 21:58:01] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 635 ms. Remains : 212/212 places, 462/462 transitions.
Treatment of property LamportFastMutEx-PT-7-LTLFireability-00 finished in 6516 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' '!((!p0 U (G(!p0)||(!p0&&(G(!p1) U p2)))))'
Support contains 106 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 9 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:01] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 21:58:01] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 21:58:01] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 21:58:01] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:01] [INFO ] Invariant cache hit.
[2023-03-22 21:58:01] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 21:58:01] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2023-03-22 21:58:01] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-22 21:58:01] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:01] [INFO ] Invariant cache hit.
[2023-03-22 21:58:02] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 579 ms. Remains : 219/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (OR (NOT p2) p1), p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), p1]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (EQ s10 1) (EQ s37 1)) (AND (EQ s11 1) (EQ s43 1)) (AND (EQ s10 1) (EQ s39 1)) (AND (EQ s11 1) (EQ s41 1)) (AND (EQ s11 1) (EQ s39 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA LamportFastMutEx-PT-7-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-7-LTLFireability-03 finished in 798 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((p0&&F(p1))))'
Support contains 22 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:02] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:02] [INFO ] Invariant cache hit.
[2023-03-22 21:58:02] [INFO ] Implicit Places using invariants in 158 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 160 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 166 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (EQ s22 0) (EQ s60 0)) (OR (EQ s22 0) (EQ s58 0)) (OR (EQ s22 0) (EQ s64 0)) (OR (EQ s17 0) (EQ s61 0)) (OR (EQ s22 0) (EQ s62 0)) (OR (EQ s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-7-LTLFireability-04 finished in 307 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)||X(X(F(!p1)))) U (!p2 U (p3||G(!p2))))))'
Support contains 44 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:02] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:02] [INFO ] Invariant cache hit.
[2023-03-22 21:58:02] [INFO ] Implicit Places using invariants in 150 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 151 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 276 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p0) p1)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (OR (AND (EQ s10 1) (EQ s37 1)) (AND (EQ s11 1) (EQ s43 1)) (AND (EQ s10 1) (EQ s39 1)) (AND (EQ s11 1) (EQ s41 1)) (AND (EQ s11 1) (EQ s39 1...], 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 15705 reset in 949 ms.
Product exploration explored 100000 steps with 15821 reset in 1001 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 779 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:58:06] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:06] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-22 21:58:06] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:58:06] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 21:58:06] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:07] [INFO ] After 349ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:07] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-22 21:58:07] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-22 21:58:07] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2023-03-22 21:58:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 322 ms
[2023-03-22 21:58:07] [INFO ] After 1043ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 349 ms.
[2023-03-22 21:58:08] [INFO ] After 1927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Applied a total of 14 rules in 13 ms. Remains 205 /212 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 205/212 places, 455/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1173592 steps, run timeout after 3001 ms. (steps per millisecond=391 ) properties seen :{}
Probabilistic random walk after 1173592 steps, saw 500233 distinct states, run finished after 3001 ms. (steps per millisecond=391 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:58:11] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 21:58:11] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-22 21:58:11] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:58:11] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 21:58:12] [INFO ] After 473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:12] [INFO ] After 367ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:12] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 380 ms.
[2023-03-22 21:58:13] [INFO ] After 1656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:58:13] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:58:13] [INFO ] Invariant cache hit.
[2023-03-22 21:58:13] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-22 21:58:13] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:58:13] [INFO ] Invariant cache hit.
[2023-03-22 21:58:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:13] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-22 21:58:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 21:58:13] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:58:13] [INFO ] Invariant cache hit.
[2023-03-22 21:58:13] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 32 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 21:58:13] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-22 21:58:14] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:58:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 21:58:14] [INFO ] After 408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:14] [INFO ] After 745ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-22 21:58:15] [INFO ] After 1121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND p1 p2 (NOT p0) (NOT p3))), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 821 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 263 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:16] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:16] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 21:58:16] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-22 21:58:16] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:16] [INFO ] Invariant cache hit.
[2023-03-22 21:58:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:16] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-22 21:58:16] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:16] [INFO ] Invariant cache hit.
[2023-03-22 21:58:17] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND p2 (NOT p0) (NOT p3))), (X (AND p2 (NOT p3))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 696 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:58:18] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:18] [INFO ] Invariant cache hit.
[2023-03-22 21:58:18] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:58:18] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 21:58:19] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:19] [INFO ] After 391ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:19] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 0 ms to minimize.
[2023-03-22 21:58:19] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 21:58:20] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-22 21:58:21] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 21:58:21] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-22 21:58:21] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2023-03-22 21:58:21] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1584 ms
[2023-03-22 21:58:21] [INFO ] After 2327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 369 ms.
[2023-03-22 21:58:21] [INFO ] After 3258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Applied a total of 14 rules in 19 ms. Remains 205 /212 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 205/212 places, 455/462 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 919476 steps, run timeout after 3001 ms. (steps per millisecond=306 ) properties seen :{}
Probabilistic random walk after 919476 steps, saw 403317 distinct states, run finished after 3002 ms. (steps per millisecond=306 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:58:24] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 21:58:24] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-22 21:58:25] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:58:25] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 21:58:25] [INFO ] After 460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:25] [INFO ] After 350ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:26] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2023-03-22 21:58:26] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-22 21:58:26] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-22 21:58:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-22 21:58:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 402 ms
[2023-03-22 21:58:26] [INFO ] After 1106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-22 21:58:27] [INFO ] After 2002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:58:27] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:58:27] [INFO ] Invariant cache hit.
[2023-03-22 21:58:27] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-22 21:58:27] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:58:27] [INFO ] Invariant cache hit.
[2023-03-22 21:58:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:27] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-22 21:58:27] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 21:58:27] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:58:27] [INFO ] Invariant cache hit.
[2023-03-22 21:58:27] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 618 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 15 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 21:58:27] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 21:58:27] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:58:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 21:58:28] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:58:28] [INFO ] After 749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 324 ms.
[2023-03-22 21:58:28] [INFO ] After 1119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND p2 (NOT p0) (NOT p3))), (X (AND p2 (NOT p3))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3) p1)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 800 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 240 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 258 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 15730 reset in 824 ms.
Product exploration explored 100000 steps with 15627 reset in 823 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 266 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 7 rules in 15 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 21:58:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:32] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:58:32] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 212/212 places, 462/462 transitions.
Support contains 44 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:32] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:58:32] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-22 21:58:32] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:32] [INFO ] Invariant cache hit.
[2023-03-22 21:58:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:33] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-22 21:58:33] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:33] [INFO ] Invariant cache hit.
[2023-03-22 21:58:33] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 212/212 places, 462/462 transitions.
Treatment of property LamportFastMutEx-PT-7-LTLFireability-05 finished in 30761 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(F((G(p1)||p0))))'
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:33] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 21:58:33] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 21:58:33] [INFO ] Implicit Places using invariants in 168 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 169 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (AND (EQ s8 1) (EQ s65 1)) (AND (EQ s9 1) (EQ s66 1)) (AND (EQ s10 1) (EQ s67 1)) (AND (EQ s11 1) (EQ s68 1)) (AND (EQ s12 1) (EQ s69 1)) (AND (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4143 reset in 307 ms.
Product exploration explored 100000 steps with 4122 reset in 313 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 21:58:34] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:34] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:58:35] [INFO ] [Real]Absence check using 58 positive place invariants in 45 ms returned sat
[2023-03-22 21:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:35] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2023-03-22 21:58:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:58:35] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-22 21:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:35] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-22 21:58:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:35] [INFO ] [Nat]Added 42 Read/Feed constraints in 21 ms returned sat
[2023-03-22 21:58:35] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2023-03-22 21:58:36] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-03-22 21:58:37] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 0 ms to minimize.
[2023-03-22 21:58:37] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-03-22 21:58:37] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 21:58:37] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1353 ms
[2023-03-22 21:58:37] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 27 ms.
[2023-03-22 21:58:38] [INFO ] Added : 228 causal constraints over 46 iterations in 1529 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:38] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:38] [INFO ] Invariant cache hit.
[2023-03-22 21:58:38] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-22 21:58:38] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:38] [INFO ] Invariant cache hit.
[2023-03-22 21:58:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:39] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-22 21:58:39] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:39] [INFO ] Invariant cache hit.
[2023-03-22 21:58:39] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 90 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 21:58:40] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:40] [INFO ] Invariant cache hit.
[2023-03-22 21:58:40] [INFO ] [Real]Absence check using 58 positive place invariants in 23 ms returned sat
[2023-03-22 21:58:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:40] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-22 21:58:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:58:40] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2023-03-22 21:58:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:40] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-22 21:58:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 17 ms returned sat
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2023-03-22 21:58:41] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 21:58:42] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1758 ms
[2023-03-22 21:58:42] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 25 ms.
[2023-03-22 21:58:44] [INFO ] Added : 254 causal constraints over 52 iterations in 1784 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4126 reset in 319 ms.
Product exploration explored 100000 steps with 4131 reset in 333 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 9 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:45] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 21:58:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:45] [INFO ] Invariant cache hit.
[2023-03-22 21:58:45] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 212/212 places, 462/462 transitions.
Support contains 21 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:45] [INFO ] Invariant cache hit.
[2023-03-22 21:58:45] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-22 21:58:45] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:45] [INFO ] Invariant cache hit.
[2023-03-22 21:58:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:46] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-22 21:58:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:46] [INFO ] Invariant cache hit.
[2023-03-22 21:58:46] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 212/212 places, 462/462 transitions.
Treatment of property LamportFastMutEx-PT-7-LTLFireability-06 finished in 13017 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((p0&&F(p1)))))'
Support contains 36 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:46] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 21:58:46] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 21:58:46] [INFO ] Implicit Places using invariants in 159 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 160 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (OR (EQ s24 0) (EQ s205 0)) (OR (EQ s34 0) (EQ s210 0)) (OR (EQ s26 0) (EQ s206 0)) (OR (EQ s32 0) (EQ s209 0)) (OR (EQ s28 0) (EQ s207 0)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5145 reset in 326 ms.
Product exploration explored 100000 steps with 5141 reset in 334 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 47 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2023-03-22 21:58:48] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:48] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 21:58:48] [INFO ] [Real]Absence check using 58 positive place invariants in 25 ms returned sat
[2023-03-22 21:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:48] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-03-22 21:58:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:58:48] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-22 21:58:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:49] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-22 21:58:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 4 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-22 21:58:49] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-22 21:58:50] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-22 21:58:50] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2023-03-22 21:58:50] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1054 ms
[2023-03-22 21:58:50] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-22 21:58:51] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-22 21:58:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-22 21:58:51] [INFO ] Added : 231 causal constraints over 48 iterations in 1600 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:51] [INFO ] Invariant cache hit.
[2023-03-22 21:58:51] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-22 21:58:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:51] [INFO ] Invariant cache hit.
[2023-03-22 21:58:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:52] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-22 21:58:52] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:52] [INFO ] Invariant cache hit.
[2023-03-22 21:58:52] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 212/212 places, 462/462 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 149 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 274 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2023-03-22 21:58:53] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:53] [INFO ] Invariant cache hit.
[2023-03-22 21:58:53] [INFO ] [Real]Absence check using 58 positive place invariants in 24 ms returned sat
[2023-03-22 21:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:53] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-22 21:58:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:58:54] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2023-03-22 21:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:58:54] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-22 21:58:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:54] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 0 ms to minimize.
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-22 21:58:54] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2023-03-22 21:58:55] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1638 ms
[2023-03-22 21:58:55] [INFO ] Computed and/alt/rep : 301/1722/301 causal constraints (skipped 28 transitions) in 30 ms.
[2023-03-22 21:58:57] [INFO ] Added : 202 causal constraints over 41 iterations in 1302 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 5086 reset in 328 ms.
Product exploration explored 100000 steps with 5140 reset in 337 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 462
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 7 rules in 13 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 21:58:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:58] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 21:58:58] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 212/212 places, 462/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 229 ms. Remains : 212/212 places, 462/462 transitions.
Support contains 36 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 212 cols
[2023-03-22 21:58:58] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 21:58:58] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-22 21:58:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:58] [INFO ] Invariant cache hit.
[2023-03-22 21:58:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:58:58] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-22 21:58:58] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:58:58] [INFO ] Invariant cache hit.
[2023-03-22 21:58:59] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 212/212 places, 462/462 transitions.
Treatment of property LamportFastMutEx-PT-7-LTLFireability-07 finished in 12805 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(F(((!p0&&X(!p1))||G(!p1)))))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:58:59] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 21:58:59] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 21:58:59] [INFO ] Implicit Places using invariants in 168 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 169 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 108 ms :[p1, p1, p1]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s36 1) (EQ s78 1)), p1:(AND (EQ s9 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 236 ms.
Product exploration explored 100000 steps with 33333 reset in 244 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 9 factoid took 257 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LamportFastMutEx-PT-7-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LamportFastMutEx-PT-7-LTLFireability-08 finished in 1045 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(p0)))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:59:00] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:59:00] [INFO ] Invariant cache hit.
[2023-03-22 21:59:00] [INFO ] Implicit Places using invariants in 169 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 170 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s16 1) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-7-LTLFireability-09 finished in 269 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))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:59:00] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
[2023-03-22 21:59:00] [INFO ] Invariant cache hit.
[2023-03-22 21:59:00] [INFO ] Implicit Places using invariants in 177 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 178 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Applied a total of 0 rules in 1 ms. Remains 212 /212 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 183 ms. Remains : 212/219 places, 462/462 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s18 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA LamportFastMutEx-PT-7-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LamportFastMutEx-PT-7-LTLFireability-12 finished in 332 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(F((G(F(!p0))||(p1&&F(!p0)))))))'
Found a Shortening insensitive property : LamportFastMutEx-PT-7-LTLFireability-00
Stuttering acceptance computed with spot in 173 ms :[p0, p0, p0, p0]
Support contains 28 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 24 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 21:59:01] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 21:59:01] [INFO ] Computed 65 place invariants in 2 ms
[2023-03-22 21:59:01] [INFO ] Implicit Places using invariants in 143 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 144 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 6 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2023-03-22 21:59:01] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 21:59:01] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:59:01] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-22 21:59:01] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:01] [INFO ] Invariant cache hit.
[2023-03-22 21:59:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:01] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 620 ms. Remains : 198/219 places, 448/462 transitions.
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s21 1) (EQ s51 1)) (AND (EQ s17 1) (EQ s56 1)) (AND (EQ s22 1) (EQ s53 1)) (AND (EQ s16 1) (EQ s54 1)) (AND (EQ s22 1) (EQ s51 1)) (AND (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7150 reset in 383 ms.
Product exploration explored 100000 steps with 7156 reset in 397 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0, p0]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 146 ms :[p0, p0, p0, p0]
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 21:59:03] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:03] [INFO ] Invariant cache hit.
[2023-03-22 21:59:03] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-22 21:59:03] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:03] [INFO ] Invariant cache hit.
[2023-03-22 21:59:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:03] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-22 21:59:03] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:03] [INFO ] Invariant cache hit.
[2023-03-22 21:59:03] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 198/198 places, 448/448 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p0, p0, p0, p0]
Finished random walk after 152 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=76 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 135 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 7138 reset in 390 ms.
Product exploration explored 100000 steps with 7105 reset in 386 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, p0, p0]
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 21:59:05] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 21:59:05] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:05] [INFO ] Invariant cache hit.
[2023-03-22 21:59:06] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 198/198 places, 448/448 transitions.
Support contains 28 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 21:59:06] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:06] [INFO ] Invariant cache hit.
[2023-03-22 21:59:06] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-22 21:59:06] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:06] [INFO ] Invariant cache hit.
[2023-03-22 21:59:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:06] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-22 21:59:06] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:06] [INFO ] Invariant cache hit.
[2023-03-22 21:59:06] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 198/198 places, 448/448 transitions.
Treatment of property LamportFastMutEx-PT-7-LTLFireability-00 finished in 5916 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)||X(X(F(!p1)))) U (!p2 U (p3||G(!p2))))))'
Found a Shortening insensitive property : LamportFastMutEx-PT-7-LTLFireability-05
Stuttering acceptance computed with spot in 260 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p0) p1)]
Support contains 44 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 14 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 21:59:07] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 21:59:07] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 21:59:07] [INFO ] Implicit Places using invariants in 145 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 146 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 163 ms. Remains : 205/219 places, 455/462 transitions.
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (OR (AND (EQ s10 1) (EQ s37 1)) (AND (EQ s11 1) (EQ s43 1)) (AND (EQ s10 1) (EQ s39 1)) (AND (EQ s11 1) (EQ s41 1)) (AND (EQ s11 1) (EQ s39 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15756 reset in 944 ms.
Product exploration explored 100000 steps with 15870 reset in 944 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 624 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:59:10] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 21:59:10] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-22 21:59:10] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:59:10] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 21:59:10] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:11] [INFO ] After 349ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:11] [INFO ] After 716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 366 ms.
[2023-03-22 21:59:12] [INFO ] After 1643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 455/455 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1143875 steps, run timeout after 3001 ms. (steps per millisecond=381 ) properties seen :{}
Probabilistic random walk after 1143875 steps, saw 488672 distinct states, run finished after 3001 ms. (steps per millisecond=381 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:59:15] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:15] [INFO ] Invariant cache hit.
[2023-03-22 21:59:15] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:59:15] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 21:59:15] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:16] [INFO ] After 363ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:16] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 357 ms.
[2023-03-22 21:59:16] [INFO ] After 1637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:59:16] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:16] [INFO ] Invariant cache hit.
[2023-03-22 21:59:17] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-22 21:59:17] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:17] [INFO ] Invariant cache hit.
[2023-03-22 21:59:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:17] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2023-03-22 21:59:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 21:59:17] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:17] [INFO ] Invariant cache hit.
[2023-03-22 21:59:17] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 613 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 13 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 21:59:17] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 21:59:17] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:59:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 21:59:18] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:18] [INFO ] After 758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-22 21:59:18] [INFO ] After 1124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) p2 (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND p1 p2 (NOT p0) (NOT p3))), (F (AND (NOT p2) (NOT p0) (NOT p3))), (F (AND p2 (NOT p0) (NOT p3))), (F (AND p2 (NOT p3))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 950 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 231 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:59:20] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 21:59:20] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 21:59:20] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-22 21:59:20] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:20] [INFO ] Invariant cache hit.
[2023-03-22 21:59:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:20] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-22 21:59:20] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:20] [INFO ] Invariant cache hit.
[2023-03-22 21:59:20] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 205/205 places, 455/455 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND p2 (NOT p0) (NOT p3))), (X (AND p2 (NOT p3))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 636 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:59:21] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:21] [INFO ] Invariant cache hit.
[2023-03-22 21:59:22] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:59:22] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 21:59:22] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:22] [INFO ] After 346ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:23] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2023-03-22 21:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-22 21:59:23] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 348 ms.
[2023-03-22 21:59:23] [INFO ] After 1643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 205/205 places, 455/455 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 930863 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 930863 steps, saw 407649 distinct states, run finished after 3002 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 21:59:26] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:26] [INFO ] Invariant cache hit.
[2023-03-22 21:59:27] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:59:27] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 21:59:27] [INFO ] After 463ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:27] [INFO ] After 353ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:28] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2023-03-22 21:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-22 21:59:28] [INFO ] After 755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 347 ms.
[2023-03-22 21:59:28] [INFO ] After 1647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:59:28] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:28] [INFO ] Invariant cache hit.
[2023-03-22 21:59:28] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-22 21:59:28] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:28] [INFO ] Invariant cache hit.
[2023-03-22 21:59:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:29] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-22 21:59:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 21:59:29] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:29] [INFO ] Invariant cache hit.
[2023-03-22 21:59:29] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 613 ms. Remains : 205/205 places, 455/455 transitions.
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 205 transition count 329
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 126 place count 205 transition count 280
Deduced a syphon composed of 49 places in 0 ms
Ensure Unique test removed 42 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 1 with 140 rules applied. Total rules applied 266 place count 114 transition count 280
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 280 place count 107 transition count 273
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 287 place count 100 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 294 place count 100 transition count 259
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 301 place count 100 transition count 252
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 308 place count 93 transition count 252
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 93 transition count 252
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 322 place count 93 transition count 245
Applied a total of 322 rules in 19 ms. Remains 93 /205 variables (removed 112) and now considering 245/455 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 245 rows 93 cols
[2023-03-22 21:59:29] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-22 21:59:29] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 21:59:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-22 21:59:29] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 21:59:30] [INFO ] After 762ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 330 ms.
[2023-03-22 21:59:30] [INFO ] After 1132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND p2 (NOT p0) (NOT p3))), (X (AND p2 (NOT p3))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p0) (NOT p3)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3) p1)), (F (AND (NOT p0) (NOT p2) (NOT p3))), (F (AND (NOT p0) p2 (NOT p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 849 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 282 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 264 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 15867 reset in 797 ms.
Product exploration explored 100000 steps with 15715 reset in 796 ms.
Applying partial POR strategy [false, true, false, false, true, true]
Stuttering acceptance computed with spot in 364 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p1 p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p1), (AND (NOT p0) p1 p2 (NOT p3)), (AND (NOT p0) p1)]
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:59:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 21:59:34] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 21:59:34] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:59:34] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 205/205 places, 455/455 transitions.
Support contains 44 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:59:34] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:34] [INFO ] Invariant cache hit.
[2023-03-22 21:59:34] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-22 21:59:34] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:34] [INFO ] Invariant cache hit.
[2023-03-22 21:59:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:34] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-22 21:59:34] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:34] [INFO ] Invariant cache hit.
[2023-03-22 21:59:35] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 565 ms. Remains : 205/205 places, 455/455 transitions.
Treatment of property LamportFastMutEx-PT-7-LTLFireability-05 finished in 28375 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(F((G(p1)||p0))))'
Found a Shortening insensitive property : LamportFastMutEx-PT-7-LTLFireability-06
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 21 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2023-03-22 21:59:35] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 21:59:35] [INFO ] Computed 65 place invariants in 1 ms
[2023-03-22 21:59:35] [INFO ] Implicit Places using invariants in 177 ms returned [135, 136, 137, 138, 139, 140, 141]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 178 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 212/219 places, 462/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 212 transition count 455
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 455
Applied a total of 14 rules in 6 ms. Remains 205 /212 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 21:59:35] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 205 cols
[2023-03-22 21:59:35] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-22 21:59:35] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-22 21:59:35] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:35] [INFO ] Invariant cache hit.
[2023-03-22 21:59:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:35] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 205/219 places, 455/462 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 693 ms. Remains : 205/219 places, 455/462 transitions.
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (AND (EQ s8 1) (EQ s65 1)) (AND (EQ s9 1) (EQ s66 1)) (AND (EQ s10 1) (EQ s67 1)) (AND (EQ s11 1) (EQ s68 1)) (AND (EQ s12 1) (EQ s69 1)) (AND (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4139 reset in 308 ms.
Product exploration explored 100000 steps with 4140 reset in 318 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 268 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=67 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 21:59:37] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:37] [INFO ] Invariant cache hit.
[2023-03-22 21:59:37] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-22 21:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:59:37] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-22 21:59:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:59:37] [INFO ] [Nat]Absence check using 58 positive place invariants in 21 ms returned sat
[2023-03-22 21:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:59:37] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-22 21:59:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:37] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 0 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-22 21:59:38] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 0 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 0 ms to minimize.
[2023-03-22 21:59:39] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1902 ms
[2023-03-22 21:59:39] [INFO ] Computed and/alt/rep : 287/1617/287 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 21:59:41] [INFO ] Added : 250 causal constraints over 50 iterations in 1742 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 21 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:59:41] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:41] [INFO ] Invariant cache hit.
[2023-03-22 21:59:41] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-22 21:59:41] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:41] [INFO ] Invariant cache hit.
[2023-03-22 21:59:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:42] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-22 21:59:42] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:42] [INFO ] Invariant cache hit.
[2023-03-22 21:59:42] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 205/205 places, 455/455 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 21:59:42] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:43] [INFO ] Invariant cache hit.
[2023-03-22 21:59:43] [INFO ] [Real]Absence check using 58 positive place invariants in 21 ms returned sat
[2023-03-22 21:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:59:43] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-22 21:59:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:59:43] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-22 21:59:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:59:43] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2023-03-22 21:59:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2023-03-22 21:59:43] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
[2023-03-22 21:59:43] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-22 21:59:44] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 0 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 0 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 0 ms to minimize.
[2023-03-22 21:59:45] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1918 ms
[2023-03-22 21:59:45] [INFO ] Computed and/alt/rep : 287/1617/287 causal constraints (skipped 35 transitions) in 23 ms.
[2023-03-22 21:59:47] [INFO ] Added : 250 causal constraints over 50 iterations in 1683 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4145 reset in 331 ms.
Product exploration explored 100000 steps with 4146 reset in 340 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 21 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:59:48] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 21:59:48] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:48] [INFO ] Invariant cache hit.
[2023-03-22 21:59:48] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 205/205 places, 455/455 transitions.
Support contains 21 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 455/455 transitions.
Applied a total of 0 rules in 1 ms. Remains 205 /205 variables (removed 0) and now considering 455/455 (removed 0) transitions.
[2023-03-22 21:59:48] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:48] [INFO ] Invariant cache hit.
[2023-03-22 21:59:48] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-22 21:59:48] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:48] [INFO ] Invariant cache hit.
[2023-03-22 21:59:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:49] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2023-03-22 21:59:49] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
[2023-03-22 21:59:49] [INFO ] Invariant cache hit.
[2023-03-22 21:59:49] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 731 ms. Remains : 205/205 places, 455/455 transitions.
Treatment of property LamportFastMutEx-PT-7-LTLFireability-06 finished in 14204 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((p0&&F(p1)))))'
Found a Lengthening insensitive property : LamportFastMutEx-PT-7-LTLFireability-07
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 36 out of 219 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 11 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
[2023-03-22 21:59:49] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 21:59:49] [INFO ] Computed 65 place invariants in 2 ms
[2023-03-22 21:59:49] [INFO ] Implicit Places using invariants in 148 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 149 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 205/219 places, 455/462 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 205 transition count 448
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 198 transition count 448
Applied a total of 14 rules in 5 ms. Remains 198 /205 variables (removed 7) and now considering 448/455 (removed 7) transitions.
[2023-03-22 21:59:49] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 21:59:49] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 21:59:49] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-22 21:59:49] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:49] [INFO ] Invariant cache hit.
[2023-03-22 21:59:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:50] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 198/219 places, 448/462 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 617 ms. Remains : 198/219 places, 448/462 transitions.
Running random walk in product with property : LamportFastMutEx-PT-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (OR (EQ s24 0) (EQ s191 0)) (OR (EQ s34 0) (EQ s196 0)) (OR (EQ s26 0) (EQ s192 0)) (OR (EQ s32 0) (EQ s195 0)) (OR (EQ s28 0) (EQ s193 0)) (O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5093 reset in 328 ms.
Product exploration explored 100000 steps with 5124 reset in 345 ms.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 426 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 97 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 331 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2023-03-22 21:59:52] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:52] [INFO ] Invariant cache hit.
[2023-03-22 21:59:52] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2023-03-22 21:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:59:52] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-03-22 21:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:59:52] [INFO ] [Nat]Absence check using 58 positive place invariants in 17 ms returned sat
[2023-03-22 21:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:59:52] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-22 21:59:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:52] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2023-03-22 21:59:52] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 21:59:52] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2023-03-22 21:59:52] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-22 21:59:52] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2023-03-22 21:59:53] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-22 21:59:53] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 21:59:53] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2023-03-22 21:59:53] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2023-03-22 21:59:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 579 ms
[2023-03-22 21:59:53] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 21:59:54] [INFO ] Added : 220 causal constraints over 44 iterations in 1341 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 36 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 21:59:54] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:54] [INFO ] Invariant cache hit.
[2023-03-22 21:59:54] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-22 21:59:54] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:54] [INFO ] Invariant cache hit.
[2023-03-22 21:59:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:55] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-22 21:59:55] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:55] [INFO ] Invariant cache hit.
[2023-03-22 21:59:55] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 652 ms. Remains : 198/198 places, 448/448 transitions.
Computed a total of 1 stabilizing places and 7 stable transitions
Computed a total of 1 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Finished random walk after 101 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 320 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
[2023-03-22 21:59:56] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 21:59:56] [INFO ] Invariant cache hit.
[2023-03-22 21:59:56] [INFO ] [Real]Absence check using 58 positive place invariants in 21 ms returned sat
[2023-03-22 21:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:59:56] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-22 21:59:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:59:56] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-22 21:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:59:57] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-22 21:59:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 21:59:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2023-03-22 21:59:57] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 21:59:57] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-22 21:59:57] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-22 21:59:57] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-22 21:59:57] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-22 21:59:57] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-22 21:59:57] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2023-03-22 21:59:57] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2023-03-22 21:59:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 570 ms
[2023-03-22 21:59:57] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 23 ms.
[2023-03-22 21:59:59] [INFO ] Added : 220 causal constraints over 44 iterations in 1373 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 5128 reset in 323 ms.
Product exploration explored 100000 steps with 5122 reset in 327 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 36 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 22:00:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 22:00:00] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 22:00:00] [INFO ] Invariant cache hit.
[2023-03-22 22:00:00] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 198/198 places, 448/448 transitions.
Support contains 36 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 22:00:00] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 22:00:00] [INFO ] Invariant cache hit.
[2023-03-22 22:00:00] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-22 22:00:00] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 22:00:00] [INFO ] Invariant cache hit.
[2023-03-22 22:00:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 22:00:00] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-22 22:00:00] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 22:00:00] [INFO ] Invariant cache hit.
[2023-03-22 22:00:00] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 635 ms. Remains : 198/198 places, 448/448 transitions.
Treatment of property LamportFastMutEx-PT-7-LTLFireability-07 finished in 11716 ms.
[2023-03-22 22:00:01] [INFO ] Flatten gal took : 32 ms
[2023-03-22 22:00:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2023-03-22 22:00:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 219 places, 462 transitions and 2016 arcs took 2 ms.
Total runtime 138427 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3636/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3636/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 8637232 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16119680 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3636/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3636/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : LamportFastMutEx-PT-7-LTLFireability-00
Could not compute solution for formula : LamportFastMutEx-PT-7-LTLFireability-05
Could not compute solution for formula : LamportFastMutEx-PT-7-LTLFireability-06
Could not compute solution for formula : LamportFastMutEx-PT-7-LTLFireability-07
BK_STOP 1679523954564
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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 LamportFastMutEx-PT-7-LTLFireability-00
ltl formula formula --ltl=/tmp/3636/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 219 places, 462 transitions and 2016 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3636/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3636/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3636/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3636/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
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:
*** 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:
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:
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
ltl formula name LamportFastMutEx-PT-7-LTLFireability-05
ltl formula formula --ltl=/tmp/3636/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
pnml2lts-mc( 0/ 4): Petri net has 219 places, 462 transitions and 2016 arcs
Warning: program compiled against libxml 210 using older 209
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.060 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3636/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3636/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3636/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3636/ltl_1_
Killing (15) : 3649 3650 3651 3652 3653
Killing (9) : 3649 3650 3651 3652 3653
ltl formula name LamportFastMutEx-PT-7-LTLFireability-06
ltl formula formula --ltl=/tmp/3636/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 219 places, 462 transitions and 2016 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.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3636/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3636/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3636/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3636/ltl_2_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name LamportFastMutEx-PT-7-LTLFireability-07
ltl formula formula --ltl=/tmp/3636/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: =============================================================================
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 219 places, 462 transitions and 2016 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.060 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3636/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3636/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3636/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3636/ltl_3_
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="LamportFastMutEx-PT-7"
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 LamportFastMutEx-PT-7, 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 r233-tall-167856418900436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-7.tgz
mv LamportFastMutEx-PT-7 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 ;