About the Execution of LTSMin+red for DoubleExponent-PT-100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2086.691 | 1751380.00 | 1899721.00 | 5244.60 | FFFF?F?FTT??FTTF | 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-167819418600492.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-100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418600492
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:30 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.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 6.8K Feb 26 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:31 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 1.8M 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-100-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678887530978
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-100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 13:38:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 13:38:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 13:38:55] [INFO ] Load time of PNML (sax parser for PT used): 526 ms
[2023-03-15 13:38:55] [INFO ] Transformed 5304 places.
[2023-03-15 13:38:55] [INFO ] Transformed 4998 transitions.
[2023-03-15 13:38:55] [INFO ] Parsed PT model containing 5304 places and 4998 transitions and 14094 arcs in 758 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-100-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 5304 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 5300 transition count 4998
Applied a total of 4 rules in 1511 ms. Remains 5300 /5304 variables (removed 4) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:38:58] [INFO ] Invariants computation overflowed in 355 ms
[2023-03-15 13:39:00] [INFO ] Implicit Places using invariants in 1682 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:39:00] [INFO ] Invariants computation overflowed in 271 ms
[2023-03-15 13:39:02] [INFO ] Implicit Places using invariants and state equation in 2073 ms returned []
Implicit Place search using SMT with State Equation took 3810 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:39:02] [INFO ] Invariants computation overflowed in 124 ms
[2023-03-15 13:39:03] [INFO ] Dead Transitions using invariants and state equation in 892 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5300/5304 places, 4998/4998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6220 ms. Remains : 5300/5304 places, 4998/4998 transitions.
Support contains 45 out of 5300 places after structural reductions.
[2023-03-15 13:39:04] [INFO ] Flatten gal took : 592 ms
[2023-03-15 13:39:05] [INFO ] Flatten gal took : 239 ms
[2023-03-15 13:39:05] [INFO ] Input system was already deterministic with 4998 transitions.
Support contains 42 out of 5300 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 333 resets, run finished after 1073 ms. (steps per millisecond=9 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 75 ms. (steps per millisecond=13 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 72602 steps, run timeout after 6001 ms. (steps per millisecond=12 ) properties seen :{}
Probabilistic random walk after 72602 steps, saw 36310 distinct states, run finished after 6005 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:39:15] [INFO ] Invariants computation overflowed in 186 ms
[2023-03-15 13:39:40] [INFO ] After 15395ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27 real:1
[2023-03-15 13:39:40] [INFO ] After 15406ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :27 real:1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-15 13:39:40] [INFO ] After 25054ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :27 real:1
[2023-03-15 13:40:05] [INFO ] After 16250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-15 13:40:05] [INFO ] After 16251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 13:40:05] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 42 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 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 1152 transitions
Trivial Post-agglo rules discarded 1152 transitions
Performed 1152 trivial Post agglomeration. Transition count delta: 1152
Iterating post reduction 0 with 1155 rules applied. Total rules applied 1156 place count 5297 transition count 3844
Reduce places removed 1152 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 1166 rules applied. Total rules applied 2322 place count 4145 transition count 3830
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 2336 place count 4131 transition count 3830
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 2336 place count 4131 transition count 3627
Deduced a syphon composed of 203 places in 266 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 2742 place count 3928 transition count 3627
Performed 886 Post agglomeration using F-continuation condition.Transition count delta: 886
Deduced a syphon composed of 886 places in 97 ms
Reduce places removed 886 places and 0 transitions.
Iterating global reduction 3 with 1772 rules applied. Total rules applied 4514 place count 3042 transition count 2741
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 87 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4716 place count 2941 transition count 2741
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 207 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 4902 place count 2848 transition count 2741
Free-agglomeration rule (complex) applied 401 times.
Iterating global reduction 3 with 401 rules applied. Total rules applied 5303 place count 2848 transition count 2340
Reduce places removed 401 places and 0 transitions.
Iterating post reduction 3 with 401 rules applied. Total rules applied 5704 place count 2447 transition count 2340
Partial Free-agglomeration rule applied 405 times.
Drop transitions removed 405 transitions
Iterating global reduction 4 with 405 rules applied. Total rules applied 6109 place count 2447 transition count 2340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6110 place count 2446 transition count 2339
Applied a total of 6110 rules in 3328 ms. Remains 2446 /5300 variables (removed 2854) and now considering 2339/4998 (removed 2659) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3330 ms. Remains : 2446/5300 places, 2339/4998 transitions.
Incomplete random walk after 10000 steps, including 1283 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 76 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) 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 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 29) seen :0
Interrupted probabilistic random walk after 57511 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57511 steps, saw 28797 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-15 13:40:13] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 13:40:38] [INFO ] After 20630ms SMT Verify possible using state equation in real domain returned unsat :0 sat :27 real:1
[2023-03-15 13:40:38] [INFO ] State equation strengthened by 390 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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 13:40:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:40:38] [INFO ] After 25053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 42 out of 2446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2446/2446 places, 2339/2339 transitions.
Applied a total of 0 rules in 221 ms. Remains 2446 /2446 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 2446/2446 places, 2339/2339 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2446/2446 places, 2339/2339 transitions.
Applied a total of 0 rules in 281 ms. Remains 2446 /2446 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-15 13:40:39] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-15 13:40:51] [INFO ] Implicit Places using invariants in 12334 ms returned []
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-15 13:40:51] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 13:41:03] [INFO ] Implicit Places using invariants and state equation in 11992 ms returned []
Implicit Place search using SMT with State Equation took 24332 ms to find 0 implicit places.
[2023-03-15 13:41:03] [INFO ] Redundant transitions in 306 ms returned []
// Phase 1: matrix 2339 rows 2446 cols
[2023-03-15 13:41:03] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 13:41:06] [INFO ] Dead Transitions using invariants and state equation in 2596 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27535 ms. Remains : 2446/2446 places, 2339/2339 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.44 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&&(G(p1)||(p1&&F(p2)))))))'
Support contains 2 out of 5300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1428 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:41:08] [INFO ] Invariants computation overflowed in 108 ms
[2023-03-15 13:41:08] [INFO ] Implicit Places using invariants in 739 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:41:08] [INFO ] Invariants computation overflowed in 109 ms
[2023-03-15 13:41:10] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:41:10] [INFO ] Invariants computation overflowed in 107 ms
[2023-03-15 13:41:16] [INFO ] Dead Transitions using invariants and state equation in 5868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9672 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 414 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s3932 1), p1:(GEQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 3 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-01 finished in 10794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0)) U p1)) U X(X(p2))))'
Support contains 5 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1537 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:41:19] [INFO ] Invariants computation overflowed in 109 ms
[2023-03-15 13:41:19] [INFO ] Implicit Places using invariants in 890 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:41:20] [INFO ] Invariants computation overflowed in 177 ms
[2023-03-15 13:41:21] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:41:21] [INFO ] Invariants computation overflowed in 108 ms
[2023-03-15 13:41:27] [INFO ] Dead Transitions using invariants and state equation in 6296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10428 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 558 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 7}, { cond=(NOT p2), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 7}, { cond=true, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s234 1) (GEQ s304 1)), p2:(GEQ s5037 1), p0:(AND (GEQ s2309 1) (GEQ s2317 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-02 finished in 11663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Support contains 7 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1190 transitions
Trivial Post-agglo rules discarded 1190 transitions
Performed 1190 trivial Post agglomeration. Transition count delta: 1190
Iterating post reduction 0 with 1190 rules applied. Total rules applied 1190 place count 5299 transition count 3807
Reduce places removed 1190 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2384 place count 4109 transition count 3803
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2388 place count 4105 transition count 3803
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 2388 place count 4105 transition count 3602
Deduced a syphon composed of 201 places in 340 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 93 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 79 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 100 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 4988 place count 2805 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2804 transition count 2700
Applied a total of 4989 rules in 2302 ms. Remains 2804 /5300 variables (removed 2496) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:41:31] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-15 13:41:34] [INFO ] Implicit Places using invariants in 3346 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:41:34] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-15 13:41:38] [INFO ] Implicit Places using invariants and state equation in 4077 ms returned []
Implicit Place search using SMT with State Equation took 7426 ms to find 0 implicit places.
[2023-03-15 13:41:39] [INFO ] Redundant transitions in 199 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:41:39] [INFO ] Invariants computation overflowed in 108 ms
[2023-03-15 13:41:42] [INFO ] Dead Transitions using invariants and state equation in 3005 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12959 ms. Remains : 2804/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1541 1), p1:(AND (GEQ s372 1) (GEQ s416 1)), p2:(AND (GEQ s632 1) (GEQ s639 1)), p3:(OR (LT s4 1) (LT s2764 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13856 reset in 691 ms.
Product exploration explored 100000 steps with 13802 reset in 422 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p0 (NOT p1))), (X p0), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 510 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1387 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 778 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 797 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 61825 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61825 steps, saw 30918 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:41:48] [INFO ] Invariants computation overflowed in 106 ms
[2023-03-15 13:42:13] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 13:42:38] [INFO ] After 23944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 13:42:38] [INFO ] State equation strengthened by 196 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 13:42:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:42:38] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 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.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 63 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 1190 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1191 ms. Remains : 2406/2804 places, 2302/2700 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 804 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 839 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 68082 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68082 steps, saw 34051 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-15 13:42:43] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 13:42:51] [INFO ] After 7575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 13:42:51] [INFO ] State equation strengthened by 397 read => feed constraints.
[2023-03-15 13:43:01] [INFO ] After 9254ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 13:43:01] [INFO ] After 17449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 13:43:26] [INFO ] After 24278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
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.verifyPossible(DeadlockTester.java:642)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 13:43:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:43:26] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1971 ms.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 216 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 208 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-15 13:43:28] [INFO ] Invariants computation overflowed in 86 ms
[2023-03-15 13:43:48] [INFO ] Implicit Places using invariants in 19468 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-15 13:43:48] [INFO ] Invariants computation overflowed in 99 ms
[2023-03-15 13:44:08] [INFO ] Implicit Places using invariants and state equation in 20270 ms returned []
Implicit Place search using SMT with State Equation took 39743 ms to find 0 implicit places.
[2023-03-15 13:44:08] [INFO ] Redundant transitions in 119 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-15 13:44:08] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 13:44:11] [INFO ] Dead Transitions using invariants and state equation in 2599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42679 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND p0 (NOT p1))), (X p0), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 585 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 321 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:44:12] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-15 13:44:16] [INFO ] Implicit Places using invariants in 4170 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:44:16] [INFO ] Invariants computation overflowed in 97 ms
[2023-03-15 13:44:20] [INFO ] Implicit Places using invariants and state equation in 4348 ms returned []
Implicit Place search using SMT with State Equation took 8523 ms to find 0 implicit places.
[2023-03-15 13:44:21] [INFO ] Redundant transitions in 223 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:44:21] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-15 13:44:24] [INFO ] Dead Transitions using invariants and state equation in 3423 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12500 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2804 vertex of which 2802 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p1) p0)), (X p0), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 465 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 1395 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 782 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 802 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 806 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 799 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 60820 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60820 steps, saw 30415 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:44:29] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-15 13:44:54] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 13:45:19] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Graph (complete) has 8477 edges and 2804 vertex of which 2802 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.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2802 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2802 transition count 2697
Deduced a syphon composed of 1 places in 60 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2801 transition count 2697
Free-agglomeration rule (complex) applied 395 times.
Iterating global reduction 1 with 395 rules applied. Total rules applied 400 place count 2801 transition count 2302
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 795 place count 2406 transition count 2302
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1194 place count 2406 transition count 2302
Applied a total of 1194 rules in 854 ms. Remains 2406 /2804 variables (removed 398) and now considering 2302/2700 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 856 ms. Remains : 2406/2804 places, 2302/2700 transitions.
Incomplete random walk after 10000 steps, including 1248 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 69904 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69904 steps, saw 34963 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-15 13:45:24] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 13:45:32] [INFO ] After 7186ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-15 13:45:32] [INFO ] State equation strengthened by 397 read => feed constraints.
[2023-03-15 13:45:41] [INFO ] After 9193ms SMT Verify possible using 397 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 13:45:41] [INFO ] After 16934ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 13:46:06] [INFO ] After 24415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
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.verifyPossible(DeadlockTester.java:642)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 13:46:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:46:06] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1368 ms.
Support contains 7 out of 2406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 205 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2406/2406 places, 2302/2302 transitions.
Applied a total of 0 rules in 203 ms. Remains 2406 /2406 variables (removed 0) and now considering 2302/2302 (removed 0) transitions.
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-15 13:46:08] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 13:46:29] [INFO ] Implicit Places using invariants in 21042 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-15 13:46:29] [INFO ] Invariants computation overflowed in 98 ms
[2023-03-15 13:46:30] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 22144 ms to find 0 implicit places.
[2023-03-15 13:46:30] [INFO ] Redundant transitions in 118 ms returned []
// Phase 1: matrix 2302 rows 2406 cols
[2023-03-15 13:46:30] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 13:46:33] [INFO ] Dead Transitions using invariants and state equation in 2334 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24806 ms. Remains : 2406/2406 places, 2302/2302 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (AND (NOT p1) p0)), (X p0), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p3))))), true, (X (X (AND (NOT p1) p0))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 395 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 13972 reset in 273 ms.
Product exploration explored 100000 steps with 13927 reset in 290 ms.
Support contains 7 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 2700/2700 transitions.
Applied a total of 0 rules in 200 ms. Remains 2804 /2804 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:46:34] [INFO ] Invariants computation overflowed in 66 ms
[2023-03-15 13:46:37] [INFO ] Implicit Places using invariants in 3111 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:46:37] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-15 13:46:42] [INFO ] Implicit Places using invariants and state equation in 4380 ms returned []
Implicit Place search using SMT with State Equation took 7493 ms to find 0 implicit places.
[2023-03-15 13:46:42] [INFO ] Redundant transitions in 152 ms returned []
// Phase 1: matrix 2700 rows 2804 cols
[2023-03-15 13:46:42] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-15 13:46:45] [INFO ] Dead Transitions using invariants and state equation in 3052 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10908 ms. Remains : 2804/2804 places, 2700/2700 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-04 finished in 317154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(p2))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 210 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 899 Post agglomeration using F-continuation condition.Transition count delta: 899
Deduced a syphon composed of 899 places in 91 ms
Reduce places removed 899 places and 0 transitions.
Iterating global reduction 2 with 1798 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 72 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 69 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4992 place count 2803 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4993 place count 2802 transition count 2698
Applied a total of 4993 rules in 1757 ms. Remains 2802 /5300 variables (removed 2498) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-15 13:46:48] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-15 13:46:51] [INFO ] Implicit Places using invariants in 3859 ms returned []
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-15 13:46:51] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 13:46:55] [INFO ] Implicit Places using invariants and state equation in 4094 ms returned []
Implicit Place search using SMT with State Equation took 7957 ms to find 0 implicit places.
[2023-03-15 13:46:56] [INFO ] Redundant transitions in 212 ms returned []
// Phase 1: matrix 2698 rows 2802 cols
[2023-03-15 13:46:56] [INFO ] Invariants computation overflowed in 100 ms
[2023-03-15 13:46:59] [INFO ] Dead Transitions using invariants and state equation in 3352 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2802/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13285 ms. Remains : 2802/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s2629 1), p0:(GEQ s917 1), p2:(GEQ s411 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-05 finished in 13409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1199 rules applied. Total rules applied 1199 place count 5299 transition count 3798
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2398 place count 4100 transition count 3798
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2398 place count 4100 transition count 3598
Deduced a syphon composed of 200 places in 259 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2798 place count 3900 transition count 3598
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 87 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4604 place count 2997 transition count 2695
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 68 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4806 place count 2896 transition count 2695
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 65 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5000 place count 2799 transition count 2695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5001 place count 2798 transition count 2694
Applied a total of 5001 rules in 1919 ms. Remains 2798 /5300 variables (removed 2502) and now considering 2694/4998 (removed 2304) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:47:01] [INFO ] Invariants computation overflowed in 81 ms
[2023-03-15 13:47:05] [INFO ] Implicit Places using invariants in 3745 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:47:05] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-15 13:47:09] [INFO ] Implicit Places using invariants and state equation in 3895 ms returned []
Implicit Place search using SMT with State Equation took 7643 ms to find 0 implicit places.
[2023-03-15 13:47:09] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:47:09] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 13:47:12] [INFO ] Dead Transitions using invariants and state equation in 2701 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2798/5300 places, 2694/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12407 ms. Remains : 2798/5300 places, 2694/4998 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s452 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13927 reset in 322 ms.
Product exploration explored 100000 steps with 13868 reset in 264 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1390 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 800 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 84116 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84116 steps, saw 42064 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:47:16] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 13:47:19] [INFO ] After 2399ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 13:47:19] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-15 13:47:28] [INFO ] After 9468ms SMT Verify possible using 198 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-15 13:47:28] [INFO ] After 12386ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8471 edges and 2798 vertex of which 2796 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.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 59 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1197 place count 2399 transition count 2295
Applied a total of 1197 rules in 889 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 889 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1259 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 834 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103043 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103043 steps, saw 51564 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-15 13:47:32] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 13:47:44] [INFO ] After 12316ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 262 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 264 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-15 13:47:45] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 13:48:15] [INFO ] Performed 1700/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 13:48:25] [INFO ] Implicit Places using invariants in 39497 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-15 13:48:25] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 13:48:55] [INFO ] Performed 1675/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 13:49:05] [INFO ] Implicit Places using invariants and state equation in 40643 ms returned []
Implicit Place search using SMT with State Equation took 80145 ms to find 0 implicit places.
[2023-03-15 13:49:05] [INFO ] Redundant transitions in 143 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-15 13:49:05] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 13:49:09] [INFO ] Dead Transitions using invariants and state equation in 4013 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84575 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 310 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:49:10] [INFO ] Invariants computation overflowed in 76 ms
[2023-03-15 13:49:14] [INFO ] Implicit Places using invariants in 3443 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:49:14] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 13:49:15] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 4358 ms to find 0 implicit places.
[2023-03-15 13:49:15] [INFO ] Redundant transitions in 221 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:49:15] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-15 13:49:17] [INFO ] Dead Transitions using invariants and state equation in 2442 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7341 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8871 edges and 2798 vertex of which 2796 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1361 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 848 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 77391 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77391 steps, saw 38701 distinct states, run finished after 3004 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:49:21] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 13:49:24] [INFO ] After 2629ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 13:49:24] [INFO ] State equation strengthened by 198 read => feed constraints.
[2023-03-15 13:49:33] [INFO ] After 9096ms SMT Verify possible using 198 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-15 13:49:33] [INFO ] After 12246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Graph (complete) has 8471 edges and 2798 vertex of which 2796 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.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2796 transition count 2692
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2796 transition count 2691
Deduced a syphon composed of 1 places in 60 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2795 transition count 2691
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2795 transition count 2295
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2399 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 2 with 400 rules applied. Total rules applied 1197 place count 2399 transition count 2295
Applied a total of 1197 rules in 966 ms. Remains 2399 /2798 variables (removed 399) and now considering 2295/2694 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 966 ms. Remains : 2399/2798 places, 2295/2694 transitions.
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99969 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99969 steps, saw 50036 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-15 13:49:37] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 13:49:50] [INFO ] After 12404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 2399 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 265 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2399/2399 places, 2295/2295 transitions.
Applied a total of 0 rules in 269 ms. Remains 2399 /2399 variables (removed 0) and now considering 2295/2295 (removed 0) transitions.
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-15 13:49:50] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-15 13:50:21] [INFO ] Performed 1652/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 13:50:31] [INFO ] Implicit Places using invariants in 40576 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-15 13:50:31] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-15 13:51:02] [INFO ] Performed 1602/2399 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 13:51:13] [INFO ] Implicit Places using invariants and state equation in 41932 ms returned []
Implicit Place search using SMT with State Equation took 82511 ms to find 0 implicit places.
[2023-03-15 13:51:13] [INFO ] Redundant transitions in 186 ms returned []
// Phase 1: matrix 2295 rows 2399 cols
[2023-03-15 13:51:13] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-15 13:51:16] [INFO ] Dead Transitions using invariants and state equation in 3217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86193 ms. Remains : 2399/2399 places, 2295/2295 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13912 reset in 294 ms.
Product exploration explored 100000 steps with 13903 reset in 319 ms.
Support contains 1 out of 2798 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2798/2798 places, 2694/2694 transitions.
Applied a total of 0 rules in 193 ms. Remains 2798 /2798 variables (removed 0) and now considering 2694/2694 (removed 0) transitions.
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:51:17] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 13:51:21] [INFO ] Implicit Places using invariants in 3518 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:51:21] [INFO ] Invariants computation overflowed in 70 ms
[2023-03-15 13:51:25] [INFO ] Implicit Places using invariants and state equation in 4416 ms returned []
Implicit Place search using SMT with State Equation took 7937 ms to find 0 implicit places.
[2023-03-15 13:51:25] [INFO ] Redundant transitions in 134 ms returned []
// Phase 1: matrix 2694 rows 2798 cols
[2023-03-15 13:51:25] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 13:51:29] [INFO ] Dead Transitions using invariants and state equation in 3571 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11848 ms. Remains : 2798/2798 places, 2694/2694 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-06 finished in 270441 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 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3597
Deduced a syphon composed of 202 places in 366 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 2800 place count 3899 transition count 3597
Performed 900 Post agglomeration using F-continuation condition.Transition count delta: 900
Deduced a syphon composed of 900 places in 94 ms
Reduce places removed 900 places and 0 transitions.
Iterating global reduction 2 with 1800 rules applied. Total rules applied 4600 place count 2999 transition count 2697
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 68 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4802 place count 2898 transition count 2697
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 65 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4996 place count 2801 transition count 2697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4997 place count 2800 transition count 2696
Applied a total of 4997 rules in 2098 ms. Remains 2800 /5300 variables (removed 2500) and now considering 2696/4998 (removed 2302) transitions.
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-15 13:51:32] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-15 13:51:35] [INFO ] Implicit Places using invariants in 3436 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-15 13:51:35] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 13:51:36] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 4271 ms to find 0 implicit places.
[2023-03-15 13:51:36] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 2696 rows 2800 cols
[2023-03-15 13:51:36] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 13:51:38] [INFO ] Dead Transitions using invariants and state equation in 2407 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/5300 places, 2696/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8916 ms. Remains : 2800/5300 places, 2696/4998 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-07 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 (GEQ s1811 1) (GEQ s1823 1) (GEQ s440 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-07 finished in 9038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1456 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:51:40] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-15 13:51:41] [INFO ] Implicit Places using invariants in 777 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:51:41] [INFO ] Invariants computation overflowed in 113 ms
[2023-03-15 13:51:42] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2412 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:51:43] [INFO ] Invariants computation overflowed in 121 ms
[2023-03-15 13:51:48] [INFO ] Dead Transitions using invariants and state equation in 5040 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8909 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s3818 1) (LT s3896 1)), p0:(OR (LT s1072 1) (LT s1180 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 5274 ms.
Product exploration explored 100000 steps with 50000 reset in 4990 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-08 finished in 20110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&X(p2)))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1583 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:52:00] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-15 13:52:04] [INFO ] Implicit Places using invariants in 3726 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:52:04] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-15 13:52:06] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 5258 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:52:06] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-15 13:52:06] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7615 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LT s3941 1), p2:(LT s2439 1), p0:(LT s476 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5600 ms.
Product exploration explored 100000 steps with 50000 reset in 5087 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p2 p0)
Knowledge based reduction with 23 factoid took 635 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-100-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-100-LTLFireability-09 finished in 19863 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 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1403 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:52:20] [INFO ] Invariants computation overflowed in 185 ms
[2023-03-15 13:52:21] [INFO ] Implicit Places using invariants in 1004 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:52:21] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-15 13:52:23] [INFO ] Implicit Places using invariants and state equation in 1585 ms returned []
Implicit Place search using SMT with State Equation took 2591 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:52:23] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-15 13:52:23] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4792 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 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:(OR (LT s4937 1) (LT s5015 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]]
Product exploration explored 100000 steps with 3283 reset in 348 ms.
Product exploration explored 100000 steps with 3317 reset in 367 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 47758 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 47758 steps, saw 23885 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:52:30] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-15 13:52:55] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 231 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 125 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 79 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 64 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 2949 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2949 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 862 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98344 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98344 steps, saw 49215 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-15 13:53:01] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-15 13:53:20] [INFO ] After 18750ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 246 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 290 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-15 13:53:20] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 13:53:50] [INFO ] Implicit Places using invariants in 29250 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-15 13:53:50] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 13:53:51] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 30284 ms to find 0 implicit places.
[2023-03-15 13:53:51] [INFO ] Redundant transitions in 203 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-15 13:53:51] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 13:53:53] [INFO ] Dead Transitions using invariants and state equation in 2581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33368 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 198 Pre rules applied. Total rules applied 0 place count 2397 transition count 2096
Deduced a syphon composed of 198 places in 127 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 2199 transition count 2096
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 397 place count 2199 transition count 2095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 398 place count 2198 transition count 2095
Applied a total of 398 rules in 745 ms. Remains 2198 /2397 variables (removed 199) and now considering 2095/2294 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2095 rows 2198 cols
[2023-03-15 13:53:54] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 13:54:13] [INFO ] After 18467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1426 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:54:15] [INFO ] Invariants computation overflowed in 195 ms
[2023-03-15 13:54:19] [INFO ] Implicit Places using invariants in 4165 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:54:19] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-15 13:54:21] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 5776 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:54:21] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-15 13:54:21] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8112 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 9091 edges and 5300 vertex of which 5298 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 338 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 43924 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 43924 steps, saw 21967 distinct states, run finished after 3004 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:54:27] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-15 13:54:52] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Graph (complete) has 9091 edges and 5300 vertex of which 5298 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 1199 transitions
Trivial Post-agglo rules discarded 1199 transitions
Performed 1199 trivial Post agglomeration. Transition count delta: 1199
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1203 place count 5297 transition count 3797
Reduce places removed 1199 places and 0 transitions.
Iterating post reduction 1 with 1199 rules applied. Total rules applied 2402 place count 4098 transition count 3797
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2402 place count 4098 transition count 3597
Deduced a syphon composed of 200 places in 220 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2802 place count 3898 transition count 3597
Performed 905 Post agglomeration using F-continuation condition.Transition count delta: 905
Deduced a syphon composed of 905 places in 106 ms
Reduce places removed 905 places and 0 transitions.
Iterating global reduction 2 with 1810 rules applied. Total rules applied 4612 place count 2993 transition count 2692
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 79 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4814 place count 2892 transition count 2692
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 67 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 5008 place count 2795 transition count 2692
Free-agglomeration rule (complex) applied 397 times.
Iterating global reduction 2 with 397 rules applied. Total rules applied 5405 place count 2795 transition count 2295
Reduce places removed 397 places and 0 transitions.
Iterating post reduction 2 with 397 rules applied. Total rules applied 5802 place count 2398 transition count 2295
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 400 times.
Drop transitions removed 400 transitions
Iterating global reduction 3 with 400 rules applied. Total rules applied 6202 place count 2398 transition count 2295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6203 place count 2397 transition count 2294
Applied a total of 6203 rules in 2517 ms. Remains 2397 /5300 variables (removed 2903) and now considering 2294/4998 (removed 2704) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2517 ms. Remains : 2397/5300 places, 2294/4998 transitions.
Incomplete random walk after 10000 steps, including 1247 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 840 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 98929 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98929 steps, saw 49508 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-15 13:54:58] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-15 13:55:17] [INFO ] After 19046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 281 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2397/2397 places, 2294/2294 transitions.
Applied a total of 0 rules in 315 ms. Remains 2397 /2397 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-15 13:55:18] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 13:55:48] [INFO ] Implicit Places using invariants in 29927 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-15 13:55:48] [INFO ] Invariants computation overflowed in 58 ms
[2023-03-15 13:56:17] [INFO ] Implicit Places using invariants and state equation in 29677 ms returned []
Implicit Place search using SMT with State Equation took 59606 ms to find 0 implicit places.
[2023-03-15 13:56:17] [INFO ] Redundant transitions in 220 ms returned []
// Phase 1: matrix 2294 rows 2397 cols
[2023-03-15 13:56:17] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-15 13:56:20] [INFO ] Dead Transitions using invariants and state equation in 3051 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63202 ms. Remains : 2397/2397 places, 2294/2294 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3310 reset in 358 ms.
Product exploration explored 100000 steps with 3336 reset in 385 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Performed 1197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1197 rules applied. Total rules applied 1197 place count 5300 transition count 4998
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 1197 place count 5300 transition count 5198
Deduced a syphon composed of 1398 places in 418 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 1398 place count 5300 transition count 5198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1400 place count 5298 transition count 5196
Deduced a syphon composed of 1396 places in 263 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 1402 place count 5298 transition count 5196
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: -200
Deduced a syphon composed of 2298 places in 178 ms
Iterating global reduction 1 with 902 rules applied. Total rules applied 2304 place count 5298 transition count 5396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2305 place count 5297 transition count 5395
Deduced a syphon composed of 2297 places in 171 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2306 place count 5297 transition count 5395
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -664
Deduced a syphon composed of 2398 places in 168 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2407 place count 5297 transition count 6059
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 2508 place count 5196 transition count 5857
Deduced a syphon composed of 2297 places in 157 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 2609 place count 5196 transition count 5857
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -627
Deduced a syphon composed of 2396 places in 164 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2708 place count 5196 transition count 6484
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 2807 place count 5097 transition count 6286
Deduced a syphon composed of 2297 places in 155 ms
Iterating global reduction 1 with 99 rules applied. Total rules applied 2906 place count 5097 transition count 6286
Deduced a syphon composed of 2297 places in 152 ms
Applied a total of 2906 rules in 6566 ms. Remains 5097 /5300 variables (removed 203) and now considering 6286/4998 (removed -1288) transitions.
[2023-03-15 13:56:29] [INFO ] Redundant transitions in 638 ms returned []
// Phase 1: matrix 6286 rows 5097 cols
[2023-03-15 13:56:30] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-15 13:56:30] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5097/5300 places, 6286/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8152 ms. Remains : 5097/5300 places, 6286/4998 transitions.
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1058 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:56:32] [INFO ] Invariants computation overflowed in 117 ms
[2023-03-15 13:56:36] [INFO ] Implicit Places using invariants in 4249 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:56:36] [INFO ] Invariants computation overflowed in 161 ms
[2023-03-15 13:56:37] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 5968 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 13:56:38] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-15 13:56:42] [INFO ] Dead Transitions using invariants and state equation in 4885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11912 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-10 finished in 265364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(F(p2))||p0))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 0 with 1193 rules applied. Total rules applied 1193 place count 5299 transition count 3804
Reduce places removed 1193 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1195 rules applied. Total rules applied 2388 place count 4106 transition count 3802
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2390 place count 4104 transition count 3802
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2390 place count 4104 transition count 3602
Deduced a syphon composed of 200 places in 254 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2790 place count 3904 transition count 3602
Performed 901 Post agglomeration using F-continuation condition.Transition count delta: 901
Deduced a syphon composed of 901 places in 81 ms
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 3 with 1802 rules applied. Total rules applied 4592 place count 3003 transition count 2701
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 68 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4794 place count 2902 transition count 2701
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 65 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4986 place count 2806 transition count 2701
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 4988 place count 2806 transition count 2701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4989 place count 2805 transition count 2700
Applied a total of 4989 rules in 2017 ms. Remains 2805 /5300 variables (removed 2495) and now considering 2700/4998 (removed 2298) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 13:56:46] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 13:56:48] [INFO ] Implicit Places using invariants in 2343 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 13:56:48] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 13:56:53] [INFO ] Implicit Places using invariants and state equation in 4339 ms returned []
Implicit Place search using SMT with State Equation took 6684 ms to find 0 implicit places.
[2023-03-15 13:56:53] [INFO ] Redundant transitions in 161 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 13:56:53] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-15 13:56:55] [INFO ] Dead Transitions using invariants and state equation in 2468 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5300 places, 2700/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11337 ms. Remains : 2805/5300 places, 2700/4998 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s152 1), p2:(GEQ s101 1), p0:(OR (LT s2029 1) (LT s2087 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 13910 reset in 240 ms.
Product exploration explored 100000 steps with 13823 reset in 342 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1394 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 811 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 66306 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66306 steps, saw 33165 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 13:57:00] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-15 13:57:25] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:57:50] [INFO ] After 24217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:57:50] [INFO ] State equation strengthened by 197 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 13:57:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:57:50] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Graph (complete) has 8475 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2803 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2803 transition count 2697
Deduced a syphon composed of 1 places in 85 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2802 transition count 2697
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 405 place count 2802 transition count 2297
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 805 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1204 place count 2402 transition count 2297
Applied a total of 1204 rules in 1092 ms. Remains 2402 /2805 variables (removed 403) and now considering 2297/2700 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1093 ms. Remains : 2402/2805 places, 2297/2700 transitions.
Incomplete random walk after 10000 steps, including 1301 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 864 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 74200 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74200 steps, saw 37121 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-15 13:57:55] [INFO ] Invariants computation overflowed in 53 ms
[2023-03-15 13:58:20] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 13:58:45] [INFO ] After 24555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 13:58:45] [INFO ] State equation strengthened by 397 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 13:58:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 13:58:45] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 273 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 305 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-15 13:58:45] [INFO ] Invariants computation overflowed in 64 ms
[2023-03-15 13:59:16] [INFO ] Performed 1653/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 13:59:26] [INFO ] Implicit Places using invariants in 40530 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-15 13:59:26] [INFO ] Invariants computation overflowed in 92 ms
[2023-03-15 13:59:57] [INFO ] Performed 1577/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:00:08] [INFO ] Implicit Places using invariants and state equation in 42475 ms returned []
Implicit Place search using SMT with State Equation took 83013 ms to find 0 implicit places.
[2023-03-15 14:00:09] [INFO ] Redundant transitions in 250 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-15 14:00:09] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-15 14:00:13] [INFO ] Dead Transitions using invariants and state equation in 3965 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87544 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Applied a total of 0 rules in 329 ms. Remains 2805 /2805 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 14:00:14] [INFO ] Invariants computation overflowed in 86 ms
[2023-03-15 14:00:17] [INFO ] Implicit Places using invariants in 3011 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 14:00:17] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 14:00:21] [INFO ] Implicit Places using invariants and state equation in 4412 ms returned []
Implicit Place search using SMT with State Equation took 7426 ms to find 0 implicit places.
[2023-03-15 14:00:21] [INFO ] Redundant transitions in 209 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 14:00:21] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-15 14:00:24] [INFO ] Dead Transitions using invariants and state equation in 2698 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10672 ms. Remains : 2805/2805 places, 2700/2700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8873 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1390 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 836 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 795 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 66367 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 66367 steps, saw 33194 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 14:00:28] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 14:00:53] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:01:18] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Graph (complete) has 8475 edges and 2805 vertex of which 2803 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2803 transition count 2698
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2803 transition count 2697
Deduced a syphon composed of 1 places in 61 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2802 transition count 2697
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 1 with 400 rules applied. Total rules applied 405 place count 2802 transition count 2297
Reduce places removed 400 places and 0 transitions.
Iterating post reduction 1 with 400 rules applied. Total rules applied 805 place count 2402 transition count 2297
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1204 place count 2402 transition count 2297
Applied a total of 1204 rules in 1161 ms. Remains 2402 /2805 variables (removed 403) and now considering 2297/2700 (removed 403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1162 ms. Remains : 2402/2805 places, 2297/2700 transitions.
Incomplete random walk after 10000 steps, including 1277 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 74462 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 74462 steps, saw 37247 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-15 14:01:23] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-15 14:01:48] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:02:13] [INFO ] After 24535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:02:13] [INFO ] State equation strengthened by 397 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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 14:02:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:02:13] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 464 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2402/2402 places, 2297/2297 transitions.
Applied a total of 0 rules in 365 ms. Remains 2402 /2402 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-15 14:02:14] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-15 14:02:44] [INFO ] Performed 1844/2402 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:02:52] [INFO ] Implicit Places using invariants in 38707 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-15 14:02:53] [INFO ] Invariants computation overflowed in 90 ms
[2023-03-15 14:02:54] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 39767 ms to find 0 implicit places.
[2023-03-15 14:02:54] [INFO ] Redundant transitions in 187 ms returned []
// Phase 1: matrix 2297 rows 2402 cols
[2023-03-15 14:02:54] [INFO ] Invariants computation overflowed in 91 ms
[2023-03-15 14:02:58] [INFO ] Dead Transitions using invariants and state equation in 4106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44433 ms. Remains : 2402/2402 places, 2297/2297 transitions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 284 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 13814 reset in 325 ms.
Product exploration explored 100000 steps with 13739 reset in 351 ms.
Support contains 4 out of 2805 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2805/2805 places, 2700/2700 transitions.
Applied a total of 0 rules in 281 ms. Remains 2805 /2805 variables (removed 0) and now considering 2700/2700 (removed 0) transitions.
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 14:03:00] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-15 14:03:03] [INFO ] Implicit Places using invariants in 3362 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 14:03:03] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 14:03:08] [INFO ] Implicit Places using invariants and state equation in 4865 ms returned []
Implicit Place search using SMT with State Equation took 8229 ms to find 0 implicit places.
[2023-03-15 14:03:08] [INFO ] Redundant transitions in 226 ms returned []
// Phase 1: matrix 2700 rows 2805 cols
[2023-03-15 14:03:08] [INFO ] Invariants computation overflowed in 88 ms
[2023-03-15 14:03:12] [INFO ] Dead Transitions using invariants and state equation in 3691 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12435 ms. Remains : 2805/2805 places, 2700/2700 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-11 finished in 388390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((F(p1) U p2)&&F(p3))))'
Support contains 4 out of 5300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1194 transitions
Trivial Post-agglo rules discarded 1194 transitions
Performed 1194 trivial Post agglomeration. Transition count delta: 1194
Iterating post reduction 0 with 1194 rules applied. Total rules applied 1194 place count 5299 transition count 3803
Reduce places removed 1194 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 1196 rules applied. Total rules applied 2390 place count 4105 transition count 3801
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2392 place count 4103 transition count 3801
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2392 place count 4103 transition count 3601
Deduced a syphon composed of 200 places in 368 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 2792 place count 3903 transition count 3601
Performed 902 Post agglomeration using F-continuation condition.Transition count delta: 902
Deduced a syphon composed of 902 places in 89 ms
Reduce places removed 902 places and 0 transitions.
Iterating global reduction 3 with 1804 rules applied. Total rules applied 4596 place count 3001 transition count 2699
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 69 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4798 place count 2900 transition count 2699
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 65 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 4990 place count 2804 transition count 2699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4991 place count 2803 transition count 2698
Applied a total of 4991 rules in 2100 ms. Remains 2803 /5300 variables (removed 2497) and now considering 2698/4998 (removed 2300) transitions.
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-15 14:03:15] [INFO ] Invariants computation overflowed in 82 ms
[2023-03-15 14:03:17] [INFO ] Implicit Places using invariants in 2693 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-15 14:03:17] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-15 14:03:21] [INFO ] Implicit Places using invariants and state equation in 4048 ms returned []
Implicit Place search using SMT with State Equation took 6744 ms to find 0 implicit places.
[2023-03-15 14:03:21] [INFO ] Redundant transitions in 223 ms returned []
// Phase 1: matrix 2698 rows 2803 cols
[2023-03-15 14:03:22] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-15 14:03:25] [INFO ] Dead Transitions using invariants and state equation in 3098 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5300 places, 2698/4998 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12174 ms. Remains : 2803/5300 places, 2698/4998 transitions.
Stuttering acceptance computed with spot in 422 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s1096 1) (GEQ s1103 1)) (GEQ s2308 1)), p2:(AND (GEQ s1096 1) (GEQ s1103 1)), p1:(GEQ s2308 1), p3:(GEQ s236 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-12 finished in 12686 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(F(p0)))))'
Support contains 3 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Applied a total of 0 rules in 1285 ms. Remains 5300 /5300 variables (removed 0) and now considering 4998/4998 (removed 0) transitions.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 14:03:26] [INFO ] Invariants computation overflowed in 123 ms
[2023-03-15 14:03:27] [INFO ] Implicit Places using invariants in 981 ms returned []
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 14:03:27] [INFO ] Invariants computation overflowed in 112 ms
[2023-03-15 14:03:29] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 2768 ms to find 0 implicit places.
// Phase 1: matrix 4998 rows 5300 cols
[2023-03-15 14:03:29] [INFO ] Invariants computation overflowed in 165 ms
[2023-03-15 14:03:30] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5165 ms. Remains : 5300/5300 places, 4998/4998 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-15 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s3732 1) (GEQ s860 1) (GEQ s949 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-100-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-100-LTLFireability-15 finished in 5897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(p1||X(F((p2||G(p3))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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))))'
Found a Lengthening insensitive property : DoubleExponent-PT-100-LTLFireability-10
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 5300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5300/5300 places, 4998/4998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1198 transitions
Trivial Post-agglo rules discarded 1198 transitions
Performed 1198 trivial Post agglomeration. Transition count delta: 1198
Iterating post reduction 0 with 1198 rules applied. Total rules applied 1198 place count 5299 transition count 3799
Reduce places removed 1198 places and 0 transitions.
Iterating post reduction 1 with 1198 rules applied. Total rules applied 2396 place count 4101 transition count 3799
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 2396 place count 4101 transition count 3599
Deduced a syphon composed of 200 places in 369 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 2796 place count 3901 transition count 3599
Performed 903 Post agglomeration using F-continuation condition.Transition count delta: 903
Deduced a syphon composed of 903 places in 97 ms
Reduce places removed 903 places and 0 transitions.
Iterating global reduction 2 with 1806 rules applied. Total rules applied 4602 place count 2998 transition count 2696
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 70 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4804 place count 2897 transition count 2696
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 66 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 4998 place count 2800 transition count 2696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4999 place count 2799 transition count 2695
Applied a total of 4999 rules in 2234 ms. Remains 2799 /5300 variables (removed 2501) and now considering 2695/4998 (removed 2303) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:03:34] [INFO ] Invariants computation overflowed in 84 ms
[2023-03-15 14:03:37] [INFO ] Implicit Places using invariants in 3173 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:03:37] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-15 14:03:38] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 4256 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:03:38] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 14:03:41] [INFO ] Dead Transitions using invariants and state equation in 2647 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2799/5300 places, 2695/4998 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9139 ms. Remains : 2799/5300 places, 2695/4998 transitions.
Running random walk in product with property : DoubleExponent-PT-100-LTLFireability-10 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:(OR (LT s2606 1) (LT s2646 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13869 reset in 341 ms.
Product exploration explored 100000 steps with 13909 reset in 288 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1389 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 844 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78807 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78807 steps, saw 39413 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:03:45] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-15 14:03:59] [INFO ] After 13786ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Graph (complete) has 8478 edges and 2799 vertex of which 2797 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.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2797 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2797 transition count 2692
Deduced a syphon composed of 1 places in 63 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2796 transition count 2296
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2400 transition count 2296
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2400 transition count 2296
Applied a total of 1196 rules in 1070 ms. Remains 2400 /2799 variables (removed 399) and now considering 2296/2695 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1071 ms. Remains : 2400/2799 places, 2296/2695 transitions.
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 813 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 99702 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99702 steps, saw 49901 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-15 14:04:03] [INFO ] Invariants computation overflowed in 44 ms
[2023-03-15 14:04:28] [INFO ] After 25045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 253 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 254 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 265 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-15 14:04:29] [INFO ] Invariants computation overflowed in 52 ms
[2023-03-15 14:04:59] [INFO ] Implicit Places using invariants in 29808 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-15 14:04:59] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-15 14:05:00] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 30876 ms to find 0 implicit places.
[2023-03-15 14:05:00] [INFO ] Redundant transitions in 221 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-15 14:05:00] [INFO ] Invariants computation overflowed in 73 ms
[2023-03-15 14:05:03] [INFO ] Dead Transitions using invariants and state equation in 2850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34225 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 199 Pre rules applied. Total rules applied 0 place count 2400 transition count 2097
Deduced a syphon composed of 199 places in 128 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2201 transition count 2097
Applied a total of 398 rules in 478 ms. Remains 2201 /2400 variables (removed 199) and now considering 2097/2296 (removed 199) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2097 rows 2201 cols
[2023-03-15 14:05:03] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-15 14:05:20] [INFO ] After 16968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 288 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:05:21] [INFO ] Invariants computation overflowed in 84 ms
[2023-03-15 14:05:25] [INFO ] Implicit Places using invariants in 3596 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:05:25] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-15 14:05:29] [INFO ] Implicit Places using invariants and state equation in 4135 ms returned []
Implicit Place search using SMT with State Equation took 7735 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:05:29] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-15 14:05:32] [INFO ] Dead Transitions using invariants and state equation in 3464 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11489 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 8876 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1363 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 790 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76356 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76356 steps, saw 38182 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:05:36] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-15 14:05:50] [INFO ] After 13792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Graph (complete) has 8478 edges and 2799 vertex of which 2797 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2797 transition count 2693
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 2797 transition count 2692
Deduced a syphon composed of 1 places in 101 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 2796 transition count 2692
Free-agglomeration rule (complex) applied 396 times.
Iterating global reduction 1 with 396 rules applied. Total rules applied 401 place count 2796 transition count 2296
Reduce places removed 396 places and 0 transitions.
Iterating post reduction 1 with 396 rules applied. Total rules applied 797 place count 2400 transition count 2296
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 2 with 399 rules applied. Total rules applied 1196 place count 2400 transition count 2296
Applied a total of 1196 rules in 1128 ms. Remains 2400 /2799 variables (removed 399) and now considering 2296/2695 (removed 399) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1129 ms. Remains : 2400/2799 places, 2296/2695 transitions.
Incomplete random walk after 10000 steps, including 1305 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 97674 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97674 steps, saw 48881 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-15 14:05:54] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 14:06:19] [INFO ] After 25046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 2400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 293 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2400/2400 places, 2296/2296 transitions.
Applied a total of 0 rules in 397 ms. Remains 2400 /2400 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-15 14:06:20] [INFO ] Invariants computation overflowed in 42 ms
[2023-03-15 14:06:47] [INFO ] Implicit Places using invariants in 27265 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-15 14:06:47] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 14:07:18] [INFO ] Performed 2398/2400 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 14:07:18] [INFO ] Implicit Places using invariants and state equation in 30996 ms returned []
Implicit Place search using SMT with State Equation took 58263 ms to find 0 implicit places.
[2023-03-15 14:07:19] [INFO ] Redundant transitions in 220 ms returned []
// Phase 1: matrix 2296 rows 2400 cols
[2023-03-15 14:07:19] [INFO ] Invariants computation overflowed in 74 ms
[2023-03-15 14:07:22] [INFO ] Dead Transitions using invariants and state equation in 3824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62717 ms. Remains : 2400/2400 places, 2296/2296 transitions.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13849 reset in 329 ms.
Product exploration explored 100000 steps with 13874 reset in 356 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 317 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
[2023-03-15 14:07:25] [INFO ] Redundant transitions in 225 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:07:25] [INFO ] Invariants computation overflowed in 87 ms
[2023-03-15 14:07:28] [INFO ] Dead Transitions using invariants and state equation in 2916 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3468 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Support contains 2 out of 2799 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2799/2799 places, 2695/2695 transitions.
Applied a total of 0 rules in 218 ms. Remains 2799 /2799 variables (removed 0) and now considering 2695/2695 (removed 0) transitions.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:07:28] [INFO ] Invariants computation overflowed in 63 ms
[2023-03-15 14:07:31] [INFO ] Implicit Places using invariants in 3229 ms returned []
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:07:31] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-15 14:07:35] [INFO ] Implicit Places using invariants and state equation in 4062 ms returned []
Implicit Place search using SMT with State Equation took 7295 ms to find 0 implicit places.
// Phase 1: matrix 2695 rows 2799 cols
[2023-03-15 14:07:35] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-15 14:07:38] [INFO ] Dead Transitions using invariants and state equation in 3156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10671 ms. Remains : 2799/2799 places, 2695/2695 transitions.
Treatment of property DoubleExponent-PT-100-LTLFireability-10 finished in 247516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(F(p2))||p0))))'
[2023-03-15 14:07:39] [INFO ] Flatten gal took : 289 ms
[2023-03-15 14:07:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 14:07:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5300 places, 4998 transitions and 14090 arcs took 67 ms.
Total runtime 1725558 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2110/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2110/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2110/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2110/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleExponent-PT-100-LTLFireability-04
Could not compute solution for formula : DoubleExponent-PT-100-LTLFireability-06
Could not compute solution for formula : DoubleExponent-PT-100-LTLFireability-10
Could not compute solution for formula : DoubleExponent-PT-100-LTLFireability-11
BK_STOP 1678889282358
--------------------
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-100-LTLFireability-04
ltl formula formula --ltl=/tmp/2110/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 5300 places, 4998 transitions and 14090 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.790 real 0.260 user 0.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2110/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2110/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2110/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2110/ltl_0_
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:
ltl formula name DoubleExponent-PT-100-LTLFireability-06
ltl formula formula --ltl=/tmp/2110/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 5300 places, 4998 transitions and 14090 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2110/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2110/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2110/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.740 real 0.240 user 0.270 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2110/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DoubleExponent-PT-100-LTLFireability-10
ltl formula formula --ltl=/tmp/2110/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 5300 places, 4998 transitions and 14090 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.860 real 0.240 user 0.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2110/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2110/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2110/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2110/ltl_2_
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
double free or corruption (fasttop)
ltl formula name DoubleExponent-PT-100-LTLFireability-11
ltl formula formula --ltl=/tmp/2110/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5300 places, 4998 transitions and 14090 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.770 real 0.230 user 0.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2110/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2110/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2110/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2110/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
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-100"
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-100, 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-167819418600492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 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 ;