About the Execution of ITS-Tools for ShieldRVt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 881.275 | 77209.00 | 119960.00 | 591.90 | FFFFTFFFTTFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026101003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026101003
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 8.1K Apr 30 01:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 01:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 01:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 364K May 10 09:34 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 ShieldRVt-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653079106734
Running Version 202205111006
[2022-05-20 20:38:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 20:38:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 20:38:28] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2022-05-20 20:38:28] [INFO ] Transformed 1503 places.
[2022-05-20 20:38:28] [INFO ] Transformed 1503 transitions.
[2022-05-20 20:38:28] [INFO ] Found NUPN structural information;
[2022-05-20 20:38:28] [INFO ] Parsed PT model containing 1503 places and 1503 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-030B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 311 places :
Symmetric choice reduction at 0 with 311 rule applications. Total rules 311 place count 1192 transition count 1192
Iterating global reduction 0 with 311 rules applied. Total rules applied 622 place count 1192 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 623 place count 1191 transition count 1191
Iterating global reduction 0 with 1 rules applied. Total rules applied 624 place count 1191 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 625 place count 1190 transition count 1190
Iterating global reduction 0 with 1 rules applied. Total rules applied 626 place count 1190 transition count 1190
Applied a total of 626 rules in 423 ms. Remains 1190 /1503 variables (removed 313) and now considering 1190/1503 (removed 313) transitions.
// Phase 1: matrix 1190 rows 1190 cols
[2022-05-20 20:38:28] [INFO ] Computed 121 place invariants in 35 ms
[2022-05-20 20:38:29] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 1190 rows 1190 cols
[2022-05-20 20:38:29] [INFO ] Computed 121 place invariants in 8 ms
[2022-05-20 20:38:29] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
// Phase 1: matrix 1190 rows 1190 cols
[2022-05-20 20:38:30] [INFO ] Computed 121 place invariants in 13 ms
[2022-05-20 20:38:30] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1190/1503 places, 1190/1503 transitions.
Finished structural reductions, in 1 iterations. Remains : 1190/1503 places, 1190/1503 transitions.
Support contains 31 out of 1190 places after structural reductions.
[2022-05-20 20:38:30] [INFO ] Flatten gal took : 102 ms
[2022-05-20 20:38:30] [INFO ] Flatten gal took : 56 ms
[2022-05-20 20:38:30] [INFO ] Input system was already deterministic with 1190 transitions.
Support contains 28 out of 1190 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 19) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1190 rows 1190 cols
[2022-05-20 20:38:31] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:38:32] [INFO ] After 379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-20 20:38:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 40 ms returned sat
[2022-05-20 20:38:33] [INFO ] After 911ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2022-05-20 20:38:33] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 5 ms to minimize.
[2022-05-20 20:38:34] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 1 ms to minimize.
[2022-05-20 20:38:34] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 1 ms to minimize.
[2022-05-20 20:38:34] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 2 ms to minimize.
[2022-05-20 20:38:34] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 1 ms to minimize.
[2022-05-20 20:38:34] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2022-05-20 20:38:35] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 2 ms to minimize.
[2022-05-20 20:38:35] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 0 ms to minimize.
[2022-05-20 20:38:35] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 0 ms to minimize.
[2022-05-20 20:38:35] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2022-05-20 20:38:35] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2022-05-20 20:38:35] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 0 ms to minimize.
[2022-05-20 20:38:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2397 ms
[2022-05-20 20:38:36] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 1 ms to minimize.
[2022-05-20 20:38:36] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-05-20 20:38:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2022-05-20 20:38:36] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 1 ms to minimize.
[2022-05-20 20:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2022-05-20 20:38:37] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2022-05-20 20:38:37] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 1 ms to minimize.
[2022-05-20 20:38:37] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 0 ms to minimize.
[2022-05-20 20:38:37] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 0 ms to minimize.
[2022-05-20 20:38:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 788 ms
[2022-05-20 20:38:37] [INFO ] After 5289ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 462 ms.
[2022-05-20 20:38:38] [INFO ] After 6309ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 459 ms.
Support contains 14 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 324 place count 1190 transition count 866
Reduce places removed 324 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 326 rules applied. Total rules applied 650 place count 866 transition count 864
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 652 place count 864 transition count 864
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 223 Pre rules applied. Total rules applied 652 place count 864 transition count 641
Deduced a syphon composed of 223 places in 2 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 3 with 446 rules applied. Total rules applied 1098 place count 641 transition count 641
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1105 place count 634 transition count 634
Iterating global reduction 3 with 7 rules applied. Total rules applied 1112 place count 634 transition count 634
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1112 place count 634 transition count 627
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1126 place count 627 transition count 627
Performed 276 Post agglomeration using F-continuation condition.Transition count delta: 276
Deduced a syphon composed of 276 places in 1 ms
Reduce places removed 276 places and 0 transitions.
Iterating global reduction 3 with 552 rules applied. Total rules applied 1678 place count 351 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1679 place count 351 transition count 350
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1681 place count 350 transition count 349
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: -78
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 1851 place count 265 transition count 427
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 265 transition count 426
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1856 place count 265 transition count 422
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1860 place count 261 transition count 422
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1863 place count 261 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1864 place count 260 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1865 place count 259 transition count 418
Applied a total of 1865 rules in 233 ms. Remains 259 /1190 variables (removed 931) and now considering 418/1190 (removed 772) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/1190 places, 418/1190 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 418 rows 259 cols
[2022-05-20 20:38:39] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:38:39] [INFO ] [Real]Absence check using 120 positive place invariants in 13 ms returned sat
[2022-05-20 20:38:39] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 20:38:39] [INFO ] [Nat]Absence check using 120 positive place invariants in 12 ms returned sat
[2022-05-20 20:38:39] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 20:38:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-20 20:38:39] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-20 20:38:39] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-20 20:38:39] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 418/418 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 259 transition count 412
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 253 transition count 412
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 2 with 2 rules applied. Total rules applied 14 place count 252 transition count 411
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 249 transition count 413
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 247 transition count 411
Applied a total of 22 rules in 71 ms. Remains 247 /259 variables (removed 12) and now considering 411/418 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 247/259 places, 411/418 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 42696 steps, run visited all 2 properties in 461 ms. (steps per millisecond=92 )
Probabilistic random walk after 42696 steps, saw 27556 distinct states, run finished after 461 ms. (steps per millisecond=92 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA ShieldRVt-PT-030B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 360 stabilizing places and 360 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(G(p0))))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 332 place count 1189 transition count 857
Reduce places removed 332 places and 0 transitions.
Iterating post reduction 1 with 332 rules applied. Total rules applied 664 place count 857 transition count 857
Performed 226 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 226 Pre rules applied. Total rules applied 664 place count 857 transition count 631
Deduced a syphon composed of 226 places in 2 ms
Reduce places removed 226 places and 0 transitions.
Iterating global reduction 2 with 452 rules applied. Total rules applied 1116 place count 631 transition count 631
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1127 place count 620 transition count 620
Iterating global reduction 2 with 11 rules applied. Total rules applied 1138 place count 620 transition count 620
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1138 place count 620 transition count 609
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1160 place count 609 transition count 609
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 274
Deduced a syphon composed of 274 places in 1 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 2 with 548 rules applied. Total rules applied 1708 place count 335 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1709 place count 335 transition count 334
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 1711 place count 334 transition count 333
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 1885 place count 247 transition count 417
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1887 place count 245 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1888 place count 244 transition count 415
Applied a total of 1888 rules in 135 ms. Remains 244 /1190 variables (removed 946) and now considering 415/1190 (removed 775) transitions.
// Phase 1: matrix 415 rows 244 cols
[2022-05-20 20:38:40] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:38:41] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 415 rows 244 cols
[2022-05-20 20:38:41] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:38:41] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2022-05-20 20:38:41] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 415 rows 244 cols
[2022-05-20 20:38:41] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:38:41] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 244/1190 places, 415/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 244/1190 places, 415/1190 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s123 0) (EQ s205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-01 finished in 924 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U F(X(X(F((G(p0)&&p1))))))))'
Support contains 4 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1174 transition count 1174
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1174 transition count 1174
Applied a total of 32 rules in 59 ms. Remains 1174 /1190 variables (removed 16) and now considering 1174/1190 (removed 16) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:38:41] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:38:41] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:38:41] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:38:42] [INFO ] Implicit Places using invariants and state equation in 799 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:38:42] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:38:43] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1174/1190 places, 1174/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1174/1190 places, 1174/1190 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p0]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s733 0) (EQ s223 1)), p0:(OR (EQ s598 0) (EQ s497 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 33776 steps with 0 reset in 180 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 2058 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!G(F(X(p0)))) U (G(p1)||X(p0)))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1173 transition count 1173
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1173 transition count 1173
Applied a total of 34 rules in 82 ms. Remains 1173 /1190 variables (removed 17) and now considering 1173/1190 (removed 17) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:38:43] [INFO ] Computed 121 place invariants in 9 ms
[2022-05-20 20:38:44] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:38:44] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:38:44] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:38:44] [INFO ] Computed 121 place invariants in 10 ms
[2022-05-20 20:38:45] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1190 places, 1173/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1173/1190 places, 1173/1190 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, 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 (EQ s671 0) (EQ s446 1)), p0:(EQ s1112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 162 reset in 404 ms.
Product exploration explored 100000 steps with 151 reset in 433 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 239 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 44 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:38:47] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:38:47] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:38:47] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:38:48] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
// Phase 1: matrix 1173 rows 1173 cols
[2022-05-20 20:38:48] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:38:48] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1173/1173 places, 1173/1173 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 200 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 148 reset in 337 ms.
Product exploration explored 100000 steps with 153 reset in 356 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1173 transition count 1173
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 119 Pre rules applied. Total rules applied 328 place count 1173 transition count 1293
Deduced a syphon composed of 447 places in 1 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 447 place count 1173 transition count 1293
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 807 places in 1 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 807 place count 1173 transition count 1293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 808 place count 1173 transition count 1292
Renaming transitions due to excessive name length > 1024 char.
Discarding 240 places :
Symmetric choice reduction at 2 with 240 rule applications. Total rules 1048 place count 933 transition count 1052
Deduced a syphon composed of 567 places in 0 ms
Iterating global reduction 2 with 240 rules applied. Total rules applied 1288 place count 933 transition count 1052
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 568 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1289 place count 933 transition count 1052
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1291 place count 931 transition count 1050
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1293 place count 931 transition count 1050
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 667 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1394 place count 931 transition count 1782
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1495 place count 830 transition count 1580
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1596 place count 830 transition count 1580
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 583 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1613 place count 830 transition count 1703
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1630 place count 813 transition count 1669
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1647 place count 813 transition count 1669
Deduced a syphon composed of 566 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1650 place count 813 transition count 1666
Deduced a syphon composed of 566 places in 0 ms
Applied a total of 1650 rules in 577 ms. Remains 813 /1173 variables (removed 360) and now considering 1666/1173 (removed -493) transitions.
[2022-05-20 20:38:51] [INFO ] Redundant transitions in 122 ms returned []
// Phase 1: matrix 1666 rows 813 cols
[2022-05-20 20:38:51] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:38:51] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 813/1173 places, 1666/1173 transitions.
Finished structural reductions, in 1 iterations. Remains : 813/1173 places, 1666/1173 transitions.
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-05 finished in 7964 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p0)))'
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 1189 transition count 855
Reduce places removed 334 places and 0 transitions.
Iterating post reduction 1 with 334 rules applied. Total rules applied 668 place count 855 transition count 855
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 225 Pre rules applied. Total rules applied 668 place count 855 transition count 630
Deduced a syphon composed of 225 places in 0 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 2 with 450 rules applied. Total rules applied 1118 place count 630 transition count 630
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1129 place count 619 transition count 619
Iterating global reduction 2 with 11 rules applied. Total rules applied 1140 place count 619 transition count 619
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 1140 place count 619 transition count 608
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 1162 place count 608 transition count 608
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 274
Deduced a syphon composed of 274 places in 0 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 2 with 548 rules applied. Total rules applied 1710 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1711 place count 334 transition count 333
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 1713 place count 333 transition count 332
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1891 place count 244 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1893 place count 242 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1894 place count 241 transition count 418
Applied a total of 1894 rules in 89 ms. Remains 241 /1190 variables (removed 949) and now considering 418/1190 (removed 772) transitions.
// Phase 1: matrix 418 rows 241 cols
[2022-05-20 20:38:51] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-20 20:38:51] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 418 rows 241 cols
[2022-05-20 20:38:51] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:38:52] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2022-05-20 20:38:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 418 rows 241 cols
[2022-05-20 20:38:52] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:38:52] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/1190 places, 418/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 241/1190 places, 418/1190 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s92 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 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-06 finished in 798 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0)) U (X(G(p0))||p1))&&p0)))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1172 transition count 1172
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1172 transition count 1172
Applied a total of 36 rules in 62 ms. Remains 1172 /1190 variables (removed 18) and now considering 1172/1190 (removed 18) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:38:52] [INFO ] Computed 121 place invariants in 8 ms
[2022-05-20 20:38:52] [INFO ] Implicit Places using invariants in 234 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:38:52] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:38:53] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:38:53] [INFO ] Computed 121 place invariants in 10 ms
[2022-05-20 20:38:54] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1190 places, 1172/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1172/1190 places, 1172/1190 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), true, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s387 0) (EQ s33 1)), p1:(OR (EQ s387 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 678 ms.
Product exploration explored 100000 steps with 50000 reset in 673 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1172 stabilizing places and 359/1172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-030B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLCardinality-08 finished in 3314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1172 transition count 1172
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1172 transition count 1172
Applied a total of 36 rules in 66 ms. Remains 1172 /1190 variables (removed 18) and now considering 1172/1190 (removed 18) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:38:55] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:38:56] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:38:56] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:38:56] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:38:56] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:38:57] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1190 places, 1172/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1172/1190 places, 1172/1190 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1038 0) (EQ s1011 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 50000 reset in 667 ms.
Product exploration explored 100000 steps with 50000 reset in 669 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 436 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-030B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLCardinality-09 finished in 3542 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(X(p0)))||p1)))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1172 transition count 1172
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1172 transition count 1172
Applied a total of 36 rules in 56 ms. Remains 1172 /1190 variables (removed 18) and now considering 1172/1190 (removed 18) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:38:59] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:38:59] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:38:59] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:39:00] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:39:00] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:39:00] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1190 places, 1172/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1172/1190 places, 1172/1190 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(EQ s577 1), p0:(OR (EQ s880 0) (EQ s431 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 468 ms.
Product exploration explored 100000 steps with 33333 reset in 458 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Detected a total of 358/1172 stabilizing places and 358/1172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-030B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLCardinality-11 finished in 2703 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(G(F(p1)) U p2))))'
Support contains 4 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1174 transition count 1174
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1174 transition count 1174
Applied a total of 32 rules in 66 ms. Remains 1174 /1190 variables (removed 16) and now considering 1174/1190 (removed 16) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:39:02] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:39:02] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:39:02] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:39:03] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:39:03] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:39:03] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1174/1190 places, 1174/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1174/1190 places, 1174/1190 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s632 0) (EQ s495 1)), p1:(AND (OR (EQ s354 0) (EQ s933 1)) (OR (EQ s632 0) (EQ s495 1))), p0:(AND (EQ s933 0) (EQ s354 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 332 ms.
Product exploration explored 100000 steps with 5 reset in 392 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 161747 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161747 steps, saw 76012 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:39:08] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:39:09] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 20:39:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2022-05-20 20:39:10] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 20:39:10] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2022-05-20 20:39:10] [INFO ] Deduced a trap composed of 33 places in 191 ms of which 0 ms to minimize.
[2022-05-20 20:39:10] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2022-05-20 20:39:10] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 1 ms to minimize.
[2022-05-20 20:39:11] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2022-05-20 20:39:11] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 0 ms to minimize.
[2022-05-20 20:39:11] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 1 ms to minimize.
[2022-05-20 20:39:11] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 1 ms to minimize.
[2022-05-20 20:39:12] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 1 ms to minimize.
[2022-05-20 20:39:12] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 0 ms to minimize.
[2022-05-20 20:39:12] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2022-05-20 20:39:12] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 1 ms to minimize.
[2022-05-20 20:39:12] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 1 ms to minimize.
[2022-05-20 20:39:12] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 2 ms to minimize.
[2022-05-20 20:39:13] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2022-05-20 20:39:13] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2022-05-20 20:39:13] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3301 ms
[2022-05-20 20:39:13] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2022-05-20 20:39:13] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2022-05-20 20:39:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2022-05-20 20:39:14] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 1 ms to minimize.
[2022-05-20 20:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-20 20:39:14] [INFO ] After 4917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 251 ms.
[2022-05-20 20:39:14] [INFO ] After 5515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1174 transition count 847
Reduce places removed 327 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 655 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 846 transition count 846
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 846 transition count 609
Deduced a syphon composed of 237 places in 0 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 609 transition count 609
Performed 272 Post agglomeration using F-continuation condition.Transition count delta: 272
Deduced a syphon composed of 272 places in 0 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 1674 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 337 transition count 336
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1677 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1853 place count 248 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1854 place count 248 transition count 419
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1855 place count 248 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1856 place count 247 transition count 418
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1857 place count 247 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1858 place count 246 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1859 place count 245 transition count 416
Applied a total of 1859 rules in 102 ms. Remains 245 /1174 variables (removed 929) and now considering 416/1174 (removed 758) transitions.
Finished structural reductions, in 1 iterations. Remains : 245/1174 places, 416/1174 transitions.
Finished random walk after 1775 steps, including 0 resets, run visited all 6 properties in 61 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 592 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Applied a total of 0 rules in 29 ms. Remains 1174 /1174 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:39:15] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:39:15] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:39:15] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:39:16] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:39:16] [INFO ] Computed 121 place invariants in 7 ms
[2022-05-20 20:39:17] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1174/1174 places, 1174/1174 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 327 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 170417 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170417 steps, saw 79695 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1174 rows 1174 cols
[2022-05-20 20:39:21] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:39:21] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 20:39:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2022-05-20 20:39:22] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 20:39:22] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2022-05-20 20:39:23] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 1 ms to minimize.
[2022-05-20 20:39:23] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 1 ms to minimize.
[2022-05-20 20:39:23] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 1 ms to minimize.
[2022-05-20 20:39:23] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 0 ms to minimize.
[2022-05-20 20:39:23] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 1 ms to minimize.
[2022-05-20 20:39:24] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 0 ms to minimize.
[2022-05-20 20:39:24] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 0 ms to minimize.
[2022-05-20 20:39:24] [INFO ] Deduced a trap composed of 39 places in 163 ms of which 1 ms to minimize.
[2022-05-20 20:39:24] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 1 ms to minimize.
[2022-05-20 20:39:24] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 1 ms to minimize.
[2022-05-20 20:39:25] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 0 ms to minimize.
[2022-05-20 20:39:25] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 1 ms to minimize.
[2022-05-20 20:39:25] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 0 ms to minimize.
[2022-05-20 20:39:25] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 2 ms to minimize.
[2022-05-20 20:39:25] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 1 ms to minimize.
[2022-05-20 20:39:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3201 ms
[2022-05-20 20:39:25] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2022-05-20 20:39:26] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2022-05-20 20:39:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2022-05-20 20:39:26] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 0 ms to minimize.
[2022-05-20 20:39:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2022-05-20 20:39:26] [INFO ] After 4786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 248 ms.
[2022-05-20 20:39:26] [INFO ] After 5397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1174 transition count 847
Reduce places removed 327 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 655 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 846 transition count 846
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 846 transition count 609
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 609 transition count 609
Performed 272 Post agglomeration using F-continuation condition.Transition count delta: 272
Deduced a syphon composed of 272 places in 1 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 1674 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 337 transition count 336
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1677 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1853 place count 248 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1854 place count 248 transition count 419
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1855 place count 248 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1856 place count 247 transition count 418
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1857 place count 247 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1858 place count 246 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1859 place count 245 transition count 416
Applied a total of 1859 rules in 65 ms. Remains 245 /1174 variables (removed 929) and now considering 416/1174 (removed 758) transitions.
Finished structural reductions, in 1 iterations. Remains : 245/1174 places, 416/1174 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 245 cols
[2022-05-20 20:39:27] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:39:27] [INFO ] [Real]Absence check using 120 positive place invariants in 12 ms returned sat
[2022-05-20 20:39:27] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 20:39:27] [INFO ] [Nat]Absence check using 120 positive place invariants in 11 ms returned sat
[2022-05-20 20:39:27] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 20:39:27] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-05-20 20:39:27] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 245/245 places, 416/416 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 245 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 244 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 243 transition count 415
Applied a total of 4 rules in 10 ms. Remains 243 /245 variables (removed 2) and now considering 415/416 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 243/245 places, 415/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 90412 steps, run visited all 1 properties in 418 ms. (steps per millisecond=216 )
Probabilistic random walk after 90412 steps, saw 57914 distinct states, run finished after 418 ms. (steps per millisecond=216 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 449 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 5 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 5 reset in 302 ms.
Product exploration explored 100000 steps with 4 reset in 387 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2)]
Support contains 4 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1174 transition count 1174
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 328 place count 1174 transition count 1294
Deduced a syphon composed of 448 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 448 place count 1174 transition count 1294
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 808 places in 1 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 808 place count 1174 transition count 1294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 809 place count 1174 transition count 1293
Renaming transitions due to excessive name length > 1024 char.
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 1048 place count 935 transition count 1054
Deduced a syphon composed of 569 places in 1 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 1287 place count 935 transition count 1054
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 570 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1288 place count 935 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1290 place count 933 transition count 1052
Deduced a syphon composed of 568 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1292 place count 933 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -731
Deduced a syphon composed of 669 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1393 place count 933 transition count 1783
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 1495 place count 831 transition count 1579
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 1597 place count 831 transition count 1579
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -112
Deduced a syphon composed of 583 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1613 place count 831 transition count 1691
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1629 place count 815 transition count 1659
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 1645 place count 815 transition count 1659
Deduced a syphon composed of 567 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1648 place count 815 transition count 1656
Deduced a syphon composed of 567 places in 0 ms
Applied a total of 1648 rules in 279 ms. Remains 815 /1174 variables (removed 359) and now considering 1656/1174 (removed -482) transitions.
[2022-05-20 20:39:30] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1656 rows 815 cols
[2022-05-20 20:39:30] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 20:39:30] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 815/1174 places, 1656/1174 transitions.
Finished structural reductions, in 1 iterations. Remains : 815/1174 places, 1656/1174 transitions.
Stuttering criterion allowed to conclude after 49936 steps with 3 reset in 163 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-12 finished in 29094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(!(X(!p0) U X(X((F(p0)||p1))))))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1172 transition count 1172
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1172 transition count 1172
Applied a total of 36 rules in 62 ms. Remains 1172 /1190 variables (removed 18) and now considering 1172/1190 (removed 18) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:39:31] [INFO ] Computed 121 place invariants in 5 ms
[2022-05-20 20:39:31] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:39:31] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:39:32] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
// Phase 1: matrix 1172 rows 1172 cols
[2022-05-20 20:39:32] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:39:32] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1190 places, 1172/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 1172/1190 places, 1172/1190 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR p1 p0), (OR p1 p0), (OR p1 p0), (OR p0 p1), (OR p1 p0), p0]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={1} source=3 dest: 3}, { cond=true, acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=p0, acceptance={0, 1} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s550 0) (EQ s616 1)), p1:(OR (EQ s550 0) (EQ s616 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 37363 steps with 0 reset in 141 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-13 finished in 1951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F((G(p1)||p0))))))'
Support contains 4 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1190/1190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 332 place count 1189 transition count 857
Reduce places removed 332 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 333 rules applied. Total rules applied 665 place count 857 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 666 place count 856 transition count 856
Performed 225 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 225 Pre rules applied. Total rules applied 666 place count 856 transition count 631
Deduced a syphon composed of 225 places in 1 ms
Reduce places removed 225 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 1116 place count 631 transition count 631
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1125 place count 622 transition count 622
Iterating global reduction 3 with 9 rules applied. Total rules applied 1134 place count 622 transition count 622
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1134 place count 622 transition count 613
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1152 place count 613 transition count 613
Performed 275 Post agglomeration using F-continuation condition.Transition count delta: 275
Deduced a syphon composed of 275 places in 0 ms
Reduce places removed 275 places and 0 transitions.
Iterating global reduction 3 with 550 rules applied. Total rules applied 1702 place count 338 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1703 place count 338 transition count 337
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 1705 place count 337 transition count 336
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1881 place count 249 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1883 place count 247 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1884 place count 246 transition count 420
Applied a total of 1884 rules in 66 ms. Remains 246 /1190 variables (removed 944) and now considering 420/1190 (removed 770) transitions.
// Phase 1: matrix 420 rows 246 cols
[2022-05-20 20:39:33] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:39:33] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 420 rows 246 cols
[2022-05-20 20:39:33] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:39:33] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-05-20 20:39:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 420 rows 246 cols
[2022-05-20 20:39:33] [INFO ] Computed 120 place invariants in 0 ms
[2022-05-20 20:39:33] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/1190 places, 420/1190 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/1190 places, 420/1190 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-15 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 (EQ s221 0) (EQ s120 1)), p0:(OR (EQ s27 0) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23 reset in 383 ms.
Product exploration explored 100000 steps with 27 reset in 423 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 174482 steps, run visited all 2 properties in 1653 ms. (steps per millisecond=105 )
Probabilistic random walk after 174482 steps, saw 111040 distinct states, run finished after 1653 ms. (steps per millisecond=105 ) properties seen :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 335 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 420/420 transitions.
Applied a total of 0 rules in 11 ms. Remains 246 /246 variables (removed 0) and now considering 420/420 (removed 0) transitions.
// Phase 1: matrix 420 rows 246 cols
[2022-05-20 20:39:37] [INFO ] Computed 120 place invariants in 0 ms
[2022-05-20 20:39:37] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 420 rows 246 cols
[2022-05-20 20:39:37] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:39:37] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2022-05-20 20:39:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 420 rows 246 cols
[2022-05-20 20:39:37] [INFO ] Computed 120 place invariants in 0 ms
[2022-05-20 20:39:37] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 246/246 places, 420/420 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 174482 steps, run visited all 2 properties in 1794 ms. (steps per millisecond=97 )
Probabilistic random walk after 174482 steps, saw 111040 distinct states, run finished after 1795 ms. (steps per millisecond=97 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28 reset in 373 ms.
Product exploration explored 100000 steps with 30 reset in 417 ms.
Built C files in :
/tmp/ltsmin16530970569781358540
[2022-05-20 20:39:41] [INFO ] Computing symmetric may disable matrix : 420 transitions.
[2022-05-20 20:39:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:39:41] [INFO ] Computing symmetric may enable matrix : 420 transitions.
[2022-05-20 20:39:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:39:41] [INFO ] Computing Do-Not-Accords matrix : 420 transitions.
[2022-05-20 20:39:41] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:39:41] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16530970569781358540
Running compilation step : cd /tmp/ltsmin16530970569781358540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1112 ms.
Running link step : cd /tmp/ltsmin16530970569781358540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16530970569781358540;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17157996882048520449.hoa' '--buchi-type=spotba'
LTSmin run took 1429 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-030B-LTLCardinality-15 finished in 10744 ms.
All properties solved by simple procedures.
Total runtime 75919 ms.
BK_STOP 1653079183943
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="ShieldRVt-PT-030B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-030B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286026101003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;