About the Execution of LTSMin+red for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1058.396 | 3060912.00 | 3393615.00 | 8348.40 | ?FFF?FF??TFF?FTF | 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.r137-smll-167819418600484.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 DoubleExponent-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418600484
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K 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 DoubleExponent-PT-020-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-020-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678878739704
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=DoubleExponent-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 11:12:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 11:12:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 11:12:22] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-15 11:12:22] [INFO ] Transformed 1064 places.
[2023-03-15 11:12:22] [INFO ] Transformed 998 transitions.
[2023-03-15 11:12:22] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-020-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 169 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:12:23] [INFO ] Invariants computation overflowed in 225 ms
[2023-03-15 11:12:24] [INFO ] Implicit Places using invariants in 1047 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:12:24] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-15 11:12:25] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:12:25] [INFO ] Invariants computation overflowed in 154 ms
[2023-03-15 11:12:26] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1060/1064 places, 998/998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3053 ms. Remains : 1060/1064 places, 998/998 transitions.
Support contains 42 out of 1060 places after structural reductions.
[2023-03-15 11:12:26] [INFO ] Flatten gal took : 142 ms
[2023-03-15 11:12:26] [INFO ] Flatten gal took : 78 ms
[2023-03-15 11:12:26] [INFO ] Input system was already deterministic with 998 transitions.
Incomplete random walk after 10000 steps, including 332 resets, run finished after 869 ms. (steps per millisecond=11 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:12:28] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-15 11:12:33] [INFO ] After 3835ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:21
[2023-03-15 11:12:35] [INFO ] Deduced a trap composed of 25 places in 744 ms of which 9 ms to minimize.
[2023-03-15 11:12:36] [INFO ] Deduced a trap composed of 16 places in 682 ms of which 1 ms to minimize.
[2023-03-15 11:12:36] [INFO ] Deduced a trap composed of 18 places in 585 ms of which 2 ms to minimize.
[2023-03-15 11:12:37] [INFO ] Deduced a trap composed of 41 places in 621 ms of which 1 ms to minimize.
[2023-03-15 11:12:37] [INFO ] Deduced a trap composed of 139 places in 444 ms of which 2 ms to minimize.
[2023-03-15 11:12:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3606 ms
[2023-03-15 11:12:38] [INFO ] Deduced a trap composed of 235 places in 259 ms of which 1 ms to minimize.
[2023-03-15 11:12:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 477 ms
[2023-03-15 11:12:38] [INFO ] After 8797ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-15 11:12:38] [INFO ] After 10102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-15 11:12:52] [INFO ] After 12449ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-03-15 11:12:53] [INFO ] Deduced a trap composed of 127 places in 547 ms of which 1 ms to minimize.
[2023-03-15 11:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 690 ms
[2023-03-15 11:12:56] [INFO ] Deduced a trap composed of 139 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:12:57] [INFO ] Deduced a trap composed of 125 places in 422 ms of which 1 ms to minimize.
[2023-03-15 11:12:57] [INFO ] Deduced a trap composed of 113 places in 451 ms of which 1 ms to minimize.
[2023-03-15 11:12:58] [INFO ] Deduced a trap composed of 115 places in 488 ms of which 1 ms to minimize.
[2023-03-15 11:12:59] [INFO ] Deduced a trap composed of 89 places in 480 ms of which 1 ms to minimize.
[2023-03-15 11:12:59] [INFO ] Deduced a trap composed of 91 places in 529 ms of which 1 ms to minimize.
[2023-03-15 11:13:00] [INFO ] Deduced a trap composed of 103 places in 469 ms of which 1 ms to minimize.
[2023-03-15 11:13:01] [INFO ] Deduced a trap composed of 101 places in 539 ms of which 1 ms to minimize.
[2023-03-15 11:13:02] [INFO ] Deduced a trap composed of 77 places in 582 ms of which 1 ms to minimize.
[2023-03-15 11:13:03] [INFO ] Deduced a trap composed of 79 places in 717 ms of which 2 ms to minimize.
[2023-03-15 11:13:03] [INFO ] Deduced a trap composed of 65 places in 600 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:13:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:13:03] [INFO ] After 25067ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 1 properties in 30178 ms.
Support contains 33 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 212 rules applied. Total rules applied 213 place count 1057 transition count 787
Reduce places removed 209 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 218 rules applied. Total rules applied 431 place count 848 transition count 778
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 440 place count 839 transition count 778
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 440 place count 839 transition count 739
Deduced a syphon composed of 39 places in 13 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 518 place count 800 transition count 739
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 14 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 866 place count 626 transition count 565
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 11 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 936 place count 591 transition count 565
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 938 place count 591 transition count 563
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 940 place count 589 transition count 563
Free-agglomeration rule (complex) applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 1013 place count 589 transition count 490
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 1086 place count 516 transition count 490
Partial Free-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 1173 place count 516 transition count 490
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1174 place count 515 transition count 489
Applied a total of 1174 rules in 398 ms. Remains 515 /1060 variables (removed 545) and now considering 489/998 (removed 509) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 515/1060 places, 489/998 transitions.
Incomplete random walk after 10000 steps, including 1323 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 69 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 87808 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87808 steps, saw 43913 distinct states, run finished after 3005 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 489 rows 515 cols
[2023-03-15 11:13:39] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:13:39] [INFO ] After 574ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:20
[2023-03-15 11:13:39] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:13:41] [INFO ] After 1565ms SMT Verify possible using 73 Read/Feed constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-15 11:13:41] [INFO ] After 2524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-15 11:13:44] [INFO ] After 2523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-15 11:13:50] [INFO ] After 5765ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-15 11:13:51] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 1 ms to minimize.
[2023-03-15 11:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2023-03-15 11:13:52] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 1 ms to minimize.
[2023-03-15 11:13:52] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 0 ms to minimize.
[2023-03-15 11:13:52] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2023-03-15 11:13:52] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 1 ms to minimize.
[2023-03-15 11:13:52] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2023-03-15 11:13:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 937 ms
[2023-03-15 11:13:53] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2023-03-15 11:13:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-03-15 11:13:54] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 1 ms to minimize.
[2023-03-15 11:13:54] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 1 ms to minimize.
[2023-03-15 11:13:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2023-03-15 11:13:55] [INFO ] After 11130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 3903 ms.
[2023-03-15 11:13:59] [INFO ] After 18199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 30001 ms.
Support contains 33 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 489/489 transitions.
Applied a total of 0 rules in 39 ms. Remains 515 /515 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 515/515 places, 489/489 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 489/489 transitions.
Applied a total of 0 rules in 27 ms. Remains 515 /515 variables (removed 0) and now considering 489/489 (removed 0) transitions.
// Phase 1: matrix 489 rows 515 cols
[2023-03-15 11:14:29] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:14:30] [INFO ] Implicit Places using invariants in 604 ms returned []
// Phase 1: matrix 489 rows 515 cols
[2023-03-15 11:14:30] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 11:14:30] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-15 11:14:52] [INFO ] Implicit Places using invariants and state equation in 21929 ms returned [14, 310, 315, 338, 374, 396, 402, 423, 426, 430, 451, 479, 484, 507, 513]
Discarding 15 places :
Implicit Place search using SMT with State Equation took 22542 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 500/515 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 499 transition count 488
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 499 transition count 488
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 499 transition count 484
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 495 transition count 484
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 495 transition count 484
Applied a total of 15 rules in 90 ms. Remains 495 /500 variables (removed 5) and now considering 484/489 (removed 5) transitions.
// Phase 1: matrix 484 rows 495 cols
[2023-03-15 11:14:52] [INFO ] Computed 85 place invariants in 75 ms
[2023-03-15 11:14:53] [INFO ] Implicit Places using invariants in 1007 ms returned [44, 50, 72, 77, 128, 134, 163, 186, 191, 214, 220, 227, 250, 274, 281, 443, 471]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1010 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 478/515 places, 484/489 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 478 transition count 476
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 470 transition count 476
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 470 transition count 476
Applied a total of 18 rules in 68 ms. Remains 470 /478 variables (removed 8) and now considering 476/484 (removed 8) transitions.
// Phase 1: matrix 476 rows 470 cols
[2023-03-15 11:14:53] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-15 11:14:53] [INFO ] Implicit Places using invariants in 398 ms returned []
// Phase 1: matrix 476 rows 470 cols
[2023-03-15 11:14:53] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:14:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-15 11:15:24] [INFO ] Performed 456/470 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:15:24] [INFO ] Implicit Places using invariants and state equation in 30978 ms returned []
Implicit Place search using SMT with State Equation took 31380 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 470/515 places, 476/489 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55119 ms. Remains : 470/515 places, 476/489 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
FORMULA DoubleExponent-PT-020-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 U p1))))'
Support contains 3 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 52 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:15:25] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-15 11:15:25] [INFO ] Implicit Places using invariants in 588 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:15:25] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-15 11:15:26] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:15:27] [INFO ] Invariants computation overflowed in 98 ms
[2023-03-15 11:15:28] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2918 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s924 1) (LT s593 1)), p0:(GEQ s516 1)], 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 3345 reset in 489 ms.
Product exploration explored 100000 steps with 3341 reset in 305 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.15 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 328 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 143648 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143648 steps, saw 71849 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:15:33] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-15 11:15:36] [INFO ] After 3388ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-15 11:15:39] [INFO ] After 2865ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-15 11:15:40] [INFO ] Deduced a trap composed of 18 places in 685 ms of which 1 ms to minimize.
[2023-03-15 11:15:41] [INFO ] Deduced a trap composed of 45 places in 580 ms of which 1 ms to minimize.
[2023-03-15 11:15:42] [INFO ] Deduced a trap composed of 16 places in 590 ms of which 1 ms to minimize.
[2023-03-15 11:15:42] [INFO ] Deduced a trap composed of 127 places in 447 ms of which 1 ms to minimize.
[2023-03-15 11:15:43] [INFO ] Deduced a trap composed of 137 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:15:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3093 ms
[2023-03-15 11:15:43] [INFO ] After 6567ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-15 11:15:43] [INFO ] After 7001ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2002 ms.
Support contains 3 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1057 transition count 758
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 480 place count 819 transition count 758
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 480 place count 819 transition count 719
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 558 place count 780 transition count 719
Performed 185 Post agglomeration using F-continuation condition.Transition count delta: 185
Deduced a syphon composed of 185 places in 3 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 2 with 370 rules applied. Total rules applied 928 place count 595 transition count 534
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1002 place count 558 transition count 534
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 1081 place count 558 transition count 455
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 1160 place count 479 transition count 455
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1239 place count 479 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1240 place count 478 transition count 454
Applied a total of 1240 rules in 180 ms. Remains 478 /1060 variables (removed 582) and now considering 454/998 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 478/1060 places, 454/998 transitions.
Incomplete random walk after 10000 steps, including 1271 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 880 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 206393 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206393 steps, saw 103252 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 454 rows 478 cols
[2023-03-15 11:15:49] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:15:50] [INFO ] After 823ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 11:15:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:15:50] [INFO ] After 653ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-15 11:15:51] [INFO ] After 1545ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-15 11:15:51] [INFO ] After 2579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 838 ms.
Support contains 3 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 454/454 transitions.
Applied a total of 0 rules in 44 ms. Remains 478 /478 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 478/478 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 454/454 transitions.
Applied a total of 0 rules in 29 ms. Remains 478 /478 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 478 cols
[2023-03-15 11:15:52] [INFO ] Invariants computation overflowed in 139 ms
[2023-03-15 11:15:53] [INFO ] Implicit Places using invariants in 1082 ms returned []
// Phase 1: matrix 454 rows 478 cols
[2023-03-15 11:15:53] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:15:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:16:22] [INFO ] Implicit Places using invariants and state equation in 28403 ms returned [19, 44, 174, 200, 213, 227, 285, 310, 336, 341, 362, 368, 389, 391, 395, 416, 444, 449, 470, 476]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 29495 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 458/478 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 458 transition count 448
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 452 transition count 448
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 452 transition count 448
Applied a total of 20 rules in 44 ms. Remains 452 /458 variables (removed 6) and now considering 448/454 (removed 6) transitions.
// Phase 1: matrix 448 rows 452 cols
[2023-03-15 11:16:22] [INFO ] Computed 80 place invariants in 53 ms
[2023-03-15 11:16:24] [INFO ] Implicit Places using invariants in 1777 ms returned [47, 67, 72, 93, 98, 118, 124, 145, 150, 151, 175, 201, 226, 249, 255, 282, 306, 402, 430]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1782 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 433/478 places, 448/454 transitions.
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 433 transition count 435
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 26 place count 420 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 420 transition count 435
Applied a total of 27 rules in 39 ms. Remains 420 /433 variables (removed 13) and now considering 435/448 (removed 13) transitions.
// Phase 1: matrix 435 rows 420 cols
[2023-03-15 11:16:24] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:16:24] [INFO ] Implicit Places using invariants in 642 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-15 11:16:24] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:16:25] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:16:50] [INFO ] Implicit Places using invariants and state equation in 25796 ms returned []
Implicit Place search using SMT with State Equation took 26444 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 420/478 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57834 ms. Remains : 420/478 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1399 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 895 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 207786 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207786 steps, saw 103915 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 435 rows 420 cols
[2023-03-15 11:16:54] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:16:54] [INFO ] After 732ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 11:16:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:16:56] [INFO ] After 1110ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:16:56] [INFO ] After 1955ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:16:56] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 11:16:57] [INFO ] After 510ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 11:16:57] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-15 11:16:57] [INFO ] After 1471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 762 ms.
Support contains 3 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 19 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 420/420 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 435/435 transitions.
Applied a total of 0 rules in 18 ms. Remains 420 /420 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 420 cols
[2023-03-15 11:16:58] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:16:59] [INFO ] Implicit Places using invariants in 816 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-15 11:16:59] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:16:59] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:17:25] [INFO ] Implicit Places using invariants and state equation in 26064 ms returned []
Implicit Place search using SMT with State Equation took 26886 ms to find 0 implicit places.
[2023-03-15 11:17:25] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 435 rows 420 cols
[2023-03-15 11:17:25] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:17:25] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27324 ms. Remains : 420/420 places, 435/435 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 370 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1060 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 75 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:17:26] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-15 11:17:26] [INFO ] Implicit Places using invariants in 697 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:17:27] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-15 11:17:55] [INFO ] Implicit Places using invariants and state equation in 28234 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 28934 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 186 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:17:55] [INFO ] Invariants computation overflowed in 176 ms
[2023-03-15 11:17:56] [INFO ] Implicit Places using invariants in 978 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:17:56] [INFO ] Invariants computation overflowed in 144 ms
[2023-03-15 11:17:57] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31349 ms. Remains : 1057/1060 places, 997/998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 197162 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197162 steps, saw 98595 distinct states, run finished after 3003 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:18:01] [INFO ] Invariants computation overflowed in 197 ms
[2023-03-15 11:18:03] [INFO ] After 2606ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:18:04] [INFO ] Deduced a trap composed of 39 places in 626 ms of which 2 ms to minimize.
[2023-03-15 11:18:05] [INFO ] Deduced a trap composed of 18 places in 617 ms of which 1 ms to minimize.
[2023-03-15 11:18:06] [INFO ] Deduced a trap composed of 115 places in 488 ms of which 1 ms to minimize.
[2023-03-15 11:18:06] [INFO ] Deduced a trap composed of 113 places in 417 ms of which 1 ms to minimize.
[2023-03-15 11:18:07] [INFO ] Deduced a trap composed of 145 places in 369 ms of which 0 ms to minimize.
[2023-03-15 11:18:07] [INFO ] Deduced a trap composed of 174 places in 359 ms of which 2 ms to minimize.
[2023-03-15 11:18:07] [INFO ] Deduced a trap composed of 150 places in 425 ms of which 1 ms to minimize.
[2023-03-15 11:18:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3911 ms
[2023-03-15 11:18:08] [INFO ] After 6791ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:18:08] [INFO ] After 7031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:18:10] [INFO ] After 2517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:18:11] [INFO ] Deduced a trap composed of 42 places in 680 ms of which 2 ms to minimize.
[2023-03-15 11:18:12] [INFO ] Deduced a trap composed of 18 places in 690 ms of which 2 ms to minimize.
[2023-03-15 11:18:13] [INFO ] Deduced a trap composed of 113 places in 595 ms of which 1 ms to minimize.
[2023-03-15 11:18:13] [INFO ] Deduced a trap composed of 115 places in 649 ms of which 2 ms to minimize.
[2023-03-15 11:18:14] [INFO ] Deduced a trap composed of 127 places in 623 ms of which 1 ms to minimize.
[2023-03-15 11:18:15] [INFO ] Deduced a trap composed of 142 places in 564 ms of which 1 ms to minimize.
[2023-03-15 11:18:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4338 ms
[2023-03-15 11:18:15] [INFO ] After 6990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-15 11:18:15] [INFO ] After 7336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 484 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 1055 transition count 754
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 484 place count 814 transition count 754
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 484 place count 814 transition count 713
Deduced a syphon composed of 41 places in 16 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 566 place count 773 transition count 713
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 7 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 930 place count 591 transition count 531
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1006 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 1083 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 1160 place count 476 transition count 454
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 3 with 79 rules applied. Total rules applied 1239 place count 476 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1240 place count 475 transition count 453
Applied a total of 1240 rules in 271 ms. Remains 475 /1057 variables (removed 582) and now considering 453/997 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 475/1057 places, 453/997 transitions.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 320526 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 320526 steps, saw 160348 distinct states, run finished after 3003 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:18:19] [INFO ] Computed 99 place invariants in 75 ms
[2023-03-15 11:18:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 11:18:19] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 46 ms returned sat
[2023-03-15 11:18:19] [INFO ] After 363ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:18:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:18:20] [INFO ] After 273ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:18:20] [INFO ] After 781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:18:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:18:20] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 47 ms returned sat
[2023-03-15 11:18:20] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:18:21] [INFO ] After 679ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:18:21] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-15 11:18:21] [INFO ] After 1332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 13 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-15 11:18:21] [INFO ] Invariant cache hit.
[2023-03-15 11:18:24] [INFO ] Implicit Places using invariants in 2358 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 2364 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 437 transition count 435
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 419 transition count 435
Applied a total of 37 rules in 55 ms. Remains 419 /437 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:18:24] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:18:24] [INFO ] Implicit Places using invariants in 618 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:18:24] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 11:18:25] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:18:44] [INFO ] Implicit Places using invariants and state equation in 19644 ms returned []
Implicit Place search using SMT with State Equation took 20264 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22696 ms. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 296715 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296715 steps, saw 148387 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:18:47] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:18:48] [INFO ] After 501ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:18:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:18:48] [INFO ] After 343ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:18:48] [INFO ] After 949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:18:49] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:18:49] [INFO ] After 153ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:18:49] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 11:18:49] [INFO ] After 899ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 130 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 20 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 16 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:18:49] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:18:50] [INFO ] Implicit Places using invariants in 629 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:18:50] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:18:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:19:17] [INFO ] Implicit Places using invariants and state equation in 27245 ms returned []
Implicit Place search using SMT with State Equation took 27876 ms to find 0 implicit places.
[2023-03-15 11:19:17] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:19:17] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 11:19:17] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28418 ms. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 44 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2023-03-15 11:19:17] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 11:19:18] [INFO ] After 840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:19:19] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:19:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:19:19] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:19:19] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 1 ms to minimize.
[2023-03-15 11:19:20] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 0 ms to minimize.
[2023-03-15 11:19:20] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2023-03-15 11:19:20] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 0 ms to minimize.
[2023-03-15 11:19:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1120 ms
[2023-03-15 11:19:20] [INFO ] After 1171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-15 11:19:20] [INFO ] After 2052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3322 reset in 143 ms.
Product exploration explored 100000 steps with 3331 reset in 155 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1056 transition count 996
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 239 place count 1056 transition count 1035
Deduced a syphon composed of 280 places in 20 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 281 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 285 place count 1052 transition count 1031
Deduced a syphon composed of 276 places in 20 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 289 place count 1052 transition count 1031
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 458 places in 13 ms
Iterating global reduction 1 with 182 rules applied. Total rules applied 471 place count 1052 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 472 place count 1051 transition count 1069
Deduced a syphon composed of 457 places in 12 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 473 place count 1051 transition count 1069
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -251
Deduced a syphon composed of 497 places in 12 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 513 place count 1051 transition count 1320
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 554 place count 1010 transition count 1238
Deduced a syphon composed of 456 places in 11 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 595 place count 1010 transition count 1238
Deduced a syphon composed of 456 places in 12 ms
Applied a total of 595 rules in 795 ms. Remains 1010 /1057 variables (removed 47) and now considering 1238/997 (removed -241) transitions.
[2023-03-15 11:19:22] [INFO ] Redundant transitions in 51 ms returned []
// Phase 1: matrix 1238 rows 1010 cols
[2023-03-15 11:19:23] [INFO ] Invariants computation overflowed in 140 ms
[2023-03-15 11:19:24] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1238/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2089 ms. Remains : 1010/1057 places, 1238/997 transitions.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 75 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:19:24] [INFO ] Invariants computation overflowed in 237 ms
[2023-03-15 11:19:25] [INFO ] Implicit Places using invariants in 1080 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:19:25] [INFO ] Invariants computation overflowed in 143 ms
[2023-03-15 11:19:26] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 2327 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:19:26] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-15 11:19:27] [INFO ] Dead Transitions using invariants and state equation in 1319 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3723 ms. Remains : 1057/1057 places, 997/997 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 243141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F((p1&&X((p1 U (p0||G(p1)))))))))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1059 transition count 758
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 478 place count 820 transition count 718
Deduced a syphon composed of 40 places in 18 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 6 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 920 place count 599 transition count 537
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 5 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 996 place count 561 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 997 place count 560 transition count 536
Applied a total of 997 rules in 188 ms. Remains 560 /1060 variables (removed 500) and now considering 536/998 (removed 462) transitions.
// Phase 1: matrix 536 rows 560 cols
[2023-03-15 11:19:28] [INFO ] Computed 101 place invariants in 62 ms
[2023-03-15 11:19:28] [INFO ] Implicit Places using invariants in 508 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 511 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1060 places, 536/998 transitions.
Graph (complete) has 1745 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 554 transition count 532
Applied a total of 7 rules in 40 ms. Remains 554 /558 variables (removed 4) and now considering 532/536 (removed 4) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-15 11:19:28] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:19:29] [INFO ] Implicit Places using invariants in 645 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2023-03-15 11:19:29] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 11:19:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:19:54] [INFO ] Implicit Places using invariants and state equation in 24444 ms returned []
Implicit Place search using SMT with State Equation took 25092 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 554/1060 places, 532/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25833 ms. Remains : 554/1060 places, 532/998 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LT s44 1), p1:(GEQ s321 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-02 finished in 26023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1059 transition count 759
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 821 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 478 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 478 place count 820 transition count 718
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 922 place count 598 transition count 536
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 998 place count 560 transition count 536
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 999 place count 560 transition count 536
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1000 place count 559 transition count 535
Applied a total of 1000 rules in 116 ms. Remains 559 /1060 variables (removed 501) and now considering 535/998 (removed 463) transitions.
// Phase 1: matrix 535 rows 559 cols
[2023-03-15 11:19:54] [INFO ] Computed 101 place invariants in 69 ms
[2023-03-15 11:19:55] [INFO ] Implicit Places using invariants in 882 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 885 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1060 places, 535/998 transitions.
Graph (complete) has 1749 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 553 transition count 531
Applied a total of 7 rules in 37 ms. Remains 553 /557 variables (removed 4) and now considering 531/535 (removed 4) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:19:55] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 11:19:55] [INFO ] Implicit Places using invariants in 745 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:19:56] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:19:56] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:20:20] [INFO ] Implicit Places using invariants and state equation in 25006 ms returned []
Implicit Place search using SMT with State Equation took 25754 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 553/1060 places, 531/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26794 ms. Remains : 553/1060 places, 531/998 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s353 1) (LT s365 1)) (OR (LT s177 1) (LT s185 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13867 reset in 164 ms.
Product exploration explored 100000 steps with 13849 reset in 173 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1382 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 294952 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294952 steps, saw 147526 distinct states, run finished after 3003 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:20:24] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-15 11:20:24] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:20:26] [INFO ] After 1332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:20:26] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:20:27] [INFO ] After 1646ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:20:30] [INFO ] Deduced a trap composed of 34 places in 219 ms of which 2 ms to minimize.
[2023-03-15 11:20:30] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2023-03-15 11:20:31] [INFO ] Deduced a trap composed of 54 places in 247 ms of which 2 ms to minimize.
[2023-03-15 11:20:31] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 1 ms to minimize.
[2023-03-15 11:20:31] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 1 ms to minimize.
[2023-03-15 11:20:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1504 ms
[2023-03-15 11:20:31] [INFO ] After 5623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-15 11:20:32] [INFO ] After 7284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 544 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 46 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 480/553 places, 458/531 transitions.
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 306527 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 306527 steps, saw 153350 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 458 rows 480 cols
[2023-03-15 11:20:35] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:20:35] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:20:36] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:20:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:20:37] [INFO ] After 1254ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:20:37] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 0 ms to minimize.
[2023-03-15 11:20:38] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 0 ms to minimize.
[2023-03-15 11:20:38] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2023-03-15 11:20:38] [INFO ] Deduced a trap composed of 33 places in 216 ms of which 1 ms to minimize.
[2023-03-15 11:20:38] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 0 ms to minimize.
[2023-03-15 11:20:39] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 3 ms to minimize.
[2023-03-15 11:20:39] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 2 ms to minimize.
[2023-03-15 11:20:39] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 1 ms to minimize.
[2023-03-15 11:20:39] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:20:40] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 1 ms to minimize.
[2023-03-15 11:20:40] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 1 ms to minimize.
[2023-03-15 11:20:40] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 1 ms to minimize.
[2023-03-15 11:20:41] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:20:41] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 1 ms to minimize.
[2023-03-15 11:20:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3771 ms
[2023-03-15 11:20:41] [INFO ] After 5147ms 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-15 11:20:41] [INFO ] After 6106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2023-03-15 11:20:44] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:20:44] [INFO ] Implicit Places using invariants in 627 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2023-03-15 11:20:44] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:20:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:21:11] [INFO ] Implicit Places using invariants and state equation in 27099 ms returned [42, 343, 365, 371, 392, 394, 418, 424, 446, 451, 455, 472, 478]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 27733 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 467/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 467 transition count 453
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 462 transition count 453
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 462 transition count 453
Applied a total of 13 rules in 36 ms. Remains 462 /467 variables (removed 5) and now considering 453/458 (removed 5) transitions.
// Phase 1: matrix 453 rows 462 cols
[2023-03-15 11:21:11] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-15 11:21:12] [INFO ] Implicit Places using invariants in 428 ms returned []
// Phase 1: matrix 453 rows 462 cols
[2023-03-15 11:21:12] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:21:12] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:21:42] [INFO ] Performed 461/462 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:21:42] [INFO ] Implicit Places using invariants and state equation in 30532 ms returned [67, 98]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 30972 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 460/480 places, 453/458 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 460 transition count 453
Applied a total of 2 rules in 18 ms. Remains 460 /460 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 460 cols
[2023-03-15 11:21:42] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-15 11:21:43] [INFO ] Implicit Places using invariants in 863 ms returned []
// Phase 1: matrix 453 rows 460 cols
[2023-03-15 11:21:43] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-15 11:21:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:22:12] [INFO ] Implicit Places using invariants and state equation in 29119 ms returned []
Implicit Place search using SMT with State Equation took 29985 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 460/480 places, 453/458 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 88756 ms. Remains : 460/480 places, 453/458 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 14 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:22:13] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:22:13] [INFO ] Implicit Places using invariants in 798 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:22:13] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:22:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:22:44] [INFO ] Performed 298/553 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:23:14] [INFO ] Performed 545/553 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-15 11:23:15] [INFO ] Implicit Places using invariants and state equation in 61618 ms returned []
Implicit Place search using SMT with State Equation took 62421 ms to find 0 implicit places.
[2023-03-15 11:23:15] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:23:15] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:23:15] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62996 ms. Remains : 553/553 places, 531/531 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1745 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 306 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291253 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291253 steps, saw 145683 distinct states, run finished after 3004 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:23:19] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-15 11:23:19] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:23:21] [INFO ] After 1381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:23:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:23:22] [INFO ] After 1510ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:23:25] [INFO ] Deduced a trap composed of 34 places in 284 ms of which 1 ms to minimize.
[2023-03-15 11:23:25] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 0 ms to minimize.
[2023-03-15 11:23:26] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 0 ms to minimize.
[2023-03-15 11:23:26] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 0 ms to minimize.
[2023-03-15 11:23:26] [INFO ] Deduced a trap composed of 58 places in 222 ms of which 1 ms to minimize.
[2023-03-15 11:23:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1955 ms
[2023-03-15 11:23:27] [INFO ] After 6189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-15 11:23:27] [INFO ] After 8013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 786 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 531/531 transitions.
Graph (complete) has 1665 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 552 transition count 530
Free-agglomeration rule (complex) applied 72 times.
Iterating global reduction 1 with 72 rules applied. Total rules applied 74 place count 552 transition count 458
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 480 transition count 458
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 2 with 81 rules applied. Total rules applied 227 place count 480 transition count 458
Applied a total of 227 rules in 61 ms. Remains 480 /553 variables (removed 73) and now considering 458/531 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 480/553 places, 458/531 transitions.
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 834 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 273172 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273172 steps, saw 136643 distinct states, run finished after 3006 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 458 rows 480 cols
[2023-03-15 11:23:31] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-15 11:23:31] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:23:32] [INFO ] After 480ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:23:32] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:23:33] [INFO ] After 1358ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:23:33] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 1 ms to minimize.
[2023-03-15 11:23:34] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 0 ms to minimize.
[2023-03-15 11:23:34] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 0 ms to minimize.
[2023-03-15 11:23:34] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 1 ms to minimize.
[2023-03-15 11:23:34] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 1 ms to minimize.
[2023-03-15 11:23:35] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:23:35] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:23:35] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:23:36] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:23:36] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 1 ms to minimize.
[2023-03-15 11:23:36] [INFO ] Deduced a trap composed of 20 places in 341 ms of which 1 ms to minimize.
[2023-03-15 11:23:37] [INFO ] Deduced a trap composed of 19 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:23:37] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:23:38] [INFO ] Deduced a trap composed of 16 places in 362 ms of which 1 ms to minimize.
[2023-03-15 11:23:38] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4365 ms
[2023-03-15 11:23:38] [INFO ] After 5869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 582 ms.
[2023-03-15 11:23:38] [INFO ] After 7047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 13 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 480/480 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 458/458 transitions.
Applied a total of 0 rules in 12 ms. Remains 480 /480 variables (removed 0) and now considering 458/458 (removed 0) transitions.
// Phase 1: matrix 458 rows 480 cols
[2023-03-15 11:23:40] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:23:41] [INFO ] Implicit Places using invariants in 776 ms returned []
// Phase 1: matrix 458 rows 480 cols
[2023-03-15 11:23:41] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:23:42] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:24:07] [INFO ] Implicit Places using invariants and state equation in 25688 ms returned [42, 201, 310, 338, 343, 365, 371, 392, 394, 398, 418, 424, 446, 451, 455, 472, 478]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 26484 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 463/480 places, 458/458 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 463 transition count 451
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 451
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 456 transition count 451
Applied a total of 17 rules in 27 ms. Remains 456 /463 variables (removed 7) and now considering 451/458 (removed 7) transitions.
// Phase 1: matrix 451 rows 456 cols
[2023-03-15 11:24:07] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 11:24:07] [INFO ] Implicit Places using invariants in 638 ms returned []
// Phase 1: matrix 451 rows 456 cols
[2023-03-15 11:24:08] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-15 11:24:08] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:24:38] [INFO ] Performed 276/456 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:24:51] [INFO ] Implicit Places using invariants and state equation in 43566 ms returned []
Implicit Place search using SMT with State Equation took 44216 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 456/480 places, 451/458 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 70739 ms. Remains : 456/480 places, 451/458 transitions.
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 319107 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319107 steps, saw 159595 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 451 rows 456 cols
[2023-03-15 11:24:54] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-15 11:24:54] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:24:55] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:24:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:24:56] [INFO ] After 1186ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:24:56] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2023-03-15 11:24:57] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2023-03-15 11:24:57] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 1 ms to minimize.
[2023-03-15 11:24:57] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 1 ms to minimize.
[2023-03-15 11:24:57] [INFO ] Deduced a trap composed of 33 places in 214 ms of which 0 ms to minimize.
[2023-03-15 11:24:57] [INFO ] Deduced a trap composed of 34 places in 246 ms of which 1 ms to minimize.
[2023-03-15 11:24:58] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 1 ms to minimize.
[2023-03-15 11:24:58] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2023-03-15 11:24:58] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:24:59] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 1 ms to minimize.
[2023-03-15 11:24:59] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 0 ms to minimize.
[2023-03-15 11:24:59] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 1 ms to minimize.
[2023-03-15 11:24:59] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2023-03-15 11:25:00] [INFO ] Deduced a trap composed of 16 places in 304 ms of which 1 ms to minimize.
[2023-03-15 11:25:00] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3630 ms
[2023-03-15 11:25:00] [INFO ] After 4933ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 377 ms.
[2023-03-15 11:25:00] [INFO ] After 5966ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 451/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 456 /456 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 456/456 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 451/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 451/451 (removed 0) transitions.
// Phase 1: matrix 451 rows 456 cols
[2023-03-15 11:25:02] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-15 11:25:03] [INFO ] Implicit Places using invariants in 723 ms returned []
// Phase 1: matrix 451 rows 456 cols
[2023-03-15 11:25:03] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-15 11:25:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:25:34] [INFO ] Performed 283/456 implicitness test of which 3 returned IMPLICIT in 30 seconds.
[2023-03-15 11:25:44] [INFO ] Implicit Places using invariants and state equation in 40549 ms returned [47, 124, 260]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 41286 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 453/456 places, 451/451 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 452 transition count 450
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 452 transition count 450
Applied a total of 4 rules in 25 ms. Remains 452 /453 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 452 cols
[2023-03-15 11:25:44] [INFO ] Computed 79 place invariants in 63 ms
[2023-03-15 11:25:45] [INFO ] Implicit Places using invariants in 957 ms returned [65, 70, 91, 96, 116, 148, 171, 176, 202, 209, 223, 228, 251, 278, 283]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 969 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 437/456 places, 450/451 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 437 transition count 441
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 428 transition count 441
Applied a total of 18 rules in 23 ms. Remains 428 /437 variables (removed 9) and now considering 441/450 (removed 9) transitions.
// Phase 1: matrix 441 rows 428 cols
[2023-03-15 11:25:45] [INFO ] Computed 64 place invariants in 85 ms
[2023-03-15 11:25:45] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-03-15 11:25:45] [INFO ] Invariant cache hit.
[2023-03-15 11:25:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:26:16] [INFO ] Performed 383/428 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:26:21] [INFO ] Implicit Places using invariants and state equation in 35221 ms returned []
Implicit Place search using SMT with State Equation took 36056 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 428/456 places, 441/451 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 78368 ms. Remains : 428/456 places, 441/451 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13760 reset in 266 ms.
Product exploration explored 100000 steps with 13901 reset in 298 ms.
Support contains 4 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 531/531 transitions.
Applied a total of 0 rules in 20 ms. Remains 553 /553 variables (removed 0) and now considering 531/531 (removed 0) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:26:22] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-15 11:26:22] [INFO ] Implicit Places using invariants in 752 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:26:22] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-15 11:26:23] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:26:43] [INFO ] Implicit Places using invariants and state equation in 20285 ms returned []
Implicit Place search using SMT with State Equation took 21049 ms to find 0 implicit places.
[2023-03-15 11:26:43] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:26:43] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-15 11:26:43] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21856 ms. Remains : 553/553 places, 531/531 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-04 finished in 409735 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) U ((!p2&&X(p1))||X(G(p1))))))'
Support contains 5 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 43 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:26:44] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-15 11:26:44] [INFO ] Implicit Places using invariants in 866 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:26:45] [INFO ] Invariants computation overflowed in 173 ms
[2023-03-15 11:26:46] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:26:46] [INFO ] Invariants computation overflowed in 155 ms
[2023-03-15 11:26:47] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3779 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s579 1) (GEQ s657 1)) (NOT (AND (GEQ s734 1) (GEQ s751 1)))), p0:(AND (GEQ s579 1) (GEQ s657 1)), p1:(LT s1033 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-06 finished in 4109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 232 place count 1059 transition count 765
Reduce places removed 232 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 234 rules applied. Total rules applied 466 place count 827 transition count 763
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 468 place count 825 transition count 763
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 468 place count 825 transition count 723
Deduced a syphon composed of 40 places in 16 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 548 place count 785 transition count 723
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 7 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 914 place count 602 transition count 540
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 988 place count 565 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 989 place count 564 transition count 539
Applied a total of 989 rules in 156 ms. Remains 564 /1060 variables (removed 496) and now considering 539/998 (removed 459) transitions.
// Phase 1: matrix 539 rows 564 cols
[2023-03-15 11:26:48] [INFO ] Computed 101 place invariants in 100 ms
[2023-03-15 11:26:48] [INFO ] Implicit Places using invariants in 725 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 727 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1060 places, 539/998 transitions.
Graph (complete) has 1746 edges and 562 vertex of which 561 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 558 transition count 535
Applied a total of 7 rules in 37 ms. Remains 558 /562 variables (removed 4) and now considering 535/539 (removed 4) transitions.
// Phase 1: matrix 535 rows 558 cols
[2023-03-15 11:26:49] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-15 11:26:49] [INFO ] Implicit Places using invariants in 634 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-15 11:26:49] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-15 11:26:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:27:12] [INFO ] Implicit Places using invariants and state equation in 23037 ms returned []
Implicit Place search using SMT with State Equation took 23683 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 558/1060 places, 535/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24604 ms. Remains : 558/1060 places, 535/998 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s159 1) (LT s166 1)), p1:(GEQ s137 1), p2:(LT s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13934 reset in 387 ms.
Product exploration explored 100000 steps with 13837 reset in 290 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X p0), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 392 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 789 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 535 rows 558 cols
[2023-03-15 11:27:14] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 11:27:15] [INFO ] After 1230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:27:17] [INFO ] After 2289ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 11:27:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:27:18] [INFO ] After 205ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 11:27:18] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 2 ms to minimize.
[2023-03-15 11:27:18] [INFO ] Deduced a trap composed of 27 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:27:19] [INFO ] Deduced a trap composed of 28 places in 352 ms of which 2 ms to minimize.
[2023-03-15 11:27:19] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 0 ms to minimize.
[2023-03-15 11:27:19] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:27:20] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 0 ms to minimize.
[2023-03-15 11:27:20] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 1 ms to minimize.
[2023-03-15 11:27:20] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 0 ms to minimize.
[2023-03-15 11:27:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2401 ms
[2023-03-15 11:27:20] [INFO ] After 2672ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-15 11:27:20] [INFO ] After 5153ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 71 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 475/558 places, 453/535 transitions.
Incomplete random walk after 10000 steps, including 1271 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 321493 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 321493 steps, saw 160837 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:27:23] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 11:27:24] [INFO ] After 985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:27:25] [INFO ] After 779ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:27:25] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:27:26] [INFO ] After 302ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:27:26] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 1 ms to minimize.
[2023-03-15 11:27:27] [INFO ] Deduced a trap composed of 19 places in 444 ms of which 1 ms to minimize.
[2023-03-15 11:27:27] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:27:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1457 ms
[2023-03-15 11:27:27] [INFO ] After 1833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-15 11:27:27] [INFO ] After 2924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 11 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:27:27] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-15 11:27:29] [INFO ] Implicit Places using invariants in 1291 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:27:29] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 11:27:29] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:27:59] [INFO ] Performed 336/475 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:28:02] [INFO ] Implicit Places using invariants and state equation in 33758 ms returned [366, 387, 389, 413, 441, 446, 467, 473]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 35052 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 467/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 467 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 465 transition count 451
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 465 transition count 451
Applied a total of 8 rules in 33 ms. Remains 465 /467 variables (removed 2) and now considering 451/453 (removed 2) transitions.
// Phase 1: matrix 451 rows 465 cols
[2023-03-15 11:28:03] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 11:28:03] [INFO ] Implicit Places using invariants in 1011 ms returned []
// Phase 1: matrix 451 rows 465 cols
[2023-03-15 11:28:04] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 11:28:04] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:28:34] [INFO ] Performed 354/465 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:28:43] [INFO ] Implicit Places using invariants and state equation in 39256 ms returned [174, 255]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 40269 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 463/475 places, 451/453 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 463 transition count 451
Applied a total of 2 rules in 26 ms. Remains 463 /463 variables (removed 0) and now considering 451/451 (removed 0) transitions.
// Phase 1: matrix 451 rows 463 cols
[2023-03-15 11:28:43] [INFO ] Computed 89 place invariants in 54 ms
[2023-03-15 11:28:46] [INFO ] Implicit Places using invariants in 3237 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 178, 199, 205, 212, 226, 231, 259, 281, 286, 306, 311, 332, 337, 358, 388, 413, 441]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 3240 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 435/475 places, 451/453 transitions.
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 435 transition count 434
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 34 place count 418 transition count 434
Applied a total of 34 rules in 32 ms. Remains 418 /435 variables (removed 17) and now considering 434/451 (removed 17) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:28:46] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:28:47] [INFO ] Implicit Places using invariants in 774 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:28:47] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 11:28:47] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:29:05] [INFO ] Implicit Places using invariants and state equation in 18249 ms returned []
Implicit Place search using SMT with State Equation took 19025 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 97690 ms. Remains : 418/475 places, 434/453 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X p0), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0)))), (F (AND (NOT p1) (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 477 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Support contains 3 out of 558 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 transitions.
Applied a total of 0 rules in 16 ms. Remains 558 /558 variables (removed 0) and now considering 535/535 (removed 0) transitions.
// Phase 1: matrix 535 rows 558 cols
[2023-03-15 11:29:06] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-15 11:29:06] [INFO ] Implicit Places using invariants in 566 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-15 11:29:06] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-15 11:29:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:29:29] [INFO ] Implicit Places using invariants and state equation in 22704 ms returned []
Implicit Place search using SMT with State Equation took 23272 ms to find 0 implicit places.
[2023-03-15 11:29:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 535 rows 558 cols
[2023-03-15 11:29:29] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:29:29] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23707 ms. Remains : 558/558 places, 535/535 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1742 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 387 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 1417 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 535 rows 558 cols
[2023-03-15 11:29:30] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-15 11:29:31] [INFO ] After 899ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:29:31] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:29:31] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:29:33] [INFO ] After 1606ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:29:33] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 2 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 1 ms to minimize.
[2023-03-15 11:29:34] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 1 ms to minimize.
[2023-03-15 11:29:35] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 1 ms to minimize.
[2023-03-15 11:29:35] [INFO ] Deduced a trap composed of 15 places in 320 ms of which 1 ms to minimize.
[2023-03-15 11:29:35] [INFO ] Deduced a trap composed of 19 places in 368 ms of which 3 ms to minimize.
[2023-03-15 11:29:36] [INFO ] Deduced a trap composed of 15 places in 379 ms of which 1 ms to minimize.
[2023-03-15 11:29:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2659 ms
[2023-03-15 11:29:36] [INFO ] After 4414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-15 11:29:36] [INFO ] After 4943ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 535/535 transitions.
Graph (complete) has 1664 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 557 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 554 transition count 531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 553 transition count 531
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 88 place count 553 transition count 453
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 166 place count 475 transition count 453
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 475 transition count 453
Applied a total of 246 rules in 85 ms. Remains 475 /558 variables (removed 83) and now considering 453/535 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 475/558 places, 453/535 transitions.
Incomplete random walk after 10000 steps, including 1273 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 292754 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292754 steps, saw 146475 distinct states, run finished after 3004 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:29:39] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-15 11:29:40] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:29:41] [INFO ] After 922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:29:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:29:41] [INFO ] After 324ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:29:42] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:29:42] [INFO ] Deduced a trap composed of 19 places in 407 ms of which 1 ms to minimize.
[2023-03-15 11:29:42] [INFO ] Deduced a trap composed of 12 places in 411 ms of which 1 ms to minimize.
[2023-03-15 11:29:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1294 ms
[2023-03-15 11:29:43] [INFO ] After 1718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 172 ms.
[2023-03-15 11:29:43] [INFO ] After 2923ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 19 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 20 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:29:43] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-15 11:29:44] [INFO ] Implicit Places using invariants in 1310 ms returned []
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:29:44] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:29:45] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:30:15] [INFO ] Performed 300/475 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:30:31] [INFO ] Implicit Places using invariants and state equation in 47022 ms returned [283, 288, 339, 413, 419, 467, 473]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 48344 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 468/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 468 transition count 450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 465 transition count 450
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 465 transition count 450
Applied a total of 7 rules in 35 ms. Remains 465 /468 variables (removed 3) and now considering 450/453 (removed 3) transitions.
// Phase 1: matrix 450 rows 465 cols
[2023-03-15 11:30:31] [INFO ] Computed 92 place invariants in 60 ms
[2023-03-15 11:30:34] [INFO ] Implicit Places using invariants in 2688 ms returned [42, 48, 68, 73, 94, 99, 120, 126, 148, 153, 154, 174, 179, 200, 206, 213, 227, 232, 255, 261, 305, 310, 331, 356, 362, 383, 385, 389, 434, 439, 443]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 2690 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 434/475 places, 450/453 transitions.
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 434 transition count 434
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 32 place count 418 transition count 434
Applied a total of 32 rules in 26 ms. Remains 418 /434 variables (removed 16) and now considering 434/450 (removed 16) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:30:34] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:30:35] [INFO ] Implicit Places using invariants in 762 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:30:35] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:30:35] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:30:43] [INFO ] Implicit Places using invariants and state equation in 8369 ms returned []
Implicit Place search using SMT with State Equation took 9133 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 418/475 places, 434/453 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 60248 ms. Remains : 418/475 places, 434/453 transitions.
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 342781 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 342781 steps, saw 171419 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:30:46] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 11:30:47] [INFO ] After 767ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:30:48] [INFO ] After 995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:30:48] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:30:49] [INFO ] After 660ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:30:49] [INFO ] Deduced a trap composed of 19 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:30:49] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 1 ms to minimize.
[2023-03-15 11:30:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 755 ms
[2023-03-15 11:30:49] [INFO ] After 1496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-15 11:30:50] [INFO ] After 2684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 418/418 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 418 /418 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:30:50] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:30:50] [INFO ] Implicit Places using invariants in 708 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:30:50] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 11:30:51] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:31:12] [INFO ] Implicit Places using invariants and state equation in 22086 ms returned []
Implicit Place search using SMT with State Equation took 22806 ms to find 0 implicit places.
[2023-03-15 11:31:12] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 418 cols
[2023-03-15 11:31:12] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-15 11:31:13] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23178 ms. Remains : 418/418 places, 434/434 transitions.
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X p2), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 7 factoid took 329 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 13830 reset in 259 ms.
Product exploration explored 100000 steps with 14076 reset in 284 ms.
Support contains 3 out of 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 535/535 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 558 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 557 transition count 534
Applied a total of 2 rules in 14 ms. Remains 557 /558 variables (removed 1) and now considering 534/535 (removed 1) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:31:14] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:31:14] [INFO ] Implicit Places using invariants in 408 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:31:14] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-15 11:31:15] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:31:33] [INFO ] Implicit Places using invariants and state equation in 18384 ms returned []
Implicit Place search using SMT with State Equation took 18797 ms to find 0 implicit places.
[2023-03-15 11:31:33] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:31:33] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:31:33] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/558 places, 534/535 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19214 ms. Remains : 557/558 places, 534/535 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-07 finished in 285625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(((F(p0) U p1)||!p0) U X(p2))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 55 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:31:33] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-15 11:31:34] [INFO ] Implicit Places using invariants in 616 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:31:34] [INFO ] Invariants computation overflowed in 139 ms
[2023-03-15 11:31:35] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:31:35] [INFO ] Invariants computation overflowed in 145 ms
[2023-03-15 11:31:36] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3157 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 554 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 7}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s233 1) (GEQ s246 1)), p1:(GEQ s869 1), p2:(GEQ s670 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33511 reset in 827 ms.
Product exploration explored 100000 steps with 33290 reset in 1221 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1946 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 610 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Incomplete random walk after 10000 steps, including 340 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 64070 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64070 steps, saw 32040 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:31:45] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-15 11:31:50] [INFO ] After 3889ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:14
[2023-03-15 11:31:53] [INFO ] Deduced a trap composed of 40 places in 517 ms of which 3 ms to minimize.
[2023-03-15 11:31:54] [INFO ] Deduced a trap composed of 163 places in 559 ms of which 2 ms to minimize.
[2023-03-15 11:31:54] [INFO ] Deduced a trap composed of 25 places in 590 ms of which 1 ms to minimize.
[2023-03-15 11:31:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1969 ms
[2023-03-15 11:31:56] [INFO ] Deduced a trap composed of 209 places in 424 ms of which 1 ms to minimize.
[2023-03-15 11:31:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 671 ms
[2023-03-15 11:31:56] [INFO ] After 9387ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-15 11:31:56] [INFO ] After 10424ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-15 11:32:11] [INFO ] After 14284ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2023-03-15 11:32:12] [INFO ] Deduced a trap composed of 25 places in 854 ms of which 2 ms to minimize.
[2023-03-15 11:32:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1040 ms
[2023-03-15 11:32:14] [INFO ] Deduced a trap composed of 175 places in 477 ms of which 1 ms to minimize.
[2023-03-15 11:32:15] [INFO ] Deduced a trap composed of 173 places in 427 ms of which 1 ms to minimize.
[2023-03-15 11:32:15] [INFO ] Deduced a trap composed of 209 places in 398 ms of which 0 ms to minimize.
[2023-03-15 11:32:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1724 ms
[2023-03-15 11:32:21] [INFO ] After 23791ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :12
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 11:32:21] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :12
Fused 19 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 8356 ms.
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1057 transition count 758
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 480 place count 819 transition count 758
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 480 place count 819 transition count 719
Deduced a syphon composed of 39 places in 10 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 558 place count 780 transition count 719
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 12 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 2 with 368 rules applied. Total rules applied 926 place count 596 transition count 535
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1000 place count 559 transition count 535
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1078 place count 559 transition count 457
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1156 place count 481 transition count 457
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1237 place count 481 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1238 place count 480 transition count 456
Applied a total of 1238 rules in 118 ms. Remains 480 /1060 variables (removed 580) and now considering 456/998 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 480/1060 places, 456/998 transitions.
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 840 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 825 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 821 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 849 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 882 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 840 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 320424 steps, run timeout after 9001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 320424 steps, saw 160307 distinct states, run finished after 9001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 456 rows 480 cols
[2023-03-15 11:32:42] [INFO ] Computed 100 place invariants in 50 ms
[2023-03-15 11:32:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:32:42] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 60 ms returned sat
[2023-03-15 11:32:43] [INFO ] After 585ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:11
[2023-03-15 11:32:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:32:43] [INFO ] After 243ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :2 real:11
[2023-03-15 11:32:43] [INFO ] After 376ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:11
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-15 11:32:43] [INFO ] After 1387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:11
[2023-03-15 11:32:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:32:43] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 73 ms returned sat
[2023-03-15 11:32:45] [INFO ] After 1499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-15 11:32:50] [INFO ] After 4718ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-15 11:32:50] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 2 ms to minimize.
[2023-03-15 11:32:51] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 1 ms to minimize.
[2023-03-15 11:32:51] [INFO ] Deduced a trap composed of 33 places in 329 ms of which 1 ms to minimize.
[2023-03-15 11:32:52] [INFO ] Deduced a trap composed of 34 places in 301 ms of which 1 ms to minimize.
[2023-03-15 11:32:52] [INFO ] Deduced a trap composed of 32 places in 349 ms of which 1 ms to minimize.
[2023-03-15 11:32:52] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-15 11:32:53] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2023-03-15 11:32:53] [INFO ] Deduced a trap composed of 28 places in 348 ms of which 1 ms to minimize.
[2023-03-15 11:32:54] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 1 ms to minimize.
[2023-03-15 11:32:54] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 1 ms to minimize.
[2023-03-15 11:32:54] [INFO ] Deduced a trap composed of 25 places in 378 ms of which 0 ms to minimize.
[2023-03-15 11:32:55] [INFO ] Deduced a trap composed of 26 places in 452 ms of which 1 ms to minimize.
[2023-03-15 11:32:55] [INFO ] Deduced a trap composed of 22 places in 419 ms of which 1 ms to minimize.
[2023-03-15 11:32:56] [INFO ] Deduced a trap composed of 15 places in 460 ms of which 1 ms to minimize.
[2023-03-15 11:32:56] [INFO ] Deduced a trap composed of 17 places in 443 ms of which 1 ms to minimize.
[2023-03-15 11:32:57] [INFO ] Deduced a trap composed of 16 places in 534 ms of which 1 ms to minimize.
[2023-03-15 11:32:58] [INFO ] Deduced a trap composed of 13 places in 505 ms of which 1 ms to minimize.
[2023-03-15 11:32:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7730 ms
[2023-03-15 11:32:59] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 0 ms to minimize.
[2023-03-15 11:32:59] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2023-03-15 11:32:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-15 11:33:01] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 5 ms to minimize.
[2023-03-15 11:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-15 11:33:02] [INFO ] After 16673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 3898 ms.
[2023-03-15 11:33:06] [INFO ] After 22621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10001 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 456/456 transitions.
Applied a total of 0 rules in 14 ms. Remains 480 /480 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 480/480 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 456/456 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2023-03-15 11:33:16] [INFO ] Invariant cache hit.
[2023-03-15 11:33:18] [INFO ] Implicit Places using invariants in 1962 ms returned [14, 19, 44, 50, 70, 75, 124, 130, 151, 156, 157, 177, 182, 203, 209, 216, 230, 235, 258, 264, 286, 291, 312, 317, 338, 343, 364, 370, 391, 394, 398, 418, 424, 446, 451, 455, 472, 478]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1964 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 442/480 places, 456/456 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 441 transition count 455
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 21 place count 441 transition count 436
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 40 place count 422 transition count 436
Applied a total of 40 rules in 33 ms. Remains 422 /442 variables (removed 20) and now considering 436/456 (removed 20) transitions.
// Phase 1: matrix 436 rows 422 cols
[2023-03-15 11:33:18] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 11:33:18] [INFO ] Implicit Places using invariants in 722 ms returned []
// Phase 1: matrix 436 rows 422 cols
[2023-03-15 11:33:18] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:33:19] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:33:49] [INFO ] Performed 386/422 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:33:52] [INFO ] Implicit Places using invariants and state equation in 33447 ms returned []
Implicit Place search using SMT with State Equation took 34178 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 422/480 places, 436/456 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36186 ms. Remains : 422/480 places, 436/456 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 3304 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 405 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 70 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:33:56] [INFO ] Invariants computation overflowed in 107 ms
[2023-03-15 11:33:57] [INFO ] Implicit Places using invariants in 1007 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:33:57] [INFO ] Invariants computation overflowed in 159 ms
[2023-03-15 11:33:58] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 2369 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:33:59] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-15 11:33:59] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3338 ms. Remains : 1060/1060 places, 998/998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 2454 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 335 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 286 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 171387 steps, run timeout after 6001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 171387 steps, saw 85707 distinct states, run finished after 6001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:34:11] [INFO ] Invariants computation overflowed in 94 ms
[2023-03-15 11:34:12] [INFO ] After 959ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-15 11:34:13] [INFO ] Deduced a trap composed of 40 places in 777 ms of which 2 ms to minimize.
[2023-03-15 11:34:14] [INFO ] Deduced a trap composed of 52 places in 798 ms of which 2 ms to minimize.
[2023-03-15 11:34:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2058 ms
[2023-03-15 11:34:14] [INFO ] After 3077ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 11:34:15] [INFO ] After 3592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-15 11:34:22] [INFO ] After 6696ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-15 11:34:23] [INFO ] Deduced a trap composed of 18 places in 858 ms of which 5 ms to minimize.
[2023-03-15 11:34:24] [INFO ] Deduced a trap composed of 16 places in 961 ms of which 2 ms to minimize.
[2023-03-15 11:34:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2090 ms
[2023-03-15 11:34:25] [INFO ] Deduced a trap composed of 156 places in 455 ms of which 2 ms to minimize.
[2023-03-15 11:34:26] [INFO ] Deduced a trap composed of 149 places in 463 ms of which 1 ms to minimize.
[2023-03-15 11:34:26] [INFO ] Deduced a trap composed of 151 places in 465 ms of which 1 ms to minimize.
[2023-03-15 11:34:27] [INFO ] Deduced a trap composed of 163 places in 431 ms of which 1 ms to minimize.
[2023-03-15 11:34:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2289 ms
[2023-03-15 11:34:29] [INFO ] Deduced a trap composed of 209 places in 234 ms of which 0 ms to minimize.
[2023-03-15 11:34:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2023-03-15 11:34:31] [INFO ] After 15970ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 7632 ms.
[2023-03-15 11:34:39] [INFO ] After 24264ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6088 ms.
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Graph (complete) has 1811 edges and 1060 vertex of which 1058 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 1057 transition count 758
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 480 place count 819 transition count 758
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 480 place count 819 transition count 719
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 558 place count 780 transition count 719
Performed 184 Post agglomeration using F-continuation condition.Transition count delta: 184
Deduced a syphon composed of 184 places in 3 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 2 with 368 rules applied. Total rules applied 926 place count 596 transition count 535
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 1000 place count 559 transition count 535
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 2 with 78 rules applied. Total rules applied 1078 place count 559 transition count 457
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 2 with 78 rules applied. Total rules applied 1156 place count 481 transition count 457
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 3 with 81 rules applied. Total rules applied 1237 place count 481 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1238 place count 480 transition count 456
Applied a total of 1238 rules in 122 ms. Remains 480 /1060 variables (removed 580) and now considering 456/998 (removed 542) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 480/1060 places, 456/998 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 838 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 112737 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112737 steps, saw 56416 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-15 11:34:50] [INFO ] Invariant cache hit.
[2023-03-15 11:34:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:34:50] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 62 ms returned sat
[2023-03-15 11:34:51] [INFO ] After 561ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-15 11:34:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:34:51] [INFO ] After 458ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-15 11:34:51] [INFO ] After 1312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-15 11:34:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:34:51] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 85 ms returned sat
[2023-03-15 11:34:53] [INFO ] After 1657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 11:34:56] [INFO ] After 2886ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-15 11:34:57] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 1 ms to minimize.
[2023-03-15 11:34:57] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2023-03-15 11:34:57] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 1 ms to minimize.
[2023-03-15 11:34:57] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 1 ms to minimize.
[2023-03-15 11:34:58] [INFO ] Deduced a trap composed of 31 places in 220 ms of which 1 ms to minimize.
[2023-03-15 11:34:58] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 0 ms to minimize.
[2023-03-15 11:34:58] [INFO ] Deduced a trap composed of 26 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:34:59] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 1 ms to minimize.
[2023-03-15 11:34:59] [INFO ] Deduced a trap composed of 18 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:34:59] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:35:00] [INFO ] Deduced a trap composed of 12 places in 355 ms of which 2 ms to minimize.
[2023-03-15 11:35:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3356 ms
[2023-03-15 11:35:02] [INFO ] After 8430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 781 ms.
[2023-03-15 11:35:02] [INFO ] After 11323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6000 ms.
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 456/456 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 480/480 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 456/456 transitions.
Applied a total of 0 rules in 10 ms. Remains 480 /480 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2023-03-15 11:35:08] [INFO ] Invariant cache hit.
[2023-03-15 11:35:10] [INFO ] Implicit Places using invariants in 1442 ms returned [14, 19, 44, 50, 70, 75, 124, 130, 151, 156, 157, 177, 182, 203, 209, 216, 230, 235, 258, 264, 286, 291, 312, 317, 338, 343, 364, 370, 391, 394, 398, 418, 424, 446, 451, 455, 472, 478]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1443 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 442/480 places, 456/456 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 441 transition count 455
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 0 with 19 rules applied. Total rules applied 21 place count 441 transition count 436
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 40 place count 422 transition count 436
Applied a total of 40 rules in 25 ms. Remains 422 /442 variables (removed 20) and now considering 436/456 (removed 20) transitions.
// Phase 1: matrix 436 rows 422 cols
[2023-03-15 11:35:10] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:35:10] [INFO ] Implicit Places using invariants in 552 ms returned []
// Phase 1: matrix 436 rows 422 cols
[2023-03-15 11:35:10] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:35:11] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:35:41] [INFO ] Performed 407/422 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:35:42] [INFO ] Implicit Places using invariants and state equation in 31983 ms returned []
Implicit Place search using SMT with State Equation took 32539 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 422/480 places, 436/456 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34017 ms. Remains : 422/480 places, 436/456 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 2841 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 443 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 456 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 33232 reset in 1047 ms.
Product exploration explored 100000 steps with 33270 reset in 737 ms.
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 41 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:35:49] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-15 11:35:49] [INFO ] Implicit Places using invariants in 622 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:35:49] [INFO ] Invariants computation overflowed in 108 ms
[2023-03-15 11:36:17] [INFO ] Implicit Places using invariants and state equation in 27423 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 28061 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 99 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:36:17] [INFO ] Invariants computation overflowed in 179 ms
[2023-03-15 11:36:18] [INFO ] Implicit Places using invariants in 961 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:36:18] [INFO ] Invariants computation overflowed in 234 ms
[2023-03-15 11:36:43] [INFO ] Implicit Places using invariants and state equation in 24924 ms returned []
Implicit Place search using SMT with State Equation took 25896 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54097 ms. Remains : 1057/1060 places, 997/998 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 309617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1059 transition count 761
Reduce places removed 236 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 239 rules applied. Total rules applied 475 place count 823 transition count 758
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 478 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 478 place count 820 transition count 718
Deduced a syphon composed of 40 places in 15 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 4 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 918 place count 600 transition count 538
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 994 place count 562 transition count 538
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 996 place count 562 transition count 538
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 997 place count 561 transition count 537
Iterating global reduction 3 with 1 rules applied. Total rules applied 998 place count 561 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 999 place count 560 transition count 536
Applied a total of 999 rules in 141 ms. Remains 560 /1060 variables (removed 500) and now considering 536/998 (removed 462) transitions.
// Phase 1: matrix 536 rows 560 cols
[2023-03-15 11:36:43] [INFO ] Computed 101 place invariants in 92 ms
[2023-03-15 11:36:44] [INFO ] Implicit Places using invariants in 876 ms returned [16, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 878 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 558/1060 places, 536/998 transitions.
Graph (complete) has 1747 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 554 transition count 532
Applied a total of 7 rules in 26 ms. Remains 554 /558 variables (removed 4) and now considering 532/536 (removed 4) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-15 11:36:44] [INFO ] Computed 99 place invariants in 93 ms
[2023-03-15 11:36:45] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-15 11:36:45] [INFO ] Invariant cache hit.
[2023-03-15 11:36:45] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:36:58] [INFO ] Implicit Places using invariants and state equation in 13206 ms returned []
Implicit Place search using SMT with State Equation took 13983 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 554/1060 places, 532/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15030 ms. Remains : 554/1060 places, 532/998 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s265 1) (LT s310 1)), p0:(OR (LT s10 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13987 reset in 145 ms.
Product exploration explored 100000 steps with 13856 reset in 163 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1743 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1374 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 805 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 829 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 180666 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180666 steps, saw 90368 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 11:37:02] [INFO ] Invariant cache hit.
[2023-03-15 11:37:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:37:02] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 63 ms returned sat
[2023-03-15 11:37:04] [INFO ] After 1544ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 11:37:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-15 11:37:04] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 100 ms returned sat
[2023-03-15 11:37:06] [INFO ] After 1982ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 11:37:06] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:37:11] [INFO ] After 5159ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 11:37:11] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 1 ms to minimize.
[2023-03-15 11:37:12] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:37:12] [INFO ] Deduced a trap composed of 18 places in 336 ms of which 1 ms to minimize.
[2023-03-15 11:37:12] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 1 ms to minimize.
[2023-03-15 11:37:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1253 ms
[2023-03-15 11:37:12] [INFO ] After 6647ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1589 ms.
[2023-03-15 11:37:14] [INFO ] After 10497ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2001 ms.
Support contains 4 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1663 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 234 place count 476 transition count 454
Applied a total of 234 rules in 43 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1278 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322597 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322597 steps, saw 161389 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:37:19] [INFO ] Computed 99 place invariants in 78 ms
[2023-03-15 11:37:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:37:19] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 80 ms returned sat
[2023-03-15 11:37:20] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:37:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:37:21] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 77 ms returned sat
[2023-03-15 11:37:21] [INFO ] After 585ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:37:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:37:26] [INFO ] After 5341ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:37:27] [INFO ] After 5578ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 209 ms.
[2023-03-15 11:37:27] [INFO ] After 6591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2023-03-15 11:37:29] [INFO ] Invariant cache hit.
[2023-03-15 11:37:32] [INFO ] Implicit Places using invariants in 3049 ms returned [43, 49, 69, 74, 95, 100, 120, 126, 147, 152, 153, 173, 178, 199, 205, 212, 232, 255, 261, 284, 289, 309, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 3056 ms to find 37 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 439/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 439 transition count 436
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 421 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 421 transition count 436
Applied a total of 37 rules in 28 ms. Remains 421 /439 variables (removed 18) and now considering 436/454 (removed 18) transitions.
// Phase 1: matrix 436 rows 421 cols
[2023-03-15 11:37:32] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 11:37:33] [INFO ] Implicit Places using invariants in 594 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-15 11:37:33] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:37:33] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:38:01] [INFO ] Implicit Places using invariants and state equation in 28309 ms returned []
Implicit Place search using SMT with State Equation took 28905 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 421/476 places, 436/454 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32001 ms. Remains : 421/476 places, 436/454 transitions.
Incomplete random walk after 10000 steps, including 1473 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 888 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 326572 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 326572 steps, saw 163314 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 436 rows 421 cols
[2023-03-15 11:38:04] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-15 11:38:05] [INFO ] After 934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:38:05] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:38:05] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:38:09] [INFO ] After 3254ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:38:09] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-15 11:38:09] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 1 ms to minimize.
[2023-03-15 11:38:10] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 1 ms to minimize.
[2023-03-15 11:38:10] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 1 ms to minimize.
[2023-03-15 11:38:10] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 1 ms to minimize.
[2023-03-15 11:38:10] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 1 ms to minimize.
[2023-03-15 11:38:10] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 1 ms to minimize.
[2023-03-15 11:38:11] [INFO ] Deduced a trap composed of 50 places in 205 ms of which 1 ms to minimize.
[2023-03-15 11:38:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1824 ms
[2023-03-15 11:38:11] [INFO ] After 5273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-15 11:38:11] [INFO ] After 5952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2000 ms.
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 9 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 421/421 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 421 cols
[2023-03-15 11:38:13] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-15 11:38:14] [INFO ] Implicit Places using invariants in 724 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-15 11:38:14] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:38:14] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:38:44] [INFO ] Performed 401/421 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:38:46] [INFO ] Implicit Places using invariants and state equation in 32238 ms returned []
Implicit Place search using SMT with State Equation took 32963 ms to find 0 implicit places.
[2023-03-15 11:38:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 436 rows 421 cols
[2023-03-15 11:38:46] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-15 11:38:46] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33504 ms. Remains : 421/421 places, 436/436 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-09 finished in 123832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(G(p1)))))))'
Support contains 3 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 72 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:38:47] [INFO ] Invariants computation overflowed in 159 ms
[2023-03-15 11:38:48] [INFO ] Implicit Places using invariants in 942 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:38:48] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-15 11:39:11] [INFO ] Implicit Places using invariants and state equation in 23650 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24599 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 84 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:39:12] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-15 11:39:12] [INFO ] Implicit Places using invariants in 721 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:39:12] [INFO ] Invariants computation overflowed in 169 ms
[2023-03-15 11:39:13] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26713 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s579 1), p0:(AND (GEQ s17 1) (GEQ s35 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-10 finished in 26950 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 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 48 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:39:14] [INFO ] Invariants computation overflowed in 147 ms
[2023-03-15 11:39:15] [INFO ] Implicit Places using invariants in 907 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:39:15] [INFO ] Invariants computation overflowed in 94 ms
[2023-03-15 11:39:39] [INFO ] Implicit Places using invariants and state equation in 24520 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 25430 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 84 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:39:39] [INFO ] Invariants computation overflowed in 236 ms
[2023-03-15 11:39:40] [INFO ] Implicit Places using invariants in 956 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:39:40] [INFO ] Invariants computation overflowed in 214 ms
[2023-03-15 11:39:41] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 2284 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27846 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-11 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 (GEQ s481 1) (GEQ s548 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 DoubleExponent-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-11 finished in 27997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 41 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:39:42] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-15 11:39:42] [INFO ] Implicit Places using invariants in 776 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:39:42] [INFO ] Invariants computation overflowed in 95 ms
[2023-03-15 11:40:06] [INFO ] Implicit Places using invariants and state equation in 23705 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 24485 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1060 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 84 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:40:06] [INFO ] Invariants computation overflowed in 148 ms
[2023-03-15 11:40:07] [INFO ] Implicit Places using invariants in 822 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:40:07] [INFO ] Invariants computation overflowed in 146 ms
[2023-03-15 11:40:31] [INFO ] Implicit Places using invariants and state equation in 23768 ms returned []
Implicit Place search using SMT with State Equation took 24606 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1060 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49216 ms. Remains : 1057/1060 places, 997/998 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s657 1) (LT s664 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 584 ms.
Product exploration explored 100000 steps with 20000 reset in 602 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 334 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 170501 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170501 steps, saw 85272 distinct states, run finished after 3007 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:40:36] [INFO ] Invariants computation overflowed in 239 ms
[2023-03-15 11:40:38] [INFO ] After 2459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:40:40] [INFO ] After 1447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:40:40] [INFO ] Deduced a trap composed of 113 places in 349 ms of which 2 ms to minimize.
[2023-03-15 11:40:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 553 ms
[2023-03-15 11:40:41] [INFO ] After 2072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-15 11:40:41] [INFO ] After 2403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1394 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 480 place count 816 transition count 714
Deduced a syphon composed of 42 places in 9 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 564 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 3 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1081 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1158 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1239 place count 477 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 476 transition count 454
Applied a total of 1240 rules in 111 ms. Remains 476 /1057 variables (removed 581) and now considering 454/997 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 476/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1294 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 329536 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329536 steps, saw 164862 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:40:45] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-15 11:40:46] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:40:46] [INFO ] After 547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:40:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:40:47] [INFO ] After 835ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:40:47] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 0 ms to minimize.
[2023-03-15 11:40:48] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 0 ms to minimize.
[2023-03-15 11:40:48] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 1 ms to minimize.
[2023-03-15 11:40:48] [INFO ] Deduced a trap composed of 33 places in 157 ms of which 0 ms to minimize.
[2023-03-15 11:40:48] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 1 ms to minimize.
[2023-03-15 11:40:48] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 0 ms to minimize.
[2023-03-15 11:40:49] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 0 ms to minimize.
[2023-03-15 11:40:49] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 0 ms to minimize.
[2023-03-15 11:40:49] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 1 ms to minimize.
[2023-03-15 11:40:49] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 1 ms to minimize.
[2023-03-15 11:40:50] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 0 ms to minimize.
[2023-03-15 11:40:50] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 1 ms to minimize.
[2023-03-15 11:40:50] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2023-03-15 11:40:50] [INFO ] Deduced a trap composed of 15 places in 214 ms of which 1 ms to minimize.
[2023-03-15 11:40:51] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 1 ms to minimize.
[2023-03-15 11:40:51] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 0 ms to minimize.
[2023-03-15 11:40:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4007 ms
[2023-03-15 11:40:51] [INFO ] After 4887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-15 11:40:51] [INFO ] After 5609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1133 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:40:53] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-15 11:40:53] [INFO ] Implicit Places using invariants in 927 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:40:53] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 11:40:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:41:21] [INFO ] Implicit Places using invariants and state equation in 28003 ms returned [282, 308, 314, 335, 340, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 28932 ms to find 17 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 459/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 459 transition count 446
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 451 transition count 446
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 451 transition count 446
Applied a total of 17 rules in 31 ms. Remains 451 /459 variables (removed 8) and now considering 446/454 (removed 8) transitions.
// Phase 1: matrix 446 rows 451 cols
[2023-03-15 11:41:22] [INFO ] Computed 82 place invariants in 65 ms
[2023-03-15 11:41:23] [INFO ] Implicit Places using invariants in 1649 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 286]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 1660 ms to find 21 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 430/476 places, 446/454 transitions.
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 430 transition count 435
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 22 place count 419 transition count 435
Applied a total of 22 rules in 31 ms. Remains 419 /430 variables (removed 11) and now considering 435/446 (removed 11) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:41:23] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:41:24] [INFO ] Implicit Places using invariants in 488 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:41:24] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 11:41:24] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:41:49] [INFO ] Implicit Places using invariants and state equation in 25446 ms returned []
Implicit Place search using SMT with State Equation took 25957 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 419/476 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 56623 ms. Remains : 419/476 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1419 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 934 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 346439 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346439 steps, saw 173246 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:41:52] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:41:53] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:41:53] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:41:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:41:54] [INFO ] After 667ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:41:54] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2023-03-15 11:41:54] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 1 ms to minimize.
[2023-03-15 11:41:55] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2023-03-15 11:41:55] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2023-03-15 11:41:55] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 1 ms to minimize.
[2023-03-15 11:41:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1442 ms
[2023-03-15 11:41:56] [INFO ] After 2170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-15 11:41:56] [INFO ] After 2939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 482 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 15 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 15 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:41:56] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:41:57] [INFO ] Implicit Places using invariants in 681 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:41:57] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 11:41:57] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:42:25] [INFO ] Implicit Places using invariants and state equation in 28307 ms returned []
Implicit Place search using SMT with State Equation took 28999 ms to find 0 implicit places.
[2023-03-15 11:42:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:42:25] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:42:26] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29438 ms. Remains : 419/419 places, 435/435 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 75 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:42:26] [INFO ] Invariants computation overflowed in 230 ms
[2023-03-15 11:42:27] [INFO ] Implicit Places using invariants in 1008 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:42:27] [INFO ] Invariants computation overflowed in 215 ms
[2023-03-15 11:42:28] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:42:29] [INFO ] Invariants computation overflowed in 181 ms
[2023-03-15 11:42:29] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3393 ms. Remains : 1057/1057 places, 997/997 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187609 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187609 steps, saw 93822 distinct states, run finished after 3004 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:42:33] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-15 11:42:35] [INFO ] After 2043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:42:37] [INFO ] After 1449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:42:37] [INFO ] Deduced a trap composed of 113 places in 436 ms of which 2 ms to minimize.
[2023-03-15 11:42:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 666 ms
[2023-03-15 11:42:37] [INFO ] After 2178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-15 11:42:37] [INFO ] After 2457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1406 ms.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1055 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 1055 transition count 758
Reduce places removed 237 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 818 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 480 place count 816 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 480 place count 816 transition count 714
Deduced a syphon composed of 42 places in 9 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 564 place count 774 transition count 714
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 4 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 928 place count 592 transition count 532
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 1004 place count 554 transition count 532
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1081 place count 554 transition count 455
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1158 place count 477 transition count 455
Partial Free-agglomeration rule applied 81 times.
Drop transitions removed 81 transitions
Iterating global reduction 4 with 81 rules applied. Total rules applied 1239 place count 477 transition count 455
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1240 place count 476 transition count 454
Applied a total of 1240 rules in 107 ms. Remains 476 /1057 variables (removed 581) and now considering 454/997 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 476/1057 places, 454/997 transitions.
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 335216 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335216 steps, saw 167692 distinct states, run finished after 3002 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:42:42] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:42:43] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:42:43] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:42:43] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:42:44] [INFO ] After 669ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:42:44] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 0 ms to minimize.
[2023-03-15 11:42:44] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 1 ms to minimize.
[2023-03-15 11:42:45] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 0 ms to minimize.
[2023-03-15 11:42:45] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 0 ms to minimize.
[2023-03-15 11:42:45] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:42:45] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 0 ms to minimize.
[2023-03-15 11:42:46] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 1 ms to minimize.
[2023-03-15 11:42:46] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 1 ms to minimize.
[2023-03-15 11:42:46] [INFO ] Deduced a trap composed of 28 places in 304 ms of which 1 ms to minimize.
[2023-03-15 11:42:47] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 1 ms to minimize.
[2023-03-15 11:42:47] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 0 ms to minimize.
[2023-03-15 11:42:47] [INFO ] Deduced a trap composed of 18 places in 270 ms of which 1 ms to minimize.
[2023-03-15 11:42:48] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 1 ms to minimize.
[2023-03-15 11:42:48] [INFO ] Deduced a trap composed of 15 places in 352 ms of which 2 ms to minimize.
[2023-03-15 11:42:49] [INFO ] Deduced a trap composed of 17 places in 330 ms of which 2 ms to minimize.
[2023-03-15 11:42:49] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 2 ms to minimize.
[2023-03-15 11:42:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4923 ms
[2023-03-15 11:42:49] [INFO ] After 5643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-15 11:42:49] [INFO ] After 6509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1082 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:42:50] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:42:52] [INFO ] Implicit Places using invariants in 1323 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:42:52] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 11:42:52] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:43:11] [INFO ] Implicit Places using invariants and state equation in 18957 ms returned [94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 282, 287, 308, 314, 335, 340, 361, 367, 388, 390, 414, 442, 447, 451, 468, 474]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 20287 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 445/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 445 transition count 440
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 28 place count 431 transition count 440
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 431 transition count 440
Applied a total of 31 rules in 29 ms. Remains 431 /445 variables (removed 14) and now considering 440/454 (removed 14) transitions.
// Phase 1: matrix 440 rows 431 cols
[2023-03-15 11:43:11] [INFO ] Computed 68 place invariants in 57 ms
[2023-03-15 11:43:11] [INFO ] Implicit Places using invariants in 913 ms returned [42, 48, 68, 73, 237, 358, 383]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 923 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 424/476 places, 440/454 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 424 transition count 435
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 419 transition count 435
Applied a total of 10 rules in 23 ms. Remains 419 /424 variables (removed 5) and now considering 435/440 (removed 5) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:43:12] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:43:12] [INFO ] Implicit Places using invariants in 580 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:43:12] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:43:12] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:43:29] [INFO ] Implicit Places using invariants and state equation in 17056 ms returned []
Implicit Place search using SMT with State Equation took 17647 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 419/476 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 38923 ms. Remains : 419/476 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1439 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 347427 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 347427 steps, saw 173746 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:43:32] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-15 11:43:33] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:43:33] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:43:33] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:43:34] [INFO ] After 597ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:43:34] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2023-03-15 11:43:34] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 1 ms to minimize.
[2023-03-15 11:43:35] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 4 ms to minimize.
[2023-03-15 11:43:35] [INFO ] Deduced a trap composed of 12 places in 331 ms of which 1 ms to minimize.
[2023-03-15 11:43:35] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 1 ms to minimize.
[2023-03-15 11:43:36] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 1 ms to minimize.
[2023-03-15 11:43:36] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 1 ms to minimize.
[2023-03-15 11:43:36] [INFO ] Deduced a trap composed of 31 places in 238 ms of which 1 ms to minimize.
[2023-03-15 11:43:36] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 1 ms to minimize.
[2023-03-15 11:43:37] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 1 ms to minimize.
[2023-03-15 11:43:37] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 0 ms to minimize.
[2023-03-15 11:43:37] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 0 ms to minimize.
[2023-03-15 11:43:38] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 0 ms to minimize.
[2023-03-15 11:43:38] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 1 ms to minimize.
[2023-03-15 11:43:38] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 1 ms to minimize.
[2023-03-15 11:43:38] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 0 ms to minimize.
[2023-03-15 11:43:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4497 ms
[2023-03-15 11:43:38] [INFO ] After 5154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-15 11:43:39] [INFO ] After 5886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 848 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:43:40] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 11:43:40] [INFO ] Implicit Places using invariants in 722 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:43:40] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 11:43:41] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:44:08] [INFO ] Implicit Places using invariants and state equation in 27789 ms returned []
Implicit Place search using SMT with State Equation took 28524 ms to find 0 implicit places.
[2023-03-15 11:44:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:44:08] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 11:44:08] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28910 ms. Remains : 419/419 places, 435/435 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 419 transition count 398
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 382 transition count 398
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 93 place count 363 transition count 379
Iterating global reduction 0 with 19 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 31 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2023-03-15 11:44:09] [INFO ] Invariants computation overflowed in 27 ms
[2023-03-15 11:44:09] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:44:10] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:44:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:44:10] [INFO ] After 20ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:44:10] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 0 ms to minimize.
[2023-03-15 11:44:10] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2023-03-15 11:44:10] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 1 ms to minimize.
[2023-03-15 11:44:10] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-15 11:44:11] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 1 ms to minimize.
[2023-03-15 11:44:11] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 1 ms to minimize.
[2023-03-15 11:44:11] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 0 ms to minimize.
[2023-03-15 11:44:11] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 0 ms to minimize.
[2023-03-15 11:44:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1544 ms
[2023-03-15 11:44:11] [INFO ] After 1588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-15 11:44:11] [INFO ] After 2160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 781 ms.
Product exploration explored 100000 steps with 20000 reset in 492 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Graph (complete) has 1805 edges and 1057 vertex of which 1056 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 236 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 1056 transition count 996
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 43 Pre rules applied. Total rules applied 237 place count 1056 transition count 1035
Deduced a syphon composed of 279 places in 25 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 280 place count 1056 transition count 1035
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 284 place count 1052 transition count 1031
Deduced a syphon composed of 275 places in 20 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 288 place count 1052 transition count 1031
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 457 places in 13 ms
Iterating global reduction 1 with 182 rules applied. Total rules applied 470 place count 1052 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 471 place count 1051 transition count 1070
Deduced a syphon composed of 456 places in 13 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 472 place count 1051 transition count 1070
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -250
Deduced a syphon composed of 496 places in 13 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 512 place count 1051 transition count 1320
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 553 place count 1010 transition count 1238
Deduced a syphon composed of 455 places in 13 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 594 place count 1010 transition count 1238
Deduced a syphon composed of 455 places in 12 ms
Applied a total of 594 rules in 418 ms. Remains 1010 /1057 variables (removed 47) and now considering 1238/997 (removed -241) transitions.
[2023-03-15 11:44:14] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1238 rows 1010 cols
[2023-03-15 11:44:14] [INFO ] Invariants computation overflowed in 217 ms
[2023-03-15 11:44:16] [INFO ] Dead Transitions using invariants and state equation in 1341 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1010/1057 places, 1238/997 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1816 ms. Remains : 1010/1057 places, 1238/997 transitions.
Support contains 2 out of 1057 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1057/1057 places, 997/997 transitions.
Applied a total of 0 rules in 41 ms. Remains 1057 /1057 variables (removed 0) and now considering 997/997 (removed 0) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:44:16] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-15 11:44:17] [INFO ] Implicit Places using invariants in 895 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:44:17] [INFO ] Invariants computation overflowed in 229 ms
[2023-03-15 11:44:18] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 2085 ms to find 0 implicit places.
// Phase 1: matrix 997 rows 1057 cols
[2023-03-15 11:44:18] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-15 11:44:19] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2929 ms. Remains : 1057/1057 places, 997/997 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-12 finished in 277060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1059 transition count 758
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 820 transition count 758
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 478 place count 820 transition count 718
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 558 place count 780 transition count 718
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 924 place count 597 transition count 535
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1000 place count 559 transition count 535
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1001 place count 558 transition count 534
Applied a total of 1001 rules in 91 ms. Remains 558 /1060 variables (removed 502) and now considering 534/998 (removed 464) transitions.
// Phase 1: matrix 534 rows 558 cols
[2023-03-15 11:44:19] [INFO ] Computed 101 place invariants in 55 ms
[2023-03-15 11:44:19] [INFO ] Implicit Places using invariants in 776 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 778 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/1060 places, 534/998 transitions.
Graph (complete) has 1743 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 552 transition count 530
Applied a total of 7 rules in 29 ms. Remains 552 /556 variables (removed 4) and now considering 530/534 (removed 4) transitions.
// Phase 1: matrix 530 rows 552 cols
[2023-03-15 11:44:20] [INFO ] Computed 99 place invariants in 61 ms
[2023-03-15 11:44:20] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-15 11:44:20] [INFO ] Invariant cache hit.
[2023-03-15 11:44:21] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:44:38] [INFO ] Implicit Places using invariants and state equation in 17652 ms returned []
Implicit Place search using SMT with State Equation took 18309 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/1060 places, 530/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19208 ms. Remains : 552/1060 places, 530/998 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-13 finished in 19285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1059 transition count 757
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 819 transition count 757
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 480 place count 819 transition count 717
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 560 place count 779 transition count 717
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 4 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 924 place count 597 transition count 535
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 1000 place count 559 transition count 535
Applied a total of 1000 rules in 83 ms. Remains 559 /1060 variables (removed 501) and now considering 535/998 (removed 463) transitions.
// Phase 1: matrix 535 rows 559 cols
[2023-03-15 11:44:38] [INFO ] Computed 101 place invariants in 68 ms
[2023-03-15 11:44:39] [INFO ] Implicit Places using invariants in 895 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 897 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 557/1060 places, 535/998 transitions.
Graph (complete) has 1753 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 553 transition count 531
Applied a total of 7 rules in 26 ms. Remains 553 /557 variables (removed 4) and now considering 531/535 (removed 4) transitions.
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:44:39] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-15 11:44:39] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 531 rows 553 cols
[2023-03-15 11:44:39] [INFO ] Invariants computation overflowed in 15 ms
[2023-03-15 11:44:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-15 11:45:11] [INFO ] Performed 59/553 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2023-03-15 11:45:30] [INFO ] Implicit Places using invariants and state equation in 50430 ms returned []
Implicit Place search using SMT with State Equation took 50813 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 553/1060 places, 531/998 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 51821 ms. Remains : 553/1060 places, 531/998 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 681 ms.
Product exploration explored 100000 steps with 50000 reset in 632 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 1749 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/553 stabilizing places and 2/531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-020-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-020-LTLFireability-14 finished in 53264 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 1 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Applied a total of 0 rules in 41 ms. Remains 1060 /1060 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:45:31] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-15 11:45:32] [INFO ] Implicit Places using invariants in 850 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:45:32] [INFO ] Invariants computation overflowed in 159 ms
[2023-03-15 11:45:33] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
// Phase 1: matrix 998 rows 1060 cols
[2023-03-15 11:45:33] [INFO ] Invariants computation overflowed in 93 ms
[2023-03-15 11:45:34] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2849 ms. Remains : 1060/1060 places, 998/998 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-15 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:(GEQ s447 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 DoubleExponent-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-020-LTLFireability-15 finished in 3009 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 U p1))))'
Found a Lengthening insensitive property : DoubleExponent-PT-020-LTLFireability-00
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 3 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1059 transition count 760
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 822 transition count 760
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 474 place count 822 transition count 721
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 552 place count 783 transition count 721
Performed 183 Post agglomeration using F-continuation condition.Transition count delta: 183
Deduced a syphon composed of 183 places in 4 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 2 with 366 rules applied. Total rules applied 918 place count 600 transition count 538
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 992 place count 563 transition count 538
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 993 place count 562 transition count 537
Applied a total of 993 rules in 96 ms. Remains 562 /1060 variables (removed 498) and now considering 537/998 (removed 461) transitions.
// Phase 1: matrix 537 rows 562 cols
[2023-03-15 11:45:35] [INFO ] Computed 101 place invariants in 62 ms
[2023-03-15 11:45:35] [INFO ] Implicit Places using invariants in 467 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 479 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 560/1060 places, 537/998 transitions.
Graph (complete) has 1745 edges and 560 vertex of which 559 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 556 transition count 533
Applied a total of 7 rules in 43 ms. Remains 556 /560 variables (removed 4) and now considering 533/537 (removed 4) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-15 11:45:35] [INFO ] Computed 99 place invariants in 58 ms
[2023-03-15 11:45:36] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-15 11:45:36] [INFO ] Invariant cache hit.
[2023-03-15 11:45:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:46:06] [INFO ] Performed 254/556 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:46:37] [INFO ] Performed 487/556 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-15 11:46:45] [INFO ] Implicit Places using invariants and state equation in 69840 ms returned []
Implicit Place search using SMT with State Equation took 70456 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 556/1060 places, 533/998 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 71074 ms. Remains : 556/1060 places, 533/998 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s482 1) (LT s308 1)), p0:(GEQ s265 1)], 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 13828 reset in 149 ms.
Product exploration explored 100000 steps with 13790 reset in 165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 301 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 1364 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 803 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 182971 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182971 steps, saw 91516 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-15 11:46:50] [INFO ] Invariant cache hit.
[2023-03-15 11:46:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:46:50] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 56 ms returned sat
[2023-03-15 11:46:51] [INFO ] After 1059ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-15 11:46:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:46:51] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 53 ms returned sat
[2023-03-15 11:46:52] [INFO ] After 953ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-15 11:46:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:46:52] [INFO ] After 300ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-15 11:46:52] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-15 11:46:52] [INFO ] After 1618ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 806 ms.
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 555 transition count 532
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 1 with 79 rules applied. Total rules applied 81 place count 555 transition count 453
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 476 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 238 place count 476 transition count 453
Applied a total of 238 rules in 40 ms. Remains 476 /556 variables (removed 80) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 476/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 847 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 876 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 212645 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212645 steps, saw 106380 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 476 cols
[2023-03-15 11:46:56] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:46:57] [INFO ] After 816ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 11:46:57] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:46:58] [INFO ] After 900ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:46:58] [INFO ] After 1836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:46:59] [INFO ] After 728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 11:47:00] [INFO ] After 655ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 11:47:00] [INFO ] After 795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-15 11:47:00] [INFO ] After 1678ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 536 ms.
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 476/476 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 453/453 transitions.
Applied a total of 0 rules in 12 ms. Remains 476 /476 variables (removed 0) and now considering 453/453 (removed 0) transitions.
// Phase 1: matrix 453 rows 476 cols
[2023-03-15 11:47:00] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:47:01] [INFO ] Implicit Places using invariants in 1032 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2023-03-15 11:47:02] [INFO ] Invariants computation overflowed in 71 ms
[2023-03-15 11:47:02] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:47:13] [INFO ] Implicit Places using invariants and state equation in 11094 ms returned []
Implicit Place search using SMT with State Equation took 12132 ms to find 0 implicit places.
[2023-03-15 11:47:13] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 453 rows 476 cols
[2023-03-15 11:47:13] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-15 11:47:13] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12684 ms. Remains : 476/476 places, 453/453 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 476 transition count 452
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 475 transition count 452
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 2 place count 475 transition count 415
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 76 place count 438 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 437 transition count 414
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 437 transition count 413
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 436 transition count 413
Applied a total of 80 rules in 53 ms. Remains 436 /476 variables (removed 40) and now considering 413/453 (removed 40) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 413 rows 436 cols
[2023-03-15 11:47:13] [INFO ] Computed 99 place invariants in 63 ms
[2023-03-15 11:47:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:47:13] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 85 ms returned sat
[2023-03-15 11:47:14] [INFO ] After 533ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 11:47:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:47:14] [INFO ] After 69ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-03-15 11:47:14] [INFO ] Deduced a trap composed of 7 places in 350 ms of which 1 ms to minimize.
[2023-03-15 11:47:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2023-03-15 11:47:15] [INFO ] After 611ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:47:15] [INFO ] After 1411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 11:47:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:47:15] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 89 ms returned sat
[2023-03-15 11:47:15] [INFO ] After 498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 11:47:15] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 11:47:16] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-15 11:47:16] [INFO ] After 1031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 544 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 556 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 12 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-15 11:47:17] [INFO ] Computed 99 place invariants in 97 ms
[2023-03-15 11:47:17] [INFO ] Implicit Places using invariants in 843 ms returned []
[2023-03-15 11:47:17] [INFO ] Invariant cache hit.
[2023-03-15 11:47:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:47:37] [INFO ] Implicit Places using invariants and state equation in 19585 ms returned []
Implicit Place search using SMT with State Equation took 20456 ms to find 0 implicit places.
[2023-03-15 11:47:37] [INFO ] Invariant cache hit.
[2023-03-15 11:47:38] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21089 ms. Remains : 556/556 places, 533/533 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 1332 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 803 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 263781 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263781 steps, saw 131926 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:47:41] [INFO ] Invariant cache hit.
[2023-03-15 11:47:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:47:41] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 67 ms returned sat
[2023-03-15 11:47:42] [INFO ] After 1070ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:47:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:47:43] [INFO ] After 1176ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:47:43] [INFO ] After 2436ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:47:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:47:44] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 66 ms returned sat
[2023-03-15 11:47:45] [INFO ] After 936ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:47:45] [INFO ] After 162ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:47:45] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-15 11:47:45] [INFO ] After 1429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 179 ms.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 533/533 transitions.
Graph (complete) has 1661 edges and 556 vertex of which 555 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 555 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 553 transition count 530
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 552 transition count 530
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 2 with 77 rules applied. Total rules applied 85 place count 552 transition count 453
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 2 with 77 rules applied. Total rules applied 162 place count 475 transition count 453
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 3 with 78 rules applied. Total rules applied 240 place count 475 transition count 453
Applied a total of 240 rules in 82 ms. Remains 475 /556 variables (removed 81) and now considering 453/533 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 475/556 places, 453/533 transitions.
Incomplete random walk after 10000 steps, including 1258 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 853 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 312114 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312114 steps, saw 156148 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 453 rows 475 cols
[2023-03-15 11:47:48] [INFO ] Computed 99 place invariants in 45 ms
[2023-03-15 11:47:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 11:47:48] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 47 ms returned sat
[2023-03-15 11:47:49] [INFO ] After 357ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:47:49] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:47:49] [INFO ] After 234ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:47:49] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:47:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 11:47:49] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 51 ms returned sat
[2023-03-15 11:47:49] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:47:50] [INFO ] After 231ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:47:50] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-15 11:47:50] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 156 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 19 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 475/475 places, 453/453 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 453/453 transitions.
Applied a total of 0 rules in 19 ms. Remains 475 /475 variables (removed 0) and now considering 453/453 (removed 0) transitions.
[2023-03-15 11:47:50] [INFO ] Invariant cache hit.
[2023-03-15 11:47:53] [INFO ] Implicit Places using invariants in 3232 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 282, 287, 307, 312, 333, 338, 359, 365, 386, 388, 392, 413, 419, 441, 446, 450, 467, 473]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 3234 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 437/475 places, 453/453 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 437 transition count 435
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 419 transition count 435
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 419 transition count 435
Applied a total of 37 rules in 34 ms. Remains 419 /437 variables (removed 18) and now considering 435/453 (removed 18) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:47:53] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:47:54] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:47:54] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-15 11:47:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:48:15] [INFO ] Implicit Places using invariants and state equation in 21202 ms returned []
Implicit Place search using SMT with State Equation took 21824 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 419/475 places, 435/453 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25111 ms. Remains : 419/475 places, 435/453 transitions.
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 308505 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 308505 steps, saw 154279 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:48:18] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:48:19] [INFO ] After 762ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:48:19] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:48:19] [INFO ] After 191ms SMT Verify possible using 77 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:48:19] [INFO ] After 1047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:48:20] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:48:21] [INFO ] After 1092ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:48:21] [INFO ] After 1133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-15 11:48:21] [INFO ] After 2178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 117 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 18 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:48:22] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:48:22] [INFO ] Implicit Places using invariants in 657 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:48:22] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-15 11:48:23] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:48:50] [INFO ] Implicit Places using invariants and state equation in 27590 ms returned []
Implicit Place search using SMT with State Equation took 28249 ms to find 0 implicit places.
[2023-03-15 11:48:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 11:48:50] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 11:48:50] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28816 ms. Remains : 419/419 places, 435/435 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 419 transition count 397
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 381 transition count 397
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 363 transition count 379
Iterating global reduction 0 with 18 rules applied. Total rules applied 112 place count 363 transition count 379
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 362 transition count 378
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 116 place count 362 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 360 transition count 376
Applied a total of 118 rules in 30 ms. Remains 360 /419 variables (removed 59) and now considering 376/435 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 360 cols
[2023-03-15 11:48:50] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 11:48:51] [INFO ] After 548ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 11:48:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 11:48:51] [INFO ] After 28ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 11:48:51] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 1 ms to minimize.
[2023-03-15 11:48:52] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 1 ms to minimize.
[2023-03-15 11:48:52] [INFO ] Deduced a trap composed of 88 places in 215 ms of which 0 ms to minimize.
[2023-03-15 11:48:52] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 0 ms to minimize.
[2023-03-15 11:48:52] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 1 ms to minimize.
[2023-03-15 11:48:53] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2023-03-15 11:48:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1582 ms
[2023-03-15 11:48:53] [INFO ] After 1638ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:48:53] [INFO ] After 2305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:48:53] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:48:53] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:48:54] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 1 ms to minimize.
[2023-03-15 11:48:54] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 1 ms to minimize.
[2023-03-15 11:48:54] [INFO ] Deduced a trap composed of 88 places in 219 ms of which 1 ms to minimize.
[2023-03-15 11:48:54] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 1 ms to minimize.
[2023-03-15 11:48:55] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2023-03-15 11:48:55] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 1 ms to minimize.
[2023-03-15 11:48:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1587 ms
[2023-03-15 11:48:55] [INFO ] After 1639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-15 11:48:55] [INFO ] After 2333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 13800 reset in 237 ms.
Product exploration explored 100000 steps with 13837 reset in 266 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 556 transition count 533
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 556 transition count 537
Deduced a syphon composed of 3 places in 4 ms
Applied a total of 3 rules in 37 ms. Remains 556 /556 variables (removed 0) and now considering 537/533 (removed -4) transitions.
[2023-03-15 11:48:56] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 537 rows 556 cols
[2023-03-15 11:48:57] [INFO ] Computed 99 place invariants in 100 ms
[2023-03-15 11:48:57] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 556/556 places, 537/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 840 ms. Remains : 556/556 places, 537/533 transitions.
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 533/533 transitions.
Applied a total of 0 rules in 12 ms. Remains 556 /556 variables (removed 0) and now considering 533/533 (removed 0) transitions.
// Phase 1: matrix 533 rows 556 cols
[2023-03-15 11:48:57] [INFO ] Computed 99 place invariants in 100 ms
[2023-03-15 11:48:58] [INFO ] Implicit Places using invariants in 992 ms returned []
[2023-03-15 11:48:58] [INFO ] Invariant cache hit.
[2023-03-15 11:48:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:49:18] [INFO ] Implicit Places using invariants and state equation in 20205 ms returned []
Implicit Place search using SMT with State Equation took 21203 ms to find 0 implicit places.
[2023-03-15 11:49:18] [INFO ] Invariant cache hit.
[2023-03-15 11:49:19] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21628 ms. Remains : 556/556 places, 533/533 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-00 finished in 224707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(((F(p0) U p1)||!p0) U X(p2))))'
Found a Shortening insensitive property : DoubleExponent-PT-020-LTLFireability-08
Stuttering acceptance computed with spot in 495 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Support contains 4 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1059 transition count 760
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 822 transition count 760
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 474 place count 822 transition count 721
Deduced a syphon composed of 39 places in 16 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 552 place count 783 transition count 721
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 6 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 916 place count 601 transition count 539
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 990 place count 564 transition count 539
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 991 place count 564 transition count 539
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 992 place count 563 transition count 538
Applied a total of 992 rules in 178 ms. Remains 563 /1060 variables (removed 497) and now considering 538/998 (removed 460) transitions.
// Phase 1: matrix 538 rows 563 cols
[2023-03-15 11:49:20] [INFO ] Computed 101 place invariants in 95 ms
[2023-03-15 11:49:21] [INFO ] Implicit Places using invariants in 718 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 719 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 561/1060 places, 538/998 transitions.
Graph (complete) has 1745 edges and 561 vertex of which 560 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 557 transition count 534
Applied a total of 7 rules in 34 ms. Remains 557 /561 variables (removed 4) and now considering 534/538 (removed 4) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:49:21] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 11:49:22] [INFO ] Implicit Places using invariants in 674 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:49:22] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:49:22] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:49:52] [INFO ] Performed 288/557 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:50:19] [INFO ] Implicit Places using invariants and state equation in 57660 ms returned []
Implicit Place search using SMT with State Equation took 58336 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 557/1060 places, 534/998 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 59268 ms. Remains : 557/1060 places, 534/998 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}, { cond=true, acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={2} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 2} source=2 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=3 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={2} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 7}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={2} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={1} source=6 dest: 7}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s116 1) (GEQ s123 1)), p1:(GEQ s453 1), p2:(GEQ s352 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34188 reset in 554 ms.
Product exploration explored 100000 steps with 33971 reset in 467 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 2090 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 8 states, 44 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[p2, p2, (AND p1 p2), (AND p0 p2 p1), false, (AND p1 p2), (AND p0 p2), false]
Incomplete random walk after 10000 steps, including 1397 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 73 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 82 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 106507 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106507 steps, saw 53268 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:50:27] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:50:28] [INFO ] After 1056ms SMT Verify possible using state equation in real domain returned unsat :2 sat :3 real:14
[2023-03-15 11:50:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:50:29] [INFO ] After 898ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :2 sat :2 real:15
[2023-03-15 11:50:30] [INFO ] After 1595ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-15 11:50:30] [INFO ] After 3072ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-15 11:50:34] [INFO ] After 3670ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :13
[2023-03-15 11:50:40] [INFO ] After 5809ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :6 sat :13
[2023-03-15 11:50:40] [INFO ] Deduced a trap composed of 38 places in 324 ms of which 1 ms to minimize.
[2023-03-15 11:50:41] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:50:41] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 1 ms to minimize.
[2023-03-15 11:50:41] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 0 ms to minimize.
[2023-03-15 11:50:42] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:50:42] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 1 ms to minimize.
[2023-03-15 11:50:42] [INFO ] Deduced a trap composed of 63 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:50:43] [INFO ] Deduced a trap composed of 54 places in 250 ms of which 1 ms to minimize.
[2023-03-15 11:50:43] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 1 ms to minimize.
[2023-03-15 11:50:44] [INFO ] Deduced a trap composed of 30 places in 314 ms of which 1 ms to minimize.
[2023-03-15 11:50:44] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 1 ms to minimize.
[2023-03-15 11:50:44] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 1 ms to minimize.
[2023-03-15 11:50:45] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 1 ms to minimize.
[2023-03-15 11:50:46] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 0 ms to minimize.
[2023-03-15 11:50:47] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 1 ms to minimize.
[2023-03-15 11:50:47] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 0 ms to minimize.
[2023-03-15 11:50:47] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 1 ms to minimize.
[2023-03-15 11:50:48] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 1 ms to minimize.
[2023-03-15 11:50:48] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 1 ms to minimize.
[2023-03-15 11:50:48] [INFO ] Deduced a trap composed of 30 places in 204 ms of which 1 ms to minimize.
[2023-03-15 11:50:48] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2023-03-15 11:50:49] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2023-03-15 11:50:49] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 0 ms to minimize.
[2023-03-15 11:50:49] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2023-03-15 11:50:50] [INFO ] Deduced a trap composed of 14 places in 317 ms of which 1 ms to minimize.
[2023-03-15 11:50:50] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 1 ms to minimize.
[2023-03-15 11:50:50] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 1 ms to minimize.
[2023-03-15 11:50:50] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 10487 ms
[2023-03-15 11:50:55] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:50:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:50:55] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:17
Fused 19 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 24000 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 534/534 transitions.
Graph (complete) has 1661 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 478 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 238 place count 478 transition count 455
Applied a total of 238 rules in 40 ms. Remains 478 /557 variables (removed 79) and now considering 455/534 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 478/557 places, 455/534 transitions.
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 832 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 852 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 841 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 843 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 855 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 868 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 319553 steps, run timeout after 9001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 319553 steps, saw 159874 distinct states, run finished after 9001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-15 11:51:31] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:51:32] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-15 11:51:35] [INFO ] After 2517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-15 11:51:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:51:39] [INFO ] After 4603ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-15 11:51:40] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 2 ms to minimize.
[2023-03-15 11:51:40] [INFO ] Deduced a trap composed of 37 places in 316 ms of which 1 ms to minimize.
[2023-03-15 11:51:41] [INFO ] Deduced a trap composed of 34 places in 317 ms of which 1 ms to minimize.
[2023-03-15 11:51:41] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:51:41] [INFO ] Deduced a trap composed of 34 places in 314 ms of which 1 ms to minimize.
[2023-03-15 11:51:42] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 0 ms to minimize.
[2023-03-15 11:51:42] [INFO ] Deduced a trap composed of 84 places in 334 ms of which 1 ms to minimize.
[2023-03-15 11:51:42] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 1 ms to minimize.
[2023-03-15 11:51:43] [INFO ] Deduced a trap composed of 31 places in 351 ms of which 1 ms to minimize.
[2023-03-15 11:51:43] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 1 ms to minimize.
[2023-03-15 11:51:44] [INFO ] Deduced a trap composed of 24 places in 418 ms of which 1 ms to minimize.
[2023-03-15 11:51:44] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 1 ms to minimize.
[2023-03-15 11:51:45] [INFO ] Deduced a trap composed of 25 places in 459 ms of which 1 ms to minimize.
[2023-03-15 11:51:45] [INFO ] Deduced a trap composed of 24 places in 438 ms of which 2 ms to minimize.
[2023-03-15 11:51:46] [INFO ] Deduced a trap composed of 21 places in 417 ms of which 1 ms to minimize.
[2023-03-15 11:51:46] [INFO ] Deduced a trap composed of 18 places in 480 ms of which 1 ms to minimize.
[2023-03-15 11:51:47] [INFO ] Deduced a trap composed of 15 places in 485 ms of which 1 ms to minimize.
[2023-03-15 11:51:47] [INFO ] Deduced a trap composed of 16 places in 498 ms of which 1 ms to minimize.
[2023-03-15 11:51:48] [INFO ] Deduced a trap composed of 13 places in 514 ms of which 1 ms to minimize.
[2023-03-15 11:51:48] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 8344 ms
[2023-03-15 11:51:50] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 1 ms to minimize.
[2023-03-15 11:51:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-15 11:51:50] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 1 ms to minimize.
[2023-03-15 11:51:50] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 0 ms to minimize.
[2023-03-15 11:51:51] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 1 ms to minimize.
[2023-03-15 11:51:51] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 1 ms to minimize.
[2023-03-15 11:51:51] [INFO ] Deduced a trap composed of 56 places in 143 ms of which 0 ms to minimize.
[2023-03-15 11:51:51] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 0 ms to minimize.
[2023-03-15 11:51:52] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 1 ms to minimize.
[2023-03-15 11:51:52] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 1 ms to minimize.
[2023-03-15 11:51:53] [INFO ] Deduced a trap composed of 14 places in 441 ms of which 1 ms to minimize.
[2023-03-15 11:51:53] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 1 ms to minimize.
[2023-03-15 11:51:53] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 1 ms to minimize.
[2023-03-15 11:51:53] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 0 ms to minimize.
[2023-03-15 11:51:53] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 0 ms to minimize.
[2023-03-15 11:51:54] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 1 ms to minimize.
[2023-03-15 11:51:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3742 ms
[2023-03-15 11:51:55] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:51:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 321 ms
[2023-03-15 11:51:57] [INFO ] Deduced a trap composed of 2 places in 492 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:51:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:51:57] [INFO ] After 25505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 20000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 11 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 20 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-15 11:52:17] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 11:52:18] [INFO ] Implicit Places using invariants in 636 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-15 11:52:18] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-15 11:52:18] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:52:49] [INFO ] Performed 356/478 implicitness test of which 5 returned IMPLICIT in 30 seconds.
[2023-03-15 11:52:50] [INFO ] Implicit Places using invariants and state equation in 31988 ms returned [228, 262, 284, 336, 341, 362, 368, 389, 392, 396, 416, 422, 444, 449, 470, 476]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 32626 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 462/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 462 transition count 449
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 456 transition count 449
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 456 transition count 449
Applied a total of 16 rules in 29 ms. Remains 456 /462 variables (removed 6) and now considering 449/455 (removed 6) transitions.
// Phase 1: matrix 449 rows 456 cols
[2023-03-15 11:52:50] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:52:51] [INFO ] Implicit Places using invariants in 652 ms returned []
// Phase 1: matrix 449 rows 456 cols
[2023-03-15 11:52:51] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:52:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:53:21] [INFO ] Performed 415/456 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-15 11:53:25] [INFO ] Implicit Places using invariants and state equation in 34475 ms returned [214]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 35129 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 455/478 places, 449/455 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 449
Applied a total of 1 rules in 18 ms. Remains 455 /455 variables (removed 0) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 455 cols
[2023-03-15 11:53:25] [INFO ] Computed 82 place invariants in 57 ms
[2023-03-15 11:53:26] [INFO ] Implicit Places using invariants in 1193 ms returned [42, 48, 68, 73, 122, 128, 149, 154, 155, 175, 180, 201, 207, 231, 254, 285, 306, 311, 433]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 1199 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 436/478 places, 449/455 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 436 transition count 437
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 424 transition count 437
Applied a total of 24 rules in 19 ms. Remains 424 /436 variables (removed 12) and now considering 437/449 (removed 12) transitions.
// Phase 1: matrix 437 rows 424 cols
[2023-03-15 11:53:26] [INFO ] Computed 63 place invariants in 115 ms
[2023-03-15 11:53:27] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-15 11:53:27] [INFO ] Invariant cache hit.
[2023-03-15 11:53:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:53:55] [INFO ] Implicit Places using invariants and state equation in 27422 ms returned []
Implicit Place search using SMT with State Equation took 28259 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 97299 ms. Remains : 424/478 places, 437/455 transitions.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (OR (NOT p0) p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (OR (NOT p0) p1))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2)))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 2653 ms. Reduced automaton from 8 states, 44 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Stuttering acceptance computed with spot in 397 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 534/534 transitions.
Applied a total of 0 rules in 13 ms. Remains 557 /557 variables (removed 0) and now considering 534/534 (removed 0) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:53:58] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:53:59] [INFO ] Implicit Places using invariants in 718 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:53:59] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 11:53:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:54:29] [INFO ] Performed 242/557 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:55:00] [INFO ] Performed 494/557 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-15 11:55:08] [INFO ] Implicit Places using invariants and state equation in 69620 ms returned []
Implicit Place search using SMT with State Equation took 70352 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:55:08] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-15 11:55:09] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70754 ms. Remains : 557/557 places, 534/534 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1741 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 2648 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), p2, (AND (NOT p0) p2 p1), false, false, (AND p0 p2 (NOT p1)), (AND p0 p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 1398 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 820 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 801 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 819 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 804 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 805 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 127436 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127436 steps, saw 63737 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:55:16] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:55:17] [INFO ] After 318ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-15 11:55:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:55:17] [INFO ] After 88ms SMT Verify possible using 38 Read/Feed constraints in real domain returned unsat :0 sat :1 real:8
[2023-03-15 11:55:17] [INFO ] After 147ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:8
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 11:55:17] [INFO ] After 723ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:8
[2023-03-15 11:55:23] [INFO ] After 5782ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-15 11:55:34] [INFO ] After 11314ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :1 sat :8
[2023-03-15 11:55:37] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2023-03-15 11:55:37] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 1 ms to minimize.
[2023-03-15 11:55:37] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 1 ms to minimize.
[2023-03-15 11:55:38] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 0 ms to minimize.
[2023-03-15 11:55:38] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 0 ms to minimize.
[2023-03-15 11:55:38] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 1 ms to minimize.
[2023-03-15 11:55:38] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 1 ms to minimize.
[2023-03-15 11:55:38] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 1 ms to minimize.
[2023-03-15 11:55:39] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 1 ms to minimize.
[2023-03-15 11:55:39] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 1 ms to minimize.
[2023-03-15 11:55:40] [INFO ] Deduced a trap composed of 71 places in 201 ms of which 0 ms to minimize.
[2023-03-15 11:55:40] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 1 ms to minimize.
[2023-03-15 11:55:40] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 7 ms to minimize.
[2023-03-15 11:55:41] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 0 ms to minimize.
[2023-03-15 11:55:41] [INFO ] Deduced a trap composed of 84 places in 240 ms of which 1 ms to minimize.
[2023-03-15 11:55:41] [INFO ] Deduced a trap composed of 77 places in 221 ms of which 0 ms to minimize.
[2023-03-15 11:55:42] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 1 ms to minimize.
[2023-03-15 11:55:42] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 0 ms to minimize.
[2023-03-15 11:55:42] [INFO ] Deduced a trap composed of 82 places in 252 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 11:55:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 11:55:42] [INFO ] After 25123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 real:8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 12046 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 534/534 transitions.
Graph (complete) has 1661 edges and 557 vertex of which 556 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 556 transition count 533
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 80 place count 556 transition count 455
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 158 place count 478 transition count 455
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 238 place count 478 transition count 455
Applied a total of 238 rules in 35 ms. Remains 478 /557 variables (removed 79) and now considering 455/534 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 478/557 places, 455/534 transitions.
Incomplete random walk after 10000 steps, including 1256 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 845 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 814 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 117750 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117750 steps, saw 58930 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 455 rows 478 cols
[2023-03-15 11:55:59] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 11:55:59] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-15 11:56:01] [INFO ] After 1805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 11:56:01] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:56:04] [INFO ] After 2399ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-15 11:56:04] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 1 ms to minimize.
[2023-03-15 11:56:04] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 1 ms to minimize.
[2023-03-15 11:56:04] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 0 ms to minimize.
[2023-03-15 11:56:04] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 0 ms to minimize.
[2023-03-15 11:56:05] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 1 ms to minimize.
[2023-03-15 11:56:05] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 0 ms to minimize.
[2023-03-15 11:56:05] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 1 ms to minimize.
[2023-03-15 11:56:06] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 1 ms to minimize.
[2023-03-15 11:56:06] [INFO ] Deduced a trap composed of 74 places in 252 ms of which 1 ms to minimize.
[2023-03-15 11:56:06] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 1 ms to minimize.
[2023-03-15 11:56:06] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 1 ms to minimize.
[2023-03-15 11:56:07] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 1 ms to minimize.
[2023-03-15 11:56:07] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 1 ms to minimize.
[2023-03-15 11:56:07] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:56:08] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 0 ms to minimize.
[2023-03-15 11:56:08] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 0 ms to minimize.
[2023-03-15 11:56:08] [INFO ] Deduced a trap composed of 17 places in 304 ms of which 1 ms to minimize.
[2023-03-15 11:56:09] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 2 ms to minimize.
[2023-03-15 11:56:09] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 1 ms to minimize.
[2023-03-15 11:56:10] [INFO ] Deduced a trap composed of 105 places in 339 ms of which 1 ms to minimize.
[2023-03-15 11:56:10] [INFO ] Deduced a trap composed of 86 places in 297 ms of which 1 ms to minimize.
[2023-03-15 11:56:10] [INFO ] Deduced a trap composed of 80 places in 340 ms of which 1 ms to minimize.
[2023-03-15 11:56:11] [INFO ] Deduced a trap composed of 11 places in 471 ms of which 1 ms to minimize.
[2023-03-15 11:56:11] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7334 ms
[2023-03-15 11:56:13] [INFO ] After 11342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 851 ms.
[2023-03-15 11:56:13] [INFO ] After 14224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 8000 ms.
Support contains 4 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 478/478 places, 455/455 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 455/455 transitions.
Applied a total of 0 rules in 10 ms. Remains 478 /478 variables (removed 0) and now considering 455/455 (removed 0) transitions.
// Phase 1: matrix 455 rows 478 cols
[2023-03-15 11:56:21] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 11:56:22] [INFO ] Implicit Places using invariants in 716 ms returned []
// Phase 1: matrix 455 rows 478 cols
[2023-03-15 11:56:22] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-15 11:56:23] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:56:53] [INFO ] Performed 339/478 implicitness test of which 2 returned IMPLICIT in 30 seconds.
[2023-03-15 11:56:59] [INFO ] Implicit Places using invariants and state equation in 37056 ms returned [42, 48, 416, 422, 444, 449, 470, 476]
Discarding 8 places :
Implicit Place search using SMT with State Equation took 37774 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/478 places, 455/455 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 470 transition count 451
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 466 transition count 451
Applied a total of 8 rules in 21 ms. Remains 466 /470 variables (removed 4) and now considering 451/455 (removed 4) transitions.
// Phase 1: matrix 451 rows 466 cols
[2023-03-15 11:56:59] [INFO ] Computed 91 place invariants in 66 ms
[2023-03-15 11:57:01] [INFO ] Implicit Places using invariants in 1984 ms returned [65, 70, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 307, 312, 333, 338, 359, 365, 386, 389, 393, 444]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1994 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 438/478 places, 451/455 transitions.
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 438 transition count 437
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 28 place count 424 transition count 437
Applied a total of 28 rules in 30 ms. Remains 424 /438 variables (removed 14) and now considering 437/451 (removed 14) transitions.
// Phase 1: matrix 437 rows 424 cols
[2023-03-15 11:57:01] [INFO ] Computed 63 place invariants in 125 ms
[2023-03-15 11:57:02] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-15 11:57:02] [INFO ] Invariant cache hit.
[2023-03-15 11:57:03] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-15 11:57:32] [INFO ] Implicit Places using invariants and state equation in 30216 ms returned []
Implicit Place search using SMT with State Equation took 31175 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 424/478 places, 437/455 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 71005 ms. Remains : 424/478 places, 437/455 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (OR (NOT p0) p2)), (X (NOT (AND p0 (NOT p1)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 2902 ms. Reduced automaton from 7 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 452 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 447 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Stuttering acceptance computed with spot in 466 ms :[p2, p2, (AND p1 p2), (AND p2 p0 p1), (AND p2 p0 p1), (AND p0 p2), (AND p0 p2)]
Product exploration explored 100000 steps with 34170 reset in 723 ms.
Product exploration explored 100000 steps with 34109 reset in 462 ms.
Support contains 4 out of 557 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 557/557 places, 534/534 transitions.
Applied a total of 0 rules in 7 ms. Remains 557 /557 variables (removed 0) and now considering 534/534 (removed 0) transitions.
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:57:38] [INFO ] Invariants computation overflowed in 40 ms
[2023-03-15 11:57:39] [INFO ] Implicit Places using invariants in 560 ms returned []
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:57:39] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 11:57:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-15 11:57:54] [INFO ] Implicit Places using invariants and state equation in 15359 ms returned []
Implicit Place search using SMT with State Equation took 15931 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 557 cols
[2023-03-15 11:57:54] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-15 11:57:54] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16412 ms. Remains : 557/557 places, 534/534 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-08 finished in 515267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : DoubleExponent-PT-020-LTLFireability-12
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1060/1060 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1059 transition count 762
Reduce places removed 235 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 237 rules applied. Total rules applied 472 place count 824 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 474 place count 822 transition count 760
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 474 place count 822 transition count 719
Deduced a syphon composed of 41 places in 14 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 556 place count 781 transition count 719
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 5 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 920 place count 599 transition count 537
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 996 place count 561 transition count 537
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 997 place count 560 transition count 536
Applied a total of 997 rules in 134 ms. Remains 560 /1060 variables (removed 500) and now considering 536/998 (removed 462) transitions.
// Phase 1: matrix 536 rows 560 cols
[2023-03-15 11:57:55] [INFO ] Computed 101 place invariants in 97 ms
[2023-03-15 11:57:56] [INFO ] Implicit Places using invariants in 825 ms returned [15, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 834 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 558/1060 places, 536/998 transitions.
Graph (complete) has 1744 edges and 558 vertex of which 557 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 554 transition count 532
Applied a total of 7 rules in 26 ms. Remains 554 /558 variables (removed 4) and now considering 532/536 (removed 4) transitions.
// Phase 1: matrix 532 rows 554 cols
[2023-03-15 11:57:56] [INFO ] Computed 99 place invariants in 57 ms
[2023-03-15 11:57:56] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-15 11:57:56] [INFO ] Invariant cache hit.
[2023-03-15 11:57:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:58:16] [INFO ] Implicit Places using invariants and state equation in 19434 ms returned []
Implicit Place search using SMT with State Equation took 19992 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 554/1060 places, 532/998 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 20986 ms. Remains : 554/1060 places, 532/998 transitions.
Running random walk in product with property : DoubleExponent-PT-020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s344 1) (LT s350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 304 ms.
Product exploration explored 100000 steps with 20000 reset in 329 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 787 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 282311 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 282311 steps, saw 141208 distinct states, run finished after 3003 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 11:58:20] [INFO ] Invariant cache hit.
[2023-03-15 11:58:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 11:58:20] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 58 ms returned sat
[2023-03-15 11:58:20] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:58:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 11:58:21] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 68 ms returned sat
[2023-03-15 11:58:21] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:58:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 11:58:23] [INFO ] After 1422ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:58:23] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 1 ms to minimize.
[2023-03-15 11:58:23] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 1 ms to minimize.
[2023-03-15 11:58:23] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 0 ms to minimize.
[2023-03-15 11:58:23] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 0 ms to minimize.
[2023-03-15 11:58:24] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 1 ms to minimize.
[2023-03-15 11:58:24] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 1 ms to minimize.
[2023-03-15 11:58:24] [INFO ] Deduced a trap composed of 55 places in 267 ms of which 1 ms to minimize.
[2023-03-15 11:58:24] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 1 ms to minimize.
[2023-03-15 11:58:25] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 0 ms to minimize.
[2023-03-15 11:58:25] [INFO ] Deduced a trap composed of 38 places in 272 ms of which 1 ms to minimize.
[2023-03-15 11:58:25] [INFO ] Deduced a trap composed of 34 places in 275 ms of which 0 ms to minimize.
[2023-03-15 11:58:26] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:58:26] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:58:26] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 0 ms to minimize.
[2023-03-15 11:58:27] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 1 ms to minimize.
[2023-03-15 11:58:27] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2023-03-15 11:58:27] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 10 ms to minimize.
[2023-03-15 11:58:28] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 1 ms to minimize.
[2023-03-15 11:58:28] [INFO ] Deduced a trap composed of 18 places in 322 ms of which 1 ms to minimize.
[2023-03-15 11:58:28] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 0 ms to minimize.
[2023-03-15 11:58:29] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 1 ms to minimize.
[2023-03-15 11:58:29] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 0 ms to minimize.
[2023-03-15 11:58:29] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6654 ms
[2023-03-15 11:58:29] [INFO ] After 8122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-15 11:58:29] [INFO ] After 8885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 692 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1662 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 476 transition count 454
Applied a total of 236 rules in 37 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 843 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 336664 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 336664 steps, saw 168432 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:58:33] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:58:34] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:58:34] [INFO ] After 542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:58:34] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:58:36] [INFO ] After 1089ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:58:36] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 1 ms to minimize.
[2023-03-15 11:58:36] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 1 ms to minimize.
[2023-03-15 11:58:36] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 1 ms to minimize.
[2023-03-15 11:58:36] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 1 ms to minimize.
[2023-03-15 11:58:37] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 1 ms to minimize.
[2023-03-15 11:58:37] [INFO ] Deduced a trap composed of 28 places in 273 ms of which 1 ms to minimize.
[2023-03-15 11:58:37] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 1 ms to minimize.
[2023-03-15 11:58:38] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 1 ms to minimize.
[2023-03-15 11:58:38] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 1 ms to minimize.
[2023-03-15 11:58:38] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2023-03-15 11:58:39] [INFO ] Deduced a trap composed of 15 places in 332 ms of which 1 ms to minimize.
[2023-03-15 11:58:39] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 1 ms to minimize.
[2023-03-15 11:58:39] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2023-03-15 11:58:40] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 1 ms to minimize.
[2023-03-15 11:58:40] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4390 ms
[2023-03-15 11:58:40] [INFO ] After 5533ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-15 11:58:40] [INFO ] After 6315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1104 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 10 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:58:41] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:58:42] [INFO ] Implicit Places using invariants in 711 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 11:58:42] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:58:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:59:07] [INFO ] Implicit Places using invariants and state equation in 25477 ms returned [94, 177, 259, 282, 287, 308, 314, 335, 361, 367, 388, 390, 394, 414, 420, 442, 447, 451, 468, 474]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 26191 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 456/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 456 transition count 446
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 448 transition count 446
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 448 transition count 446
Applied a total of 20 rules in 31 ms. Remains 448 /456 variables (removed 8) and now considering 446/454 (removed 8) transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:59:07] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 11:59:08] [INFO ] Implicit Places using invariants in 579 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:59:08] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 11:59:08] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:59:38] [INFO ] Performed 413/448 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 11:59:41] [INFO ] Implicit Places using invariants and state equation in 32895 ms returned []
Implicit Place search using SMT with State Equation took 33494 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 448/476 places, 446/454 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 59728 ms. Remains : 448/476 places, 446/454 transitions.
Incomplete random walk after 10000 steps, including 1266 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 341518 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341518 steps, saw 170826 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:59:44] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-15 11:59:45] [INFO ] After 623ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 11:59:45] [INFO ] After 597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 11:59:45] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 11:59:46] [INFO ] After 984ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 11:59:47] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 1 ms to minimize.
[2023-03-15 11:59:47] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 1 ms to minimize.
[2023-03-15 11:59:47] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 0 ms to minimize.
[2023-03-15 11:59:47] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 1 ms to minimize.
[2023-03-15 11:59:48] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 1 ms to minimize.
[2023-03-15 11:59:48] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 1 ms to minimize.
[2023-03-15 11:59:48] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 1 ms to minimize.
[2023-03-15 11:59:48] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 1 ms to minimize.
[2023-03-15 11:59:49] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 1 ms to minimize.
[2023-03-15 11:59:49] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 1 ms to minimize.
[2023-03-15 11:59:49] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 1 ms to minimize.
[2023-03-15 11:59:50] [INFO ] Deduced a trap composed of 22 places in 295 ms of which 1 ms to minimize.
[2023-03-15 11:59:50] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 0 ms to minimize.
[2023-03-15 11:59:50] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 1 ms to minimize.
[2023-03-15 11:59:51] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 1 ms to minimize.
[2023-03-15 11:59:51] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2023-03-15 11:59:51] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4869 ms
[2023-03-15 11:59:51] [INFO ] After 5919ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 139 ms.
[2023-03-15 11:59:51] [INFO ] After 6758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 953 ms.
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 448/448 places, 446/446 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 446/446 transitions.
Applied a total of 0 rules in 15 ms. Remains 448 /448 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:59:52] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 11:59:53] [INFO ] Implicit Places using invariants in 1016 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 11:59:53] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 11:59:54] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 12:00:24] [INFO ] Performed 441/448 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 12:00:25] [INFO ] Implicit Places using invariants and state equation in 31995 ms returned []
Implicit Place search using SMT with State Equation took 33017 ms to find 0 implicit places.
[2023-03-15 12:00:25] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 446 rows 448 cols
[2023-03-15 12:00:25] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-15 12:00:26] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33403 ms. Remains : 448/448 places, 446/446 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 12 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-15 12:00:26] [INFO ] Invariant cache hit.
[2023-03-15 12:00:27] [INFO ] Implicit Places using invariants in 807 ms returned []
[2023-03-15 12:00:27] [INFO ] Invariant cache hit.
[2023-03-15 12:00:28] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 12:00:51] [INFO ] Implicit Places using invariants and state equation in 23630 ms returned []
Implicit Place search using SMT with State Equation took 24442 ms to find 0 implicit places.
[2023-03-15 12:00:51] [INFO ] Invariant cache hit.
[2023-03-15 12:00:51] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24892 ms. Remains : 554/554 places, 532/532 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 1740 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1384 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 797 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267808 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267808 steps, saw 133939 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 12:00:55] [INFO ] Invariant cache hit.
[2023-03-15 12:00:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 12:00:55] [INFO ] [Real]Absence check using 2 positive and 97 generalized place invariants in 59 ms returned sat
[2023-03-15 12:00:55] [INFO ] After 722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:00:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-15 12:00:55] [INFO ] [Nat]Absence check using 2 positive and 97 generalized place invariants in 76 ms returned sat
[2023-03-15 12:00:56] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:00:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 12:00:57] [INFO ] After 1285ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:00:57] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
[2023-03-15 12:00:58] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 1 ms to minimize.
[2023-03-15 12:00:58] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 0 ms to minimize.
[2023-03-15 12:00:58] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 0 ms to minimize.
[2023-03-15 12:00:58] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:00:58] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 1 ms to minimize.
[2023-03-15 12:00:59] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 0 ms to minimize.
[2023-03-15 12:00:59] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 0 ms to minimize.
[2023-03-15 12:00:59] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 0 ms to minimize.
[2023-03-15 12:00:59] [INFO ] Deduced a trap composed of 38 places in 240 ms of which 1 ms to minimize.
[2023-03-15 12:01:00] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 1 ms to minimize.
[2023-03-15 12:01:00] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 1 ms to minimize.
[2023-03-15 12:01:00] [INFO ] Deduced a trap composed of 32 places in 284 ms of which 0 ms to minimize.
[2023-03-15 12:01:01] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 1 ms to minimize.
[2023-03-15 12:01:01] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2023-03-15 12:01:01] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 1 ms to minimize.
[2023-03-15 12:01:02] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 1 ms to minimize.
[2023-03-15 12:01:02] [INFO ] Deduced a trap composed of 22 places in 305 ms of which 1 ms to minimize.
[2023-03-15 12:01:03] [INFO ] Deduced a trap composed of 18 places in 326 ms of which 1 ms to minimize.
[2023-03-15 12:01:03] [INFO ] Deduced a trap composed of 18 places in 310 ms of which 1 ms to minimize.
[2023-03-15 12:01:03] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 1 ms to minimize.
[2023-03-15 12:01:04] [INFO ] Deduced a trap composed of 14 places in 318 ms of which 1 ms to minimize.
[2023-03-15 12:01:04] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6487 ms
[2023-03-15 12:01:04] [INFO ] After 7825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 12:01:04] [INFO ] After 8613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 779 ms.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 532/532 transitions.
Graph (complete) has 1662 edges and 554 vertex of which 553 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 553 transition count 531
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 1 with 77 rules applied. Total rules applied 79 place count 553 transition count 454
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 156 place count 476 transition count 454
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 2 with 80 rules applied. Total rules applied 236 place count 476 transition count 454
Applied a total of 236 rules in 38 ms. Remains 476 /554 variables (removed 78) and now considering 454/532 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 476/554 places, 454/532 transitions.
Incomplete random walk after 10000 steps, including 1264 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 880 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 324128 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324128 steps, saw 162165 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 12:01:08] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 12:01:08] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:01:09] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:01:09] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 12:01:10] [INFO ] After 1043ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:01:10] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 0 ms to minimize.
[2023-03-15 12:01:10] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2023-03-15 12:01:11] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 1 ms to minimize.
[2023-03-15 12:01:11] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2023-03-15 12:01:11] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 0 ms to minimize.
[2023-03-15 12:01:12] [INFO ] Deduced a trap composed of 28 places in 290 ms of which 1 ms to minimize.
[2023-03-15 12:01:12] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 0 ms to minimize.
[2023-03-15 12:01:12] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 1 ms to minimize.
[2023-03-15 12:01:13] [INFO ] Deduced a trap composed of 25 places in 299 ms of which 1 ms to minimize.
[2023-03-15 12:01:13] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 1 ms to minimize.
[2023-03-15 12:01:13] [INFO ] Deduced a trap composed of 15 places in 299 ms of which 0 ms to minimize.
[2023-03-15 12:01:14] [INFO ] Deduced a trap composed of 16 places in 320 ms of which 1 ms to minimize.
[2023-03-15 12:01:14] [INFO ] Deduced a trap composed of 13 places in 327 ms of which 0 ms to minimize.
[2023-03-15 12:01:14] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 1 ms to minimize.
[2023-03-15 12:01:14] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4243 ms
[2023-03-15 12:01:14] [INFO ] After 5342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-15 12:01:15] [INFO ] After 6122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1101 ms.
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 476/476 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 454/454 transitions.
Applied a total of 0 rules in 11 ms. Remains 476 /476 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 12:01:16] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-15 12:01:17] [INFO ] Implicit Places using invariants in 1042 ms returned []
// Phase 1: matrix 454 rows 476 cols
[2023-03-15 12:01:17] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 12:01:17] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 12:01:37] [INFO ] Implicit Places using invariants and state equation in 20360 ms returned [42, 172, 177, 198, 211, 225, 282, 287, 308, 335, 340, 361, 388, 390, 394, 414, 442, 447, 468, 474]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 21427 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 456/476 places, 454/454 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 456 transition count 448
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 450 transition count 448
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 450 transition count 448
Applied a total of 20 rules in 35 ms. Remains 450 /456 variables (removed 6) and now considering 448/454 (removed 6) transitions.
// Phase 1: matrix 448 rows 450 cols
[2023-03-15 12:01:37] [INFO ] Computed 79 place invariants in 100 ms
[2023-03-15 12:01:39] [INFO ] Implicit Places using invariants in 2268 ms returned [47, 67, 72, 93, 98, 118, 124, 145, 150, 151, 199, 223, 246, 252, 303, 352, 400, 428]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 2280 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 432/476 places, 448/454 transitions.
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 432 transition count 435
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 26 place count 419 transition count 435
Applied a total of 26 rules in 41 ms. Remains 419 /432 variables (removed 13) and now considering 435/448 (removed 13) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 12:01:39] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 12:01:40] [INFO ] Implicit Places using invariants in 601 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 12:01:40] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 12:01:40] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 12:02:05] [INFO ] Implicit Places using invariants and state equation in 24508 ms returned []
Implicit Place search using SMT with State Equation took 25125 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 419/476 places, 435/454 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 48919 ms. Remains : 419/476 places, 435/454 transitions.
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 347237 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 347237 steps, saw 173651 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 12:02:08] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 12:02:08] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 12:02:09] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 12:02:09] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 12:02:09] [INFO ] After 455ms SMT Verify possible using 77 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 12:02:09] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 0 ms to minimize.
[2023-03-15 12:02:10] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 0 ms to minimize.
[2023-03-15 12:02:10] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 1 ms to minimize.
[2023-03-15 12:02:10] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 1 ms to minimize.
[2023-03-15 12:02:10] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 1 ms to minimize.
[2023-03-15 12:02:10] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2023-03-15 12:02:11] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 0 ms to minimize.
[2023-03-15 12:02:11] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 0 ms to minimize.
[2023-03-15 12:02:11] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 1 ms to minimize.
[2023-03-15 12:02:11] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2023-03-15 12:02:12] [INFO ] Deduced a trap composed of 22 places in 275 ms of which 0 ms to minimize.
[2023-03-15 12:02:12] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 3 ms to minimize.
[2023-03-15 12:02:12] [INFO ] Deduced a trap composed of 12 places in 261 ms of which 1 ms to minimize.
[2023-03-15 12:02:12] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3180 ms
[2023-03-15 12:02:12] [INFO ] After 3705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 232 ms.
[2023-03-15 12:02:13] [INFO ] After 4481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 944 ms.
Support contains 2 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 419/419 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 419 /419 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 12:02:14] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 12:02:14] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 12:02:14] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 12:02:14] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-15 12:02:44] [INFO ] Performed 391/419 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 12:02:47] [INFO ] Implicit Places using invariants and state equation in 32631 ms returned []
Implicit Place search using SMT with State Equation took 33064 ms to find 0 implicit places.
[2023-03-15 12:02:47] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 435 rows 419 cols
[2023-03-15 12:02:47] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-15 12:02:47] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33536 ms. Remains : 419/419 places, 435/435 transitions.
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 524 ms.
Product exploration explored 100000 steps with 20000 reset in 450 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 11 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-15 12:02:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 532 rows 554 cols
[2023-03-15 12:02:49] [INFO ] Computed 99 place invariants in 58 ms
[2023-03-15 12:02:50] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 554/554 places, 532/532 transitions.
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 532/532 transitions.
Applied a total of 0 rules in 12 ms. Remains 554 /554 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2023-03-15 12:02:50] [INFO ] Invariant cache hit.
[2023-03-15 12:02:51] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-15 12:02:51] [INFO ] Invariant cache hit.
[2023-03-15 12:02:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-15 12:03:15] [INFO ] Implicit Places using invariants and state equation in 24179 ms returned []
Implicit Place search using SMT with State Equation took 24932 ms to find 0 implicit places.
[2023-03-15 12:03:15] [INFO ] Invariant cache hit.
[2023-03-15 12:03:16] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25515 ms. Remains : 554/554 places, 532/532 transitions.
Treatment of property DoubleExponent-PT-020-LTLFireability-12 finished in 321092 ms.
[2023-03-15 12:03:16] [INFO ] Flatten gal took : 121 ms
[2023-03-15 12:03:16] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-15 12:03:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1060 places, 998 transitions and 2810 arcs took 34 ms.
Total runtime 3054009 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5457/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5457/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5457/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5457/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5457/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-020-LTLFireability-00
Could not compute solution for formula : DoubleExponent-PT-020-LTLFireability-04
Could not compute solution for formula : DoubleExponent-PT-020-LTLFireability-07
Could not compute solution for formula : DoubleExponent-PT-020-LTLFireability-08
Could not compute solution for formula : DoubleExponent-PT-020-LTLFireability-12
BK_STOP 1678881800616
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DoubleExponent-PT-020-LTLFireability-00
ltl formula formula --ltl=/tmp/5457/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 1060 places, 998 transitions and 2810 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.450 real 0.040 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5457/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5457/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5457/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5457/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name DoubleExponent-PT-020-LTLFireability-04
ltl formula formula --ltl=/tmp/5457/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1060 places, 998 transitions and 2810 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.150 real 0.040 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5457/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5457/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5457/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5457/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
malloc_consolidate(): invalid chunk size
ltl formula name DoubleExponent-PT-020-LTLFireability-07
ltl formula formula --ltl=/tmp/5457/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: =============================================================================
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 1060 places, 998 transitions and 2810 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.370 real 0.060 user 0.060 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5457/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5457/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5457/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5457/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** 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:
0: pnml2lts-mc(+0xa23f4) [0x561cefb2e3f4]
1: pnml2lts-mc(+0xa2496) [0x561cefb2e496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f3231486140]
3: pnml2lts-mc(+0x405be5) [0x561cefe91be5]
4: pnml2lts-mc(+0x16b3f9) [0x561cefbf73f9]
5: pnml2lts-mc(+0x164ac4) [0x561cefbf0ac4]
6: pnml2lts-mc(+0x272e0a) [0x561cefcfee0a]
7: pnml2lts-mc(+0xb61f0) [0x561cefb421f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f32312d94d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f32312d967a]
10: pnml2lts-mc(+0xa1581) [0x561cefb2d581]
11: pnml2lts-mc(+0xa1910) [0x561cefb2d910]
12: pnml2lts-mc(+0xa32a2) [0x561cefb2f2a2]
13: pnml2lts-mc(+0xa50f4) [0x561cefb310f4]
14: pnml2lts-mc(+0xa516b) [0x561cefb3116b]
15: pnml2lts-mc(+0x3f34b3) [0x561cefe7f4b3]
16: pnml2lts-mc(+0x7c63d) [0x561cefb0863d]
17: pnml2lts-mc(+0x67d86) [0x561cefaf3d86]
18: pnml2lts-mc(+0x60a8a) [0x561cefaeca8a]
19: pnml2lts-mc(+0x5eb15) [0x561cefaeab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f32312c1d0a]
21: pnml2lts-mc(+0x6075e) [0x561cefaec75e]
ltl formula name DoubleExponent-PT-020-LTLFireability-08
ltl formula formula --ltl=/tmp/5457/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 1060 places, 998 transitions and 2810 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.130 real 0.030 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5457/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5457/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5457/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5457/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DoubleExponent-PT-020-LTLFireability-12
ltl formula formula --ltl=/tmp/5457/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1060 places, 998 transitions and 2810 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.300 real 0.030 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5457/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5457/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5457/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5457/ltl_4_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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="DoubleExponent-PT-020"
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 DoubleExponent-PT-020, 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 r137-smll-167819418600484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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 ;