About the Execution of LTSMin+red for QuasiCertifProtocol-PT-32
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.203 | 1132850.00 | 2825602.00 | 43926.50 | FTFFFF?FFFTTFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873951100908.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 QuasiCertifProtocol-PT-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951100908
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 74K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 454K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 21K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 223K Feb 26 01:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 01:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 343K Feb 26 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 942K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-32-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679678689263
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=QuasiCertifProtocol-PT-32
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 17:24:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 17:24:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 17:24:51] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2023-03-24 17:24:51] [INFO ] Transformed 3806 places.
[2023-03-24 17:24:51] [INFO ] Transformed 506 transitions.
[2023-03-24 17:24:51] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3572 out of 3806 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 3736 transition count 506
Applied a total of 70 rules in 62 ms. Remains 3736 /3806 variables (removed 70) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 17:24:52] [INFO ] Computed 3232 place invariants in 207 ms
[2023-03-24 17:24:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 17:24:53] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2023-03-24 17:24:53] [INFO ] Invariant cache hit.
[2023-03-24 17:24:54] [INFO ] Implicit Places using invariants and state equation in 1826 ms returned []
Implicit Place search using SMT with State Equation took 3048 ms to find 0 implicit places.
[2023-03-24 17:24:54] [INFO ] Invariant cache hit.
[2023-03-24 17:24:55] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3736/3806 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3947 ms. Remains : 3736/3806 places, 506/506 transitions.
Support contains 3572 out of 3736 places after structural reductions.
[2023-03-24 17:24:56] [INFO ] Flatten gal took : 324 ms
[2023-03-24 17:24:56] [INFO ] Flatten gal took : 170 ms
[2023-03-24 17:24:57] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 723 ms. (steps per millisecond=13 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-24 17:24:58] [INFO ] Invariant cache hit.
[2023-03-24 17:25:01] [INFO ] [Real]Absence check using 0 positive and 3232 generalized place invariants in 936 ms returned sat
[2023-03-24 17:25:02] [INFO ] After 3186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-24 17:25:04] [INFO ] [Nat]Absence check using 0 positive and 3232 generalized place invariants in 903 ms returned sat
[2023-03-24 17:25:25] [INFO ] After 19735ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-24 17:25:27] [INFO ] After 21276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-24 17:25:27] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 18 Parikh solutions to 17 different solutions.
Finished Parikh walk after 236 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=26 )
Parikh walk visited 18 properties in 72 ms.
Computed a total of 3736 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3736 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (F(G(p2))||p1))))'
Support contains 1222 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.47 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3700 transition count 502
Applied a total of 4 rules in 750 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-24 17:25:28] [INFO ] Computed 3200 place invariants in 44 ms
[2023-03-24 17:25:31] [INFO ] Implicit Places using invariants in 2840 ms returned []
[2023-03-24 17:25:31] [INFO ] Invariant cache hit.
[2023-03-24 17:25:38] [INFO ] Implicit Places using invariants and state equation in 7481 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 10331 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 175 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11259 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s155 1)) (AND (GEQ s0 1) (GEQ s198 1)) (AND (GEQ s0 1) (GEQ s199 1)) (AND (GEQ s0 1) (GEQ s200 1)) (AND (GEQ s0 1) (GEQ s201 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 3 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-00 finished in 11628 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||G(p1)||G(p2)))))'
Support contains 68 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.17 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3700 transition count 502
Applied a total of 3 rules in 565 ms. Remains 3700 /3736 variables (removed 36) and now considering 502/506 (removed 4) transitions.
// Phase 1: matrix 502 rows 3700 cols
[2023-03-24 17:25:39] [INFO ] Computed 3200 place invariants in 74 ms
[2023-03-24 17:25:46] [INFO ] Implicit Places using invariants in 6663 ms returned []
[2023-03-24 17:25:46] [INFO ] Invariant cache hit.
[2023-03-24 17:25:57] [INFO ] Implicit Places using invariants and state equation in 10813 ms returned [2279, 2280, 2281, 2282, 2283, 2284, 2285, 2286, 2291, 2292, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2319, 2320, 2321, 2322, 2323, 2324, 2325, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3350, 3673, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698, 3699]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 17498 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3634/3736 places, 502/506 transitions.
Applied a total of 0 rules in 330 ms. Remains 3634 /3634 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18396 ms. Remains : 3634/3736 places, 502/506 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s63 1) (LT s65 1) (LT s64 1) (LT s66 1) (LT s33 1) (LT s34 1) (LT s36 1) (LT s38 1) (LT s37 1) (LT s40 1) (LT s39 1) (LT s42 1) (LT s41 1) (LT...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2462 reset in 821 ms.
Product exploration explored 100000 steps with 2459 reset in 739 ms.
Computed a total of 3634 stabilizing places and 502 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3634 transition count 502
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (G p1)), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 12 factoid took 321 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-01 finished in 21117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 125 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 17:26:00] [INFO ] Computed 3232 place invariants in 48 ms
[2023-03-24 17:26:03] [INFO ] Implicit Places using invariants in 2912 ms returned []
[2023-03-24 17:26:03] [INFO ] Invariant cache hit.
[2023-03-24 17:26:10] [INFO ] Implicit Places using invariants and state equation in 6796 ms returned []
Implicit Place search using SMT with State Equation took 9715 ms to find 0 implicit places.
[2023-03-24 17:26:10] [INFO ] Invariant cache hit.
[2023-03-24 17:26:11] [INFO ] Dead Transitions using invariants and state equation in 1651 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11503 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1438 1) (GEQ s1441 1) (GEQ s1442 1) (GEQ s1443 1) (GEQ s1444 1) (GEQ s1445 1) (GEQ s1446 1) (GEQ s1447 1) (GEQ s1448 1) (GEQ s1465 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-02 finished in 11697 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)||p0))))'
Support contains 1156 out of 3736 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.10 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3699 transition count 501
Applied a total of 5 rules in 285 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-24 17:26:12] [INFO ] Computed 3200 place invariants in 28 ms
[2023-03-24 17:26:15] [INFO ] Implicit Places using invariants in 2771 ms returned []
[2023-03-24 17:26:15] [INFO ] Invariant cache hit.
[2023-03-24 17:26:23] [INFO ] Implicit Places using invariants and state equation in 7928 ms returned [3342, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3672, 3675, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 10702 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3666/3736 places, 501/506 transitions.
Applied a total of 0 rules in 150 ms. Remains 3666 /3666 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11139 ms. Remains : 3666/3736 places, 501/506 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s1435 1) (GEQ s1438 1) (GEQ s1439 1) (GEQ s1440 1) (GEQ s1441 1) (GEQ s1442 1) (GEQ s1443 1) (GEQ s1444 1) (GEQ s1445 1) (GEQ s1462 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-03 finished in 11264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p1))))'
Support contains 67 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 246 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 17:26:23] [INFO ] Computed 3232 place invariants in 46 ms
[2023-03-24 17:26:30] [INFO ] Implicit Places using invariants in 7065 ms returned []
[2023-03-24 17:26:30] [INFO ] Invariant cache hit.
[2023-03-24 17:26:42] [INFO ] Implicit Places using invariants and state equation in 11371 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 18441 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 259 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18948 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 141 ms :[p1, p1, true, p1]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s63 1) (LT s65 1) (LT s64 1) (LT s66 1) (LT s33 1) (LT s34 1) (LT s36 1) (LT s38 1) (LT s37 1) (LT s40 1) (LT s39 1) (LT s42 1) (LT s41 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-04 finished in 19114 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(((p1&&X(p1))||p0))&&(X(G(p2))||F(p3))))'
Support contains 2245 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 52 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 17:26:42] [INFO ] Invariant cache hit.
[2023-03-24 17:26:44] [INFO ] Implicit Places using invariants in 1762 ms returned []
[2023-03-24 17:26:44] [INFO ] Invariant cache hit.
[2023-03-24 17:26:48] [INFO ] Implicit Places using invariants and state equation in 3947 ms returned []
Implicit Place search using SMT with State Equation took 5725 ms to find 0 implicit places.
[2023-03-24 17:26:48] [INFO ] Invariant cache hit.
[2023-03-24 17:26:49] [INFO ] Dead Transitions using invariants and state equation in 803 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6583 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (AND p0 (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s1438 1) (GEQ s1441 1) (GEQ s1442 1) (GEQ s1443 1) (GEQ s1444 1) (GEQ s1445 1) (GEQ s1446 1) (GEQ s1447 1) (GEQ s1448 1) (GEQ s1465 1) (G...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 7 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-05 finished in 6864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&F(p1)) U G(p0)))'
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 250 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 17:26:49] [INFO ] Invariant cache hit.
[2023-03-24 17:26:53] [INFO ] Implicit Places using invariants in 3673 ms returned []
[2023-03-24 17:26:53] [INFO ] Invariant cache hit.
[2023-03-24 17:27:04] [INFO ] Implicit Places using invariants and state equation in 10927 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14615 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 248 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15113 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s63 1) (LT s65 1) (LT s64 1) (LT s66 1) (LT s33 1) (LT s34 1) (LT s36 1) (LT s38 1) (LT s37 1) (LT s40 1) (LT s39 1) (LT s42 1) (LT s41 1) (LT...], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 2675 reset in 565 ms.
Product exploration explored 100000 steps with 2677 reset in 578 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 418 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 266 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1213499 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :{}
Probabilistic random walk after 1213499 steps, saw 146368 distinct states, run finished after 3002 ms. (steps per millisecond=404 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 17:27:10] [INFO ] Computed 3200 place invariants in 420 ms
[2023-03-24 17:27:11] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 813 ms returned sat
[2023-03-24 17:27:12] [INFO ] After 1338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:27:13] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 803 ms returned sat
[2023-03-24 17:27:15] [INFO ] After 1683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:27:15] [INFO ] After 1838ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-24 17:27:15] [INFO ] After 3263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 430 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 243 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 17:27:16] [INFO ] Invariant cache hit.
[2023-03-24 17:27:20] [INFO ] Implicit Places using invariants in 3967 ms returned []
[2023-03-24 17:27:20] [INFO ] Invariant cache hit.
[2023-03-24 17:27:30] [INFO ] Implicit Places using invariants and state equation in 10644 ms returned []
Implicit Place search using SMT with State Equation took 14627 ms to find 0 implicit places.
[2023-03-24 17:27:30] [INFO ] Invariant cache hit.
[2023-03-24 17:27:31] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15637 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 315 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1270489 steps, run timeout after 3001 ms. (steps per millisecond=423 ) properties seen :{}
Probabilistic random walk after 1270489 steps, saw 152520 distinct states, run finished after 3001 ms. (steps per millisecond=423 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 17:27:35] [INFO ] Invariant cache hit.
[2023-03-24 17:27:36] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 801 ms returned sat
[2023-03-24 17:27:37] [INFO ] After 1358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:27:38] [INFO ] [Nat]Absence check using 0 positive and 3200 generalized place invariants in 818 ms returned sat
[2023-03-24 17:27:39] [INFO ] After 1479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:27:39] [INFO ] After 1660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-24 17:27:40] [INFO ] After 3027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 171 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2675 reset in 490 ms.
Product exploration explored 100000 steps with 2674 reset in 536 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3603 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.13 ms
Discarding 100 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3602 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3602 transition count 502
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 3602 transition count 504
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 5 rules in 948 ms. Remains 3602 /3703 variables (removed 101) and now considering 504/506 (removed 2) transitions.
[2023-03-24 17:27:43] [INFO ] Redundant transitions in 193 ms returned []
// Phase 1: matrix 504 rows 3602 cols
[2023-03-24 17:27:43] [INFO ] Computed 3104 place invariants in 25 ms
[2023-03-24 17:27:44] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3602/3703 places, 504/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3064 ms. Remains : 3602/3703 places, 504/506 transitions.
Support contains 33 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 320 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 17:27:45] [INFO ] Computed 3200 place invariants in 410 ms
[2023-03-24 17:27:52] [INFO ] Implicit Places using invariants in 6824 ms returned []
[2023-03-24 17:27:52] [INFO ] Invariant cache hit.
[2023-03-24 17:28:04] [INFO ] Implicit Places using invariants and state equation in 12237 ms returned []
Implicit Place search using SMT with State Equation took 19068 ms to find 0 implicit places.
[2023-03-24 17:28:04] [INFO ] Invariant cache hit.
[2023-03-24 17:28:05] [INFO ] Dead Transitions using invariants and state equation in 1621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21013 ms. Remains : 3703/3703 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-06 finished in 77044 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) U p1) U p2)||G((G(p3)||X(p1))))))'
Support contains 1158 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 213 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 17:28:06] [INFO ] Computed 3232 place invariants in 46 ms
[2023-03-24 17:28:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 17:28:09] [INFO ] Implicit Places using invariants in 2983 ms returned []
[2023-03-24 17:28:09] [INFO ] Invariant cache hit.
[2023-03-24 17:28:15] [INFO ] Implicit Places using invariants and state equation in 5892 ms returned []
Implicit Place search using SMT with State Equation took 8886 ms to find 0 implicit places.
[2023-03-24 17:28:15] [INFO ] Invariant cache hit.
[2023-03-24 17:28:16] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9915 ms. Remains : 3736/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 668 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1)), (AND p0 (NOT p3) (NOT p1)), p0, (NOT p2), (AND p0 (NOT p3)), (AND p1 (NOT p2) (NOT p3))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=4 dest: 11}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p3), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 10}], [{ cond=p0, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=9 dest: 8}, { cond=(NOT p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p0 p3), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s149 1)) (AND (GEQ s0 1) (GEQ s148 1)) (AND (GEQ s0 1) (GEQ s147 1)) (AND (GEQ s0 1) (GEQ s146 1)) (AND (GEQ s0 1) (GEQ s145 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, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 2 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-07 finished in 10661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((X((p0 U p1)) U p1))))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.9 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3699 transition count 501
Applied a total of 5 rules in 692 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-24 17:28:17] [INFO ] Computed 3200 place invariants in 29 ms
[2023-03-24 17:28:24] [INFO ] Implicit Places using invariants in 6645 ms returned []
[2023-03-24 17:28:24] [INFO ] Invariant cache hit.
[2023-03-24 17:28:37] [INFO ] Implicit Places using invariants and state equation in 13528 ms returned [2278, 2279, 2280, 2281, 2282, 2283, 2284, 2285, 2290, 2291, 2294, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 3342, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3672, 3675, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 20195 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3633/3736 places, 501/506 transitions.
Applied a total of 0 rules in 343 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21240 ms. Remains : 3633/3736 places, 501/506 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-12 finished in 21317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 378 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 17:28:38] [INFO ] Computed 3232 place invariants in 39 ms
[2023-03-24 17:28:42] [INFO ] Implicit Places using invariants in 3763 ms returned []
[2023-03-24 17:28:42] [INFO ] Invariant cache hit.
[2023-03-24 17:28:53] [INFO ] Implicit Places using invariants and state equation in 10858 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14646 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 348 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15372 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s232 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][false, false]]
Stuttering criterion allowed to conclude after 103 steps with 34 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-13 finished in 15500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 338 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 17:28:54] [INFO ] Invariant cache hit.
[2023-03-24 17:28:57] [INFO ] Implicit Places using invariants in 3681 ms returned []
[2023-03-24 17:28:57] [INFO ] Invariant cache hit.
[2023-03-24 17:29:08] [INFO ] Implicit Places using invariants and state equation in 10886 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 14598 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 347 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15285 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2677 reset in 341 ms.
Product exploration explored 100000 steps with 2676 reset in 355 ms.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 267 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1473124 steps, run timeout after 3001 ms. (steps per millisecond=490 ) properties seen :{}
Probabilistic random walk after 1473124 steps, saw 177129 distinct states, run finished after 3001 ms. (steps per millisecond=490 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 17:29:14] [INFO ] Computed 3200 place invariants in 420 ms
[2023-03-24 17:29:15] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 811 ms returned sat
[2023-03-24 17:29:17] [INFO ] After 1540ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 17:29:17] [INFO ] After 1718ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-24 17:29:17] [INFO ] After 3107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 345 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2023-03-24 17:29:18] [INFO ] Invariant cache hit.
[2023-03-24 17:29:24] [INFO ] Implicit Places using invariants in 6541 ms returned []
[2023-03-24 17:29:24] [INFO ] Invariant cache hit.
[2023-03-24 17:29:37] [INFO ] Implicit Places using invariants and state equation in 12269 ms returned []
Implicit Place search using SMT with State Equation took 18837 ms to find 0 implicit places.
[2023-03-24 17:29:37] [INFO ] Invariant cache hit.
[2023-03-24 17:29:38] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20813 ms. Remains : 3703/3703 places, 506/506 transitions.
Computed a total of 3703 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3703 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1322581 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :{}
Probabilistic random walk after 1322581 steps, saw 159089 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 17:29:42] [INFO ] Invariant cache hit.
[2023-03-24 17:29:43] [INFO ] [Real]Absence check using 0 positive and 3200 generalized place invariants in 767 ms returned sat
[2023-03-24 17:29:45] [INFO ] After 1359ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 17:29:45] [INFO ] After 1495ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-24 17:29:45] [INFO ] After 2827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 73 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2675 reset in 327 ms.
Product exploration explored 100000 steps with 2675 reset in 357 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Graph (complete) has 40925 edges and 3703 vertex of which 3669 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.12 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 3669 transition count 506
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 3 rules in 690 ms. Remains 3669 /3703 variables (removed 34) and now considering 506/506 (removed 0) transitions.
[2023-03-24 17:29:47] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 506 rows 3669 cols
[2023-03-24 17:29:48] [INFO ] Computed 3168 place invariants in 654 ms
[2023-03-24 17:29:50] [INFO ] Dead Transitions using invariants and state equation in 2373 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3669/3703 places, 506/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3108 ms. Remains : 3669/3703 places, 506/506 transitions.
Support contains 2 out of 3703 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3703/3703 places, 506/506 transitions.
Applied a total of 0 rules in 345 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3703 cols
[2023-03-24 17:29:50] [INFO ] Computed 3200 place invariants in 449 ms
[2023-03-24 17:29:54] [INFO ] Implicit Places using invariants in 4083 ms returned []
[2023-03-24 17:29:54] [INFO ] Invariant cache hit.
[2023-03-24 17:30:05] [INFO ] Implicit Places using invariants and state equation in 10502 ms returned []
Implicit Place search using SMT with State Equation took 14587 ms to find 0 implicit places.
[2023-03-24 17:30:05] [INFO ] Invariant cache hit.
[2023-03-24 17:30:06] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16560 ms. Remains : 3703/3703 places, 506/506 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-14 finished in 72914 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(((p0 U X(p1))||X(G(p2)))))))'
Support contains 69 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Applied a total of 0 rules in 324 ms. Remains 3736 /3736 variables (removed 0) and now considering 506/506 (removed 0) transitions.
// Phase 1: matrix 506 rows 3736 cols
[2023-03-24 17:30:07] [INFO ] Computed 3232 place invariants in 43 ms
[2023-03-24 17:30:13] [INFO ] Implicit Places using invariants in 6449 ms returned []
[2023-03-24 17:30:13] [INFO ] Invariant cache hit.
[2023-03-24 17:30:26] [INFO ] Implicit Places using invariants and state equation in 12731 ms returned [2281, 2282, 2283, 2284, 2285, 2286, 2287, 2288, 2293, 2294, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2310, 2311, 2312, 2321, 2322, 2323, 2324, 2325, 2326, 2327]
Discarding 33 places :
Implicit Place search using SMT with State Equation took 19185 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3703/3736 places, 506/506 transitions.
Applied a total of 0 rules in 317 ms. Remains 3703 /3703 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19827 ms. Remains : 3703/3736 places, 506/506 transitions.
Stuttering acceptance computed with spot in 379 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={} source=9 dest: 7}]], initial=8, aps=[p2:(AND (GEQ s77 1) (GEQ s2305 1) (GEQ s2338 1) (GEQ s2506 1) (GEQ s2537 1) (GEQ s2572 1) (GEQ s2607 1) (GEQ s2647 1) (GEQ s2676 1) (GEQ s2705 1) (GEQ s27...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-32-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-15 finished in 20235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&F(p1)) U G(p0)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-32-LTLFireability-06
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p0)]
Support contains 99 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3636 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.19 ms
Discarding 100 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 3634 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 3634 transition count 501
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 3633 transition count 500
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3633 transition count 500
Applied a total of 6 rules in 1356 ms. Remains 3633 /3736 variables (removed 103) and now considering 500/506 (removed 6) transitions.
// Phase 1: matrix 500 rows 3633 cols
[2023-03-24 17:30:28] [INFO ] Computed 3136 place invariants in 19 ms
[2023-03-24 17:30:34] [INFO ] Implicit Places using invariants in 6158 ms returned []
[2023-03-24 17:30:34] [INFO ] Invariant cache hit.
[2023-03-24 17:30:45] [INFO ] Implicit Places using invariants and state equation in 10770 ms returned [2212, 2213, 2214, 2215, 2216, 2217, 2218, 2219, 2224, 2225, 2228, 2229, 2230, 2231, 2232, 2233, 2234, 2235, 2236, 2237, 2238, 2239, 2240, 2241, 2242, 2243, 2252, 2253, 2254, 2255, 2256, 2257, 2258, 3276, 3277, 3278, 3279, 3280, 3281, 3282, 3283, 3606, 3609, 3610, 3611, 3612, 3613, 3614, 3615, 3616, 3617, 3618, 3619, 3620, 3621, 3622, 3623, 3624, 3625, 3626, 3627, 3628, 3629, 3630, 3631, 3632]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 16932 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3567/3736 places, 500/506 transitions.
Applied a total of 0 rules in 319 ms. Remains 3567 /3567 variables (removed 0) and now considering 500/500 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 18608 ms. Remains : 3567/3736 places, 500/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s62 1) (LT s64 1) (LT s63 1) (LT s65 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s37 1) (LT s36 1) (LT s39 1) (LT s38 1) (LT s41 1) (LT s40 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2464 reset in 590 ms.
Product exploration explored 100000 steps with 2465 reset in 566 ms.
Computed a total of 3567 stabilizing places and 500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3567 transition count 500
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 363 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 247 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1731917 steps, run timeout after 3001 ms. (steps per millisecond=577 ) properties seen :{}
Probabilistic random walk after 1731917 steps, saw 207987 distinct states, run finished after 3001 ms. (steps per millisecond=577 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 500 rows 3567 cols
[2023-03-24 17:30:51] [INFO ] Computed 3072 place invariants in 26 ms
[2023-03-24 17:30:52] [INFO ] [Real]Absence check using 0 positive and 3072 generalized place invariants in 778 ms returned sat
[2023-03-24 17:30:52] [INFO ] After 1302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:30:53] [INFO ] [Nat]Absence check using 0 positive and 3072 generalized place invariants in 768 ms returned sat
[2023-03-24 17:30:55] [INFO ] After 1377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:30:55] [INFO ] After 1557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-24 17:30:55] [INFO ] After 2907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 170 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND p0 p1))), true, (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 10 factoid took 416 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3567 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3567/3567 places, 500/500 transitions.
Applied a total of 0 rules in 286 ms. Remains 3567 /3567 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-24 17:30:56] [INFO ] Invariant cache hit.
[2023-03-24 17:31:02] [INFO ] Implicit Places using invariants in 5873 ms returned []
[2023-03-24 17:31:02] [INFO ] Invariant cache hit.
[2023-03-24 17:31:12] [INFO ] Implicit Places using invariants and state equation in 9774 ms returned []
Implicit Place search using SMT with State Equation took 15669 ms to find 0 implicit places.
[2023-03-24 17:31:12] [INFO ] Invariant cache hit.
[2023-03-24 17:31:13] [INFO ] Dead Transitions using invariants and state equation in 1588 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17554 ms. Remains : 3567/3567 places, 500/500 transitions.
Computed a total of 3567 stabilizing places and 500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3567 transition count 500
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 247 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1786826 steps, run timeout after 3001 ms. (steps per millisecond=595 ) properties seen :{}
Probabilistic random walk after 1786826 steps, saw 214211 distinct states, run finished after 3001 ms. (steps per millisecond=595 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 17:31:17] [INFO ] Invariant cache hit.
[2023-03-24 17:31:18] [INFO ] [Real]Absence check using 0 positive and 3072 generalized place invariants in 758 ms returned sat
[2023-03-24 17:31:18] [INFO ] After 1263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 17:31:20] [INFO ] [Nat]Absence check using 0 positive and 3072 generalized place invariants in 751 ms returned sat
[2023-03-24 17:31:21] [INFO ] After 1381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 17:31:21] [INFO ] After 1511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-24 17:31:21] [INFO ] After 2820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 172 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2461 reset in 532 ms.
Product exploration explored 100000 steps with 2470 reset in 541 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 33 out of 3567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3567/3567 places, 500/500 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3567 transition count 500
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 357 ms. Remains 3567 /3567 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-24 17:31:23] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 500 rows 3567 cols
[2023-03-24 17:31:23] [INFO ] Computed 3072 place invariants in 20 ms
[2023-03-24 17:31:25] [INFO ] Dead Transitions using invariants and state equation in 1593 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3567/3567 places, 500/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2007 ms. Remains : 3567/3567 places, 500/500 transitions.
Support contains 33 out of 3567 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3567/3567 places, 500/500 transitions.
Applied a total of 0 rules in 295 ms. Remains 3567 /3567 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 3567 cols
[2023-03-24 17:31:25] [INFO ] Computed 3072 place invariants in 31 ms
[2023-03-24 17:31:31] [INFO ] Implicit Places using invariants in 5911 ms returned []
[2023-03-24 17:31:31] [INFO ] Invariant cache hit.
[2023-03-24 17:31:41] [INFO ] Implicit Places using invariants and state equation in 9735 ms returned []
Implicit Place search using SMT with State Equation took 15649 ms to find 0 implicit places.
[2023-03-24 17:31:41] [INFO ] Invariant cache hit.
[2023-03-24 17:31:42] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17451 ms. Remains : 3567/3567 places, 500/500 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-06 finished in 75908 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)))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-32-LTLFireability-14
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3736 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3736/3736 places, 506/506 transitions.
Graph (complete) has 42047 edges and 3736 vertex of which 3702 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.9 ms
Discarding 34 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 3699 transition count 501
Applied a total of 5 rules in 690 ms. Remains 3699 /3736 variables (removed 37) and now considering 501/506 (removed 5) transitions.
// Phase 1: matrix 501 rows 3699 cols
[2023-03-24 17:31:43] [INFO ] Computed 3200 place invariants in 26 ms
[2023-03-24 17:31:50] [INFO ] Implicit Places using invariants in 6440 ms returned []
[2023-03-24 17:31:50] [INFO ] Invariant cache hit.
[2023-03-24 17:32:01] [INFO ] Implicit Places using invariants and state equation in 11563 ms returned [2278, 2279, 2280, 2281, 2282, 2283, 2284, 2285, 2290, 2291, 2294, 2295, 2296, 2297, 2298, 2299, 2300, 2301, 2302, 2303, 2304, 2305, 2306, 2307, 2308, 2309, 2318, 2319, 2320, 2321, 2322, 2323, 2324, 3342, 3343, 3344, 3345, 3346, 3347, 3348, 3349, 3672, 3675, 3676, 3677, 3678, 3679, 3680, 3681, 3682, 3683, 3684, 3685, 3686, 3687, 3688, 3689, 3690, 3691, 3692, 3693, 3694, 3695, 3696, 3697, 3698]
Discarding 66 places :
Implicit Place search using SMT with State Equation took 18029 ms to find 66 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3633/3736 places, 501/506 transitions.
Applied a total of 0 rules in 316 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 19036 ms. Remains : 3633/3736 places, 501/506 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-32-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s112 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][false, false, false]]
Product exploration explored 100000 steps with 2466 reset in 373 ms.
Product exploration explored 100000 steps with 2462 reset in 391 ms.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1888158 steps, run timeout after 3001 ms. (steps per millisecond=629 ) properties seen :{}
Probabilistic random walk after 1888158 steps, saw 226132 distinct states, run finished after 3001 ms. (steps per millisecond=629 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 501 rows 3633 cols
[2023-03-24 17:32:07] [INFO ] Computed 3136 place invariants in 519 ms
[2023-03-24 17:32:08] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 742 ms returned sat
[2023-03-24 17:32:09] [INFO ] After 1324ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 17:32:09] [INFO ] After 1453ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-24 17:32:10] [INFO ] After 2740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 307 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-24 17:32:10] [INFO ] Invariant cache hit.
[2023-03-24 17:32:16] [INFO ] Implicit Places using invariants in 6199 ms returned []
[2023-03-24 17:32:16] [INFO ] Invariant cache hit.
[2023-03-24 17:32:29] [INFO ] Implicit Places using invariants and state equation in 12252 ms returned []
Implicit Place search using SMT with State Equation took 18473 ms to find 0 implicit places.
[2023-03-24 17:32:29] [INFO ] Invariant cache hit.
[2023-03-24 17:32:30] [INFO ] Dead Transitions using invariants and state equation in 1587 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20389 ms. Remains : 3633/3633 places, 501/501 transitions.
Computed a total of 3633 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3633 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 245 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1877630 steps, run timeout after 3001 ms. (steps per millisecond=625 ) properties seen :{}
Probabilistic random walk after 1877630 steps, saw 224760 distinct states, run finished after 3001 ms. (steps per millisecond=625 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 17:32:34] [INFO ] Invariant cache hit.
[2023-03-24 17:32:35] [INFO ] [Real]Absence check using 0 positive and 3136 generalized place invariants in 783 ms returned sat
[2023-03-24 17:32:37] [INFO ] After 1320ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 17:32:37] [INFO ] After 1447ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-24 17:32:37] [INFO ] After 2793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2462 reset in 380 ms.
Product exploration explored 100000 steps with 2463 reset in 403 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 3633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 328 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-24 17:32:39] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-24 17:32:39] [INFO ] Invariant cache hit.
[2023-03-24 17:32:41] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2236 ms. Remains : 3633/3633 places, 501/501 transitions.
Support contains 2 out of 3633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3633/3633 places, 501/501 transitions.
Applied a total of 0 rules in 303 ms. Remains 3633 /3633 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2023-03-24 17:32:41] [INFO ] Invariant cache hit.
[2023-03-24 17:32:47] [INFO ] Implicit Places using invariants in 6098 ms returned []
[2023-03-24 17:32:47] [INFO ] Invariant cache hit.
[2023-03-24 17:32:59] [INFO ] Implicit Places using invariants and state equation in 11790 ms returned []
Implicit Place search using SMT with State Equation took 17892 ms to find 0 implicit places.
[2023-03-24 17:32:59] [INFO ] Invariant cache hit.
[2023-03-24 17:33:00] [INFO ] Dead Transitions using invariants and state equation in 1658 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19866 ms. Remains : 3633/3633 places, 501/501 transitions.
Treatment of property QuasiCertifProtocol-PT-32-LTLFireability-14 finished in 78150 ms.
[2023-03-24 17:33:01] [INFO ] Flatten gal took : 85 ms
[2023-03-24 17:33:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-24 17:33:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3736 places, 506 transitions and 7870 arcs took 9 ms.
Total runtime 489846 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1735/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1735/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : QuasiCertifProtocol-PT-32-LTLFireability-06
Could not compute solution for formula : QuasiCertifProtocol-PT-32-LTLFireability-14
BK_STOP 1679679822113
--------------------
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 QuasiCertifProtocol-PT-32-LTLFireability-06
ltl formula formula --ltl=/tmp/1735/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 3736 places, 506 transitions and 7870 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.170 real 0.040 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1735/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1735/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1735/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1735/ltl_0_
ltl formula name QuasiCertifProtocol-PT-32-LTLFireability-14
ltl formula formula --ltl=/tmp/1735/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 3736 places, 506 transitions and 7870 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1735/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1735/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1735/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1735/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 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)
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="QuasiCertifProtocol-PT-32"
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 QuasiCertifProtocol-PT-32, 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 r297-tall-167873951100908"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 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 ;