About the Execution of LoLa+red for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1477.972 | 219400.00 | 269093.00 | 1161.40 | FTFTFTF?FFFTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853500739.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FunctionPointer-PT-c016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853500739
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.2M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678517167949
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c016
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 06:46:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 06:46:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:46:09] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2023-03-11 06:46:09] [INFO ] Transformed 2826 places.
[2023-03-11 06:46:09] [INFO ] Transformed 8960 transitions.
[2023-03-11 06:46:09] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 50 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 298 places :
Symmetric choice reduction at 1 with 298 rule applications. Total rules 315 place count 1313 transition count 3674
Iterating global reduction 1 with 298 rules applied. Total rules applied 613 place count 1313 transition count 3674
Ensure Unique test removed 348 transitions
Reduce isomorphic transitions removed 348 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 961 place count 1313 transition count 3326
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1116 place count 1158 transition count 3016
Iterating global reduction 2 with 155 rules applied. Total rules applied 1271 place count 1158 transition count 3016
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1335 place count 1158 transition count 2952
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1348 place count 1145 transition count 2926
Iterating global reduction 3 with 13 rules applied. Total rules applied 1361 place count 1145 transition count 2926
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1373 place count 1133 transition count 2902
Iterating global reduction 3 with 12 rules applied. Total rules applied 1385 place count 1133 transition count 2902
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1397 place count 1121 transition count 2878
Iterating global reduction 3 with 12 rules applied. Total rules applied 1409 place count 1121 transition count 2878
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1421 place count 1109 transition count 2854
Iterating global reduction 3 with 12 rules applied. Total rules applied 1433 place count 1109 transition count 2854
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1445 place count 1097 transition count 2830
Iterating global reduction 3 with 12 rules applied. Total rules applied 1457 place count 1097 transition count 2830
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1468 place count 1086 transition count 2808
Iterating global reduction 3 with 11 rules applied. Total rules applied 1479 place count 1086 transition count 2808
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1488 place count 1077 transition count 2790
Iterating global reduction 3 with 9 rules applied. Total rules applied 1497 place count 1077 transition count 2790
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1539 place count 1035 transition count 2630
Iterating global reduction 3 with 42 rules applied. Total rules applied 1581 place count 1035 transition count 2630
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1630 place count 986 transition count 2434
Iterating global reduction 3 with 49 rules applied. Total rules applied 1679 place count 986 transition count 2434
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1728 place count 937 transition count 2314
Iterating global reduction 3 with 49 rules applied. Total rules applied 1777 place count 937 transition count 2314
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1826 place count 888 transition count 2216
Iterating global reduction 3 with 49 rules applied. Total rules applied 1875 place count 888 transition count 2216
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 1923 place count 840 transition count 2120
Iterating global reduction 3 with 48 rules applied. Total rules applied 1971 place count 840 transition count 2120
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2019 place count 792 transition count 2024
Iterating global reduction 3 with 48 rules applied. Total rules applied 2067 place count 792 transition count 2024
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 2114 place count 745 transition count 1930
Iterating global reduction 3 with 47 rules applied. Total rules applied 2161 place count 745 transition count 1930
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2172 place count 734 transition count 1908
Iterating global reduction 3 with 11 rules applied. Total rules applied 2183 place count 734 transition count 1908
Applied a total of 2183 rules in 1084 ms. Remains 734 /1628 variables (removed 894) and now considering 1908/5962 (removed 4054) transitions.
[2023-03-11 06:46:11] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
// Phase 1: matrix 1283 rows 734 cols
[2023-03-11 06:46:11] [INFO ] Computed 2 place invariants in 37 ms
[2023-03-11 06:46:12] [INFO ] Implicit Places using invariants in 879 ms returned []
[2023-03-11 06:46:12] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-11 06:46:12] [INFO ] Invariant cache hit.
[2023-03-11 06:46:12] [INFO ] State equation strengthened by 311 read => feed constraints.
[2023-03-11 06:46:14] [INFO ] Implicit Places using invariants and state equation in 2448 ms returned []
Implicit Place search using SMT with State Equation took 3367 ms to find 0 implicit places.
[2023-03-11 06:46:14] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-11 06:46:14] [INFO ] Invariant cache hit.
[2023-03-11 06:46:15] [INFO ] Dead Transitions using invariants and state equation in 640 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 734/1628 places, 1908/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5095 ms. Remains : 734/1628 places, 1908/5962 transitions.
Support contains 14 out of 734 places after structural reductions.
[2023-03-11 06:46:15] [INFO ] Flatten gal took : 138 ms
[2023-03-11 06:46:15] [INFO ] Flatten gal took : 91 ms
[2023-03-11 06:46:15] [INFO ] Input system was already deterministic with 1908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 06:46:16] [INFO ] Flow matrix only has 1283 transitions (discarded 625 similar events)
[2023-03-11 06:46:16] [INFO ] Invariant cache hit.
[2023-03-11 06:46:16] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 06:46:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:46:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:46:17] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 06:46:17] [INFO ] State equation strengthened by 311 read => feed constraints.
[2023-03-11 06:46:17] [INFO ] After 157ms SMT Verify possible using 311 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-11 06:46:17] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-11 06:46:17] [INFO ] After 1058ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 7 out of 734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Graph (complete) has 3130 edges and 734 vertex of which 542 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.5 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 542 transition count 1524
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 390 place count 537 transition count 1514
Iterating global reduction 1 with 5 rules applied. Total rules applied 395 place count 537 transition count 1514
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 401 place count 537 transition count 1508
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 406 place count 532 transition count 1498
Iterating global reduction 2 with 5 rules applied. Total rules applied 411 place count 532 transition count 1498
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 415 place count 528 transition count 1490
Iterating global reduction 2 with 4 rules applied. Total rules applied 419 place count 528 transition count 1490
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 427 place count 520 transition count 1462
Iterating global reduction 2 with 8 rules applied. Total rules applied 435 place count 520 transition count 1462
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 443 place count 512 transition count 1434
Iterating global reduction 2 with 8 rules applied. Total rules applied 451 place count 512 transition count 1434
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 459 place count 504 transition count 1418
Iterating global reduction 2 with 8 rules applied. Total rules applied 467 place count 504 transition count 1418
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 475 place count 496 transition count 1402
Iterating global reduction 2 with 8 rules applied. Total rules applied 483 place count 496 transition count 1402
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 492 place count 487 transition count 1380
Iterating global reduction 2 with 9 rules applied. Total rules applied 501 place count 487 transition count 1380
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 511 place count 477 transition count 1352
Iterating global reduction 2 with 10 rules applied. Total rules applied 521 place count 477 transition count 1352
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 531 place count 467 transition count 1328
Iterating global reduction 2 with 10 rules applied. Total rules applied 541 place count 467 transition count 1328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 545 place count 463 transition count 1320
Iterating global reduction 2 with 4 rules applied. Total rules applied 549 place count 463 transition count 1320
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 553 place count 459 transition count 1312
Iterating global reduction 2 with 4 rules applied. Total rules applied 557 place count 459 transition count 1312
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 561 place count 455 transition count 1304
Iterating global reduction 2 with 4 rules applied. Total rules applied 565 place count 455 transition count 1304
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 569 place count 451 transition count 1296
Iterating global reduction 2 with 4 rules applied. Total rules applied 573 place count 451 transition count 1296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 575 place count 449 transition count 1292
Iterating global reduction 2 with 2 rules applied. Total rules applied 577 place count 449 transition count 1292
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 587 place count 449 transition count 1282
Applied a total of 587 rules in 377 ms. Remains 449 /734 variables (removed 285) and now considering 1282/1908 (removed 626) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 449/734 places, 1282/1908 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:46:18] [INFO ] Flow matrix only has 735 transitions (discarded 547 similar events)
// Phase 1: matrix 735 rows 449 cols
[2023-03-11 06:46:18] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-11 06:46:18] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:46:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:46:18] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:18] [INFO ] State equation strengthened by 86 read => feed constraints.
[2023-03-11 06:46:18] [INFO ] After 46ms SMT Verify possible using 86 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:18] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-11 06:46:18] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 1282/1282 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 445 transition count 1272
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 445 transition count 1272
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 445 transition count 1270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 441 transition count 1260
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 441 transition count 1260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 437 transition count 1252
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 437 transition count 1252
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 434 transition count 1244
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 434 transition count 1244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 431 transition count 1238
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 431 transition count 1238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 428 transition count 1232
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 428 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 425 transition count 1226
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 423 transition count 1222
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 421 transition count 1218
Applied a total of 58 rules in 132 ms. Remains 421 /449 variables (removed 28) and now considering 1218/1282 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 421/449 places, 1218/1282 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 498029 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 498029 steps, saw 305386 distinct states, run finished after 3002 ms. (steps per millisecond=165 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:46:21] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-11 06:46:21] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-11 06:46:21] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:46:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 06:46:21] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 06:46:22] [INFO ] After 61ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:22] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 06:46:22] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 50 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-11 06:46:22] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:46:22] [INFO ] Invariant cache hit.
[2023-03-11 06:46:22] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-11 06:46:22] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:46:22] [INFO ] Invariant cache hit.
[2023-03-11 06:46:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 06:46:23] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2023-03-11 06:46:23] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-11 06:46:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:46:23] [INFO ] Invariant cache hit.
[2023-03-11 06:46:23] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1766 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
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 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 48 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-11 06:46:23] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 06:46:23] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:46:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 06:46:24] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:46:24] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:24] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 06:46:24] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA FunctionPointer-PT-c016-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA FunctionPointer-PT-c016-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 231 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-11 06:46:24] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-11 06:46:24] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 06:46:24] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-11 06:46:24] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:46:24] [INFO ] Invariant cache hit.
[2023-03-11 06:46:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:46:26] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2023-03-11 06:46:26] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:46:26] [INFO ] Invariant cache hit.
[2023-03-11 06:46:26] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2654 ms. Remains : 613/734 places, 1606/1908 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-01 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ s540 0)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 850 ms.
Product exploration explored 100000 steps with 33333 reset in 777 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-01 finished in 4714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G(p1))))'
Support contains 2 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 725 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 716 transition count 1858
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 707 transition count 1836
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 707 transition count 1836
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 694 transition count 1794
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 694 transition count 1794
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 99 place count 681 transition count 1752
Iterating global reduction 1 with 13 rules applied. Total rules applied 112 place count 681 transition count 1752
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 125 place count 668 transition count 1726
Iterating global reduction 1 with 13 rules applied. Total rules applied 138 place count 668 transition count 1726
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 151 place count 655 transition count 1700
Iterating global reduction 1 with 13 rules applied. Total rules applied 164 place count 655 transition count 1700
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 177 place count 642 transition count 1670
Iterating global reduction 1 with 13 rules applied. Total rules applied 190 place count 642 transition count 1670
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 201 place count 631 transition count 1642
Iterating global reduction 1 with 11 rules applied. Total rules applied 212 place count 631 transition count 1642
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 223 place count 620 transition count 1618
Iterating global reduction 1 with 11 rules applied. Total rules applied 234 place count 620 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 237 place count 617 transition count 1612
Iterating global reduction 1 with 3 rules applied. Total rules applied 240 place count 617 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 243 place count 614 transition count 1606
Iterating global reduction 1 with 3 rules applied. Total rules applied 246 place count 614 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 249 place count 611 transition count 1600
Iterating global reduction 1 with 3 rules applied. Total rules applied 252 place count 611 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 255 place count 608 transition count 1594
Iterating global reduction 1 with 3 rules applied. Total rules applied 258 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 607 transition count 1592
Applied a total of 260 rules in 224 ms. Remains 607 /734 variables (removed 127) and now considering 1592/1908 (removed 316) transitions.
[2023-03-11 06:46:29] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2023-03-11 06:46:29] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 06:46:29] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-11 06:46:29] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-11 06:46:29] [INFO ] Invariant cache hit.
[2023-03-11 06:46:29] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:46:32] [INFO ] Implicit Places using invariants and state equation in 3149 ms returned []
Implicit Place search using SMT with State Equation took 3543 ms to find 0 implicit places.
[2023-03-11 06:46:32] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-11 06:46:32] [INFO ] Invariant cache hit.
[2023-03-11 06:46:33] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 607/734 places, 1592/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4243 ms. Remains : 607/734 places, 1592/1908 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s76 0), p0:(LEQ s521 0)], 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 33283 reset in 744 ms.
Product exploration explored 100000 steps with 33217 reset in 729 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/607 stabilizing places and 512/1592 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 545 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:46:35] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-11 06:46:35] [INFO ] Invariant cache hit.
[2023-03-11 06:46:35] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:46:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2023-03-11 06:46:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-11 06:46:36] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:46:36] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:46:36] [INFO ] After 75ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:46:36] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-11 06:46:36] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Graph (complete) has 2656 edges and 607 vertex of which 415 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 1208
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 415 transition count 1206
Applied a total of 387 rules in 114 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1592 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 415/607 places, 1206/1592 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:46:36] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2023-03-11 06:46:36] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-11 06:46:36] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:46:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:46:36] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:37] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 06:46:37] [INFO ] After 59ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:37] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-11 06:46:37] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 415/415 places, 1206/1206 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 555912 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 555912 steps, saw 340877 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:46:40] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:46:40] [INFO ] Invariant cache hit.
[2023-03-11 06:46:40] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:46:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 06:46:40] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:40] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 06:46:40] [INFO ] After 57ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:40] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 06:46:40] [INFO ] After 324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 53 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 41 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2023-03-11 06:46:40] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:46:40] [INFO ] Invariant cache hit.
[2023-03-11 06:46:40] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-11 06:46:40] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:46:40] [INFO ] Invariant cache hit.
[2023-03-11 06:46:41] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 06:46:41] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
[2023-03-11 06:46:41] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-11 06:46:41] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:46:41] [INFO ] Invariant cache hit.
[2023-03-11 06:46:42] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1594 ms. Remains : 415/415 places, 1206/1206 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 146 transition count 347
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 146 transition count 345
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 1067 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 82 transition count 219
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 82 transition count 219
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1255 place count 20 transition count 95
Iterating global reduction 3 with 62 rules applied. Total rules applied 1317 place count 20 transition count 95
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1378 place count 20 transition count 34
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 1380 place count 19 transition count 35
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1386 place count 19 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1387 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1388 place count 18 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1389 place count 18 transition count 27
Applied a total of 1389 rules in 34 ms. Remains 18 /415 variables (removed 397) and now considering 27/1206 (removed 1179) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 18 cols
[2023-03-11 06:46:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 06:46:42] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:46:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 06:46:42] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:46:42] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:46:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 06:46:42] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 14 factoid took 514 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 607 transition count 1590
Applied a total of 2 rules in 275 ms. Remains 607 /607 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
[2023-03-11 06:46:43] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2023-03-11 06:46:43] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-11 06:46:43] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-11 06:46:43] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:46:43] [INFO ] Invariant cache hit.
[2023-03-11 06:46:44] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:46:46] [INFO ] Implicit Places using invariants and state equation in 2834 ms returned []
Implicit Place search using SMT with State Equation took 3250 ms to find 0 implicit places.
[2023-03-11 06:46:46] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 06:46:46] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:46:46] [INFO ] Invariant cache hit.
[2023-03-11 06:46:47] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 607/607 places, 1590/1592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4114 ms. Remains : 607/607 places, 1590/1592 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/607 stabilizing places and 512/1590 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 530 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 160355 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160355 steps, saw 104101 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 06:46:51] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:46:51] [INFO ] Invariant cache hit.
[2023-03-11 06:46:51] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 06:46:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:46:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:46:51] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 06:46:52] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:46:52] [INFO ] After 203ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 06:46:52] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 140 ms.
[2023-03-11 06:46:52] [INFO ] After 1097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 4 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1590/1590 transitions.
Graph (complete) has 2655 edges and 607 vertex of which 415 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 1206
Applied a total of 385 rules in 48 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1590 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 415/607 places, 1206/1590 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 323019 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 323019 steps, saw 198081 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:46:55] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2023-03-11 06:46:55] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-11 06:46:55] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:46:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:46:56] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:46:56] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 06:46:56] [INFO ] After 72ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:46:56] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-11 06:46:56] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 42 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 50 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2023-03-11 06:46:56] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:46:56] [INFO ] Invariant cache hit.
[2023-03-11 06:46:56] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-11 06:46:56] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:46:56] [INFO ] Invariant cache hit.
[2023-03-11 06:46:57] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 06:46:57] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
[2023-03-11 06:46:57] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-11 06:46:57] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:46:57] [INFO ] Invariant cache hit.
[2023-03-11 06:46:58] [INFO ] Dead Transitions using invariants and state equation in 372 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1793 ms. Remains : 415/415 places, 1206/1206 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 146 transition count 347
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 146 transition count 345
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 1067 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 82 transition count 219
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 82 transition count 219
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1255 place count 20 transition count 95
Iterating global reduction 3 with 62 rules applied. Total rules applied 1317 place count 20 transition count 95
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1378 place count 20 transition count 34
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 1380 place count 19 transition count 35
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1386 place count 19 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1387 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1388 place count 18 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1389 place count 18 transition count 27
Applied a total of 1389 rules in 22 ms. Remains 18 /415 variables (removed 397) and now considering 27/1206 (removed 1179) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 27 rows 18 cols
[2023-03-11 06:46:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 06:46:58] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:46:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 06:46:58] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:46:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:46:58] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:46:58] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 06:46:58] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 595 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 483 ms.
Product exploration explored 100000 steps with 0 reset in 537 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 607/607 places, 1590/1590 transitions.
Applied a total of 0 rules in 132 ms. Remains 607 /607 variables (removed 0) and now considering 1590/1590 (removed 0) transitions.
[2023-03-11 06:47:00] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2023-03-11 06:47:00] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-11 06:47:00] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-11 06:47:00] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:47:00] [INFO ] Invariant cache hit.
[2023-03-11 06:47:01] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:47:03] [INFO ] Implicit Places using invariants and state equation in 2870 ms returned []
Implicit Place search using SMT with State Equation took 3335 ms to find 0 implicit places.
[2023-03-11 06:47:03] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 06:47:03] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:47:03] [INFO ] Invariant cache hit.
[2023-03-11 06:47:04] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4059 ms. Remains : 607/607 places, 1590/1590 transitions.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-06 finished in 35642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 298 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-11 06:47:04] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-11 06:47:04] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 06:47:05] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-11 06:47:05] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:05] [INFO ] Invariant cache hit.
[2023-03-11 06:47:05] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:47:06] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 2030 ms to find 0 implicit places.
[2023-03-11 06:47:06] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:06] [INFO ] Invariant cache hit.
[2023-03-11 06:47:07] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2863 ms. Remains : 613/734 places, 1606/1908 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ s533 s474) (LEQ s70 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 522 ms.
Product exploration explored 100000 steps with 0 reset in 522 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 478026 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 478026 steps, saw 310272 distinct states, run finished after 3003 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:47:11] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:11] [INFO ] Invariant cache hit.
[2023-03-11 06:47:11] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:47:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:47:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:47:12] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:47:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:47:12] [INFO ] After 73ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:47:12] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-11 06:47:12] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 90 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 5974 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=1194 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 14 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-11 06:47:13] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:13] [INFO ] Invariant cache hit.
[2023-03-11 06:47:13] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-11 06:47:13] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:13] [INFO ] Invariant cache hit.
[2023-03-11 06:47:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:47:14] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2023-03-11 06:47:14] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:14] [INFO ] Invariant cache hit.
[2023-03-11 06:47:15] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2426 ms. Remains : 613/613 places, 1606/1606 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 470899 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 470899 steps, saw 305645 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:47:18] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:18] [INFO ] Invariant cache hit.
[2023-03-11 06:47:18] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:47:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-03-11 06:47:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:47:19] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:47:19] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:47:19] [INFO ] After 67ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:47:19] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-11 06:47:19] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 90 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 561563 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 561563 steps, saw 344342 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:47:22] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-11 06:47:22] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-11 06:47:22] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:47:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 06:47:22] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:47:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 06:47:22] [INFO ] After 53ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:47:22] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 06:47:22] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-11 06:47:22] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:47:22] [INFO ] Invariant cache hit.
[2023-03-11 06:47:23] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-11 06:47:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:47:23] [INFO ] Invariant cache hit.
[2023-03-11 06:47:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 06:47:24] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-11 06:47:24] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-11 06:47:24] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:47:24] [INFO ] Invariant cache hit.
[2023-03-11 06:47:24] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1792 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
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 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 21 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-11 06:47:24] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 06:47:24] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:47:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 06:47:24] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:47:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:47:24] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:47:24] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 06:47:24] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 434 ms.
Product exploration explored 100000 steps with 3 reset in 577 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 189 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2023-03-11 06:47:26] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 06:47:26] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-11 06:47:26] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-11 06:47:27] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 924 ms. Remains : 613/613 places, 1602/1606 transitions.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 13 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-11 06:47:27] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-11 06:47:27] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-11 06:47:28] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-11 06:47:28] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:28] [INFO ] Invariant cache hit.
[2023-03-11 06:47:28] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:47:29] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
[2023-03-11 06:47:29] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:47:29] [INFO ] Invariant cache hit.
[2023-03-11 06:47:30] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2502 ms. Remains : 613/613 places, 1606/1606 transitions.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 25678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0)) U p1))))'
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 726 transition count 1890
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 726 transition count 1890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 22 place count 726 transition count 1884
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 718 transition count 1862
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 718 transition count 1862
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 711 transition count 1844
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 711 transition count 1844
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 701 transition count 1812
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 701 transition count 1812
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 82 place count 691 transition count 1780
Iterating global reduction 1 with 10 rules applied. Total rules applied 92 place count 691 transition count 1780
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 102 place count 681 transition count 1760
Iterating global reduction 1 with 10 rules applied. Total rules applied 112 place count 681 transition count 1760
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 122 place count 671 transition count 1740
Iterating global reduction 1 with 10 rules applied. Total rules applied 132 place count 671 transition count 1740
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 141 place count 662 transition count 1722
Iterating global reduction 1 with 9 rules applied. Total rules applied 150 place count 662 transition count 1722
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 159 place count 653 transition count 1698
Iterating global reduction 1 with 9 rules applied. Total rules applied 168 place count 653 transition count 1698
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 177 place count 644 transition count 1674
Iterating global reduction 1 with 9 rules applied. Total rules applied 186 place count 644 transition count 1674
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 189 place count 641 transition count 1668
Iterating global reduction 1 with 3 rules applied. Total rules applied 192 place count 641 transition count 1668
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 195 place count 638 transition count 1662
Iterating global reduction 1 with 3 rules applied. Total rules applied 198 place count 638 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 201 place count 635 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 204 place count 635 transition count 1656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 207 place count 632 transition count 1650
Iterating global reduction 1 with 3 rules applied. Total rules applied 210 place count 632 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 213 place count 629 transition count 1644
Iterating global reduction 1 with 3 rules applied. Total rules applied 216 place count 629 transition count 1644
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 222 place count 629 transition count 1638
Applied a total of 222 rules in 479 ms. Remains 629 /734 variables (removed 105) and now considering 1638/1908 (removed 270) transitions.
[2023-03-11 06:47:30] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2023-03-11 06:47:30] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 06:47:31] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-11 06:47:31] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-11 06:47:31] [INFO ] Invariant cache hit.
[2023-03-11 06:47:31] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:47:33] [INFO ] Implicit Places using invariants and state equation in 1929 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
[2023-03-11 06:47:33] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 06:47:33] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-11 06:47:33] [INFO ] Invariant cache hit.
[2023-03-11 06:47:33] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 629/734 places, 1638/1908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3505 ms. Remains : 629/734 places, 1638/1908 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s547), p0:(LEQ s554 s615)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 42 reset in 572 ms.
Product exploration explored 100000 steps with 84 reset in 653 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:47:35] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
[2023-03-11 06:47:35] [INFO ] Invariant cache hit.
[2023-03-11 06:47:35] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:47:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:47:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:47:36] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:36] [INFO ] State equation strengthened by 269 read => feed constraints.
[2023-03-11 06:47:36] [INFO ] After 96ms SMT Verify possible using 269 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:36] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-11 06:47:36] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 1638/1638 transitions.
Graph (complete) has 2732 edges and 629 vertex of which 437 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 437 transition count 1254
Applied a total of 385 rules in 45 ms. Remains 437 /629 variables (removed 192) and now considering 1254/1638 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 437/629 places, 1254/1638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 305348 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305348 steps, saw 187246 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:47:39] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
// Phase 1: matrix 711 rows 437 cols
[2023-03-11 06:47:39] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-11 06:47:39] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:47:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:47:40] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:40] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-11 06:47:40] [INFO ] After 61ms SMT Verify possible using 79 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:40] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-11 06:47:40] [INFO ] After 490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1254/1254 transitions.
Applied a total of 0 rules in 43 ms. Remains 437 /437 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 437/437 places, 1254/1254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1254/1254 transitions.
Applied a total of 0 rules in 44 ms. Remains 437 /437 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-11 06:47:40] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
[2023-03-11 06:47:40] [INFO ] Invariant cache hit.
[2023-03-11 06:47:40] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-11 06:47:40] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
[2023-03-11 06:47:40] [INFO ] Invariant cache hit.
[2023-03-11 06:47:40] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-11 06:47:41] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2023-03-11 06:47:41] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 06:47:41] [INFO ] Flow matrix only has 711 transitions (discarded 543 similar events)
[2023-03-11 06:47:41] [INFO ] Invariant cache hit.
[2023-03-11 06:47:42] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1745 ms. Remains : 437/437 places, 1254/1254 transitions.
Ensure Unique test removed 543 transitions
Reduce isomorphic transitions removed 543 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 437 transition count 695
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 575 place count 421 transition count 695
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 575 place count 421 transition count 619
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 727 place count 345 transition count 619
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 981 place count 218 transition count 492
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1044 place count 155 transition count 366
Iterating global reduction 2 with 63 rules applied. Total rules applied 1107 place count 155 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1108 place count 155 transition count 365
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1170 place count 93 transition count 241
Iterating global reduction 3 with 62 rules applied. Total rules applied 1232 place count 93 transition count 241
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1294 place count 31 transition count 117
Iterating global reduction 3 with 62 rules applied. Total rules applied 1356 place count 31 transition count 117
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1418 place count 31 transition count 55
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 1420 place count 30 transition count 54
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1426 place count 27 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1429 place count 27 transition count 52
Applied a total of 1429 rules in 24 ms. Remains 27 /437 variables (removed 410) and now considering 52/1254 (removed 1202) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 52 rows 27 cols
[2023-03-11 06:47:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 06:47:42] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:47:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 06:47:42] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:47:42] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:42] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 06:47:42] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 8 factoid took 274 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2023-03-11 06:47:42] [INFO ] Flow matrix only has 1093 transitions (discarded 545 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2023-03-11 06:47:42] [INFO ] Computed 2 place invariants in 5 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 8 factoid took 147 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-c016-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c016-LTLCardinality-12 finished in 13555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 734 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 725 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 708 transition count 1838
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 708 transition count 1838
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 697 transition count 1804
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 697 transition count 1804
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 91 place count 686 transition count 1770
Iterating global reduction 1 with 11 rules applied. Total rules applied 102 place count 686 transition count 1770
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 113 place count 675 transition count 1748
Iterating global reduction 1 with 11 rules applied. Total rules applied 124 place count 675 transition count 1748
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 135 place count 664 transition count 1726
Iterating global reduction 1 with 11 rules applied. Total rules applied 146 place count 664 transition count 1726
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 158 place count 652 transition count 1696
Iterating global reduction 1 with 12 rules applied. Total rules applied 170 place count 652 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 180 place count 642 transition count 1668
Iterating global reduction 1 with 10 rules applied. Total rules applied 190 place count 642 transition count 1668
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 200 place count 632 transition count 1646
Iterating global reduction 1 with 10 rules applied. Total rules applied 210 place count 632 transition count 1646
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 214 place count 628 transition count 1638
Iterating global reduction 1 with 4 rules applied. Total rules applied 218 place count 628 transition count 1638
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 222 place count 624 transition count 1630
Iterating global reduction 1 with 4 rules applied. Total rules applied 226 place count 624 transition count 1630
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 230 place count 620 transition count 1622
Iterating global reduction 1 with 4 rules applied. Total rules applied 234 place count 620 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 238 place count 616 transition count 1614
Iterating global reduction 1 with 4 rules applied. Total rules applied 242 place count 616 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 243 place count 615 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 244 place count 615 transition count 1612
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 248 place count 615 transition count 1608
Applied a total of 248 rules in 429 ms. Remains 615 /734 variables (removed 119) and now considering 1608/1908 (removed 300) transitions.
[2023-03-11 06:47:44] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 615 cols
[2023-03-11 06:47:44] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-11 06:47:44] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-11 06:47:44] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:47:44] [INFO ] Invariant cache hit.
[2023-03-11 06:47:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:47:46] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2306 ms to find 0 implicit places.
[2023-03-11 06:47:46] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 06:47:46] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2023-03-11 06:47:46] [INFO ] Invariant cache hit.
[2023-03-11 06:47:47] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/734 places, 1608/1908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3308 ms. Remains : 615/734 places, 1608/1908 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s544)], 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 82 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-14 finished in 3347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G(p1))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLCardinality-06
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND p1 (NOT p0))]
Support contains 2 out of 734 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 725 transition count 1882
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 716 transition count 1858
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 707 transition count 1836
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 707 transition count 1836
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 694 transition count 1794
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 694 transition count 1794
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 99 place count 681 transition count 1752
Iterating global reduction 1 with 13 rules applied. Total rules applied 112 place count 681 transition count 1752
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 125 place count 668 transition count 1726
Iterating global reduction 1 with 13 rules applied. Total rules applied 138 place count 668 transition count 1726
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 151 place count 655 transition count 1700
Iterating global reduction 1 with 13 rules applied. Total rules applied 164 place count 655 transition count 1700
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 177 place count 642 transition count 1670
Iterating global reduction 1 with 13 rules applied. Total rules applied 190 place count 642 transition count 1670
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 201 place count 631 transition count 1642
Iterating global reduction 1 with 11 rules applied. Total rules applied 212 place count 631 transition count 1642
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 223 place count 620 transition count 1618
Iterating global reduction 1 with 11 rules applied. Total rules applied 234 place count 620 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 237 place count 617 transition count 1612
Iterating global reduction 1 with 3 rules applied. Total rules applied 240 place count 617 transition count 1612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 243 place count 614 transition count 1606
Iterating global reduction 1 with 3 rules applied. Total rules applied 246 place count 614 transition count 1606
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 249 place count 611 transition count 1600
Iterating global reduction 1 with 3 rules applied. Total rules applied 252 place count 611 transition count 1600
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 255 place count 608 transition count 1594
Iterating global reduction 1 with 3 rules applied. Total rules applied 258 place count 608 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 259 place count 607 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 260 place count 607 transition count 1592
Applied a total of 260 rules in 298 ms. Remains 607 /734 variables (removed 127) and now considering 1592/1908 (removed 316) transitions.
[2023-03-11 06:47:47] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2023-03-11 06:47:47] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 06:47:48] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-11 06:47:48] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-11 06:47:48] [INFO ] Invariant cache hit.
[2023-03-11 06:47:48] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:47:50] [INFO ] Implicit Places using invariants and state equation in 2471 ms returned []
Implicit Place search using SMT with State Equation took 2894 ms to find 0 implicit places.
[2023-03-11 06:47:50] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-11 06:47:50] [INFO ] Invariant cache hit.
[2023-03-11 06:47:51] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 607/734 places, 1592/1908 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3747 ms. Remains : 607/734 places, 1592/1908 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ s76 0), p0:(LEQ s521 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33441 reset in 728 ms.
Product exploration explored 100000 steps with 33208 reset in 731 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/607 stabilizing places and 512/1592 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 595 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:47:53] [INFO ] Flow matrix only has 1063 transitions (discarded 529 similar events)
[2023-03-11 06:47:53] [INFO ] Invariant cache hit.
[2023-03-11 06:47:53] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:47:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:47:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:47:54] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:54] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:47:54] [INFO ] After 89ms SMT Verify possible using 264 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:54] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 06:47:54] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Graph (complete) has 2656 edges and 607 vertex of which 415 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 415 transition count 1208
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 387 place count 415 transition count 1206
Applied a total of 387 rules in 81 ms. Remains 415 /607 variables (removed 192) and now considering 1206/1592 (removed 386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 415/607 places, 1206/1592 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 288456 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288456 steps, saw 176890 distinct states, run finished after 3003 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:47:57] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2023-03-11 06:47:57] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-11 06:47:57] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:47:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-11 06:47:57] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:57] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 06:47:57] [INFO ] After 66ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:57] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 06:47:57] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 40 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2023-03-11 06:47:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:47:58] [INFO ] Invariant cache hit.
[2023-03-11 06:47:58] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-11 06:47:58] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:47:58] [INFO ] Invariant cache hit.
[2023-03-11 06:47:58] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-11 06:47:59] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2023-03-11 06:47:59] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 06:47:59] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
[2023-03-11 06:47:59] [INFO ] Invariant cache hit.
[2023-03-11 06:47:59] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1673 ms. Remains : 415/415 places, 1206/1206 transitions.
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 415 transition count 670
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 546 place count 405 transition count 670
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 546 place count 405 transition count 603
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 680 place count 338 transition count 603
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 936 place count 210 transition count 475
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1000 place count 146 transition count 347
Iterating global reduction 2 with 64 rules applied. Total rules applied 1064 place count 146 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1065 place count 146 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1065 place count 146 transition count 345
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 1067 place count 145 transition count 345
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1130 place count 82 transition count 219
Iterating global reduction 3 with 63 rules applied. Total rules applied 1193 place count 82 transition count 219
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1255 place count 20 transition count 95
Iterating global reduction 3 with 62 rules applied. Total rules applied 1317 place count 20 transition count 95
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1378 place count 20 transition count 34
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 1380 place count 19 transition count 35
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1386 place count 19 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1387 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1388 place count 18 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1389 place count 18 transition count 27
Applied a total of 1389 rules in 26 ms. Remains 18 /415 variables (removed 397) and now considering 27/1206 (removed 1179) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 27 rows 18 cols
[2023-03-11 06:47:59] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 06:47:59] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:47:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 06:47:59] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:47:59] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 06:47:59] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 06:48:00] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 627 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Support contains 2 out of 607 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 607/607 places, 1592/1592 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 607 transition count 1590
Applied a total of 2 rules in 143 ms. Remains 607 /607 variables (removed 0) and now considering 1590/1592 (removed 2) transitions.
[2023-03-11 06:48:00] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
// Phase 1: matrix 1062 rows 607 cols
[2023-03-11 06:48:01] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-11 06:48:01] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-11 06:48:01] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:48:01] [INFO ] Invariant cache hit.
[2023-03-11 06:48:01] [INFO ] State equation strengthened by 264 read => feed constraints.
[2023-03-11 06:48:03] [INFO ] Implicit Places using invariants and state equation in 2456 ms returned []
Implicit Place search using SMT with State Equation took 2928 ms to find 0 implicit places.
[2023-03-11 06:48:03] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 06:48:03] [INFO ] Flow matrix only has 1062 transitions (discarded 528 similar events)
[2023-03-11 06:48:03] [INFO ] Invariant cache hit.
[2023-03-11 06:48:04] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 607/607 places, 1590/1592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3654 ms. Remains : 607/607 places, 1590/1592 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/607 stabilizing places and 512/1590 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 520 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Finished Best-First random walk after 2289 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=572 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X p1), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 13 factoid took 172 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
Treatment of property FunctionPointer-PT-c016-LTLCardinality-06 finished in 18273 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-06 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c016-LTLCardinality-07
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 734 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 734/734 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 725 transition count 1888
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 725 transition count 1888
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 725 transition count 1880
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 35 place count 716 transition count 1858
Iterating global reduction 1 with 9 rules applied. Total rules applied 44 place count 716 transition count 1858
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 708 transition count 1840
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 708 transition count 1840
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 696 transition count 1800
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 696 transition count 1800
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 96 place count 684 transition count 1760
Iterating global reduction 1 with 12 rules applied. Total rules applied 108 place count 684 transition count 1760
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 120 place count 672 transition count 1736
Iterating global reduction 1 with 12 rules applied. Total rules applied 132 place count 672 transition count 1736
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 144 place count 660 transition count 1712
Iterating global reduction 1 with 12 rules applied. Total rules applied 156 place count 660 transition count 1712
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 168 place count 648 transition count 1684
Iterating global reduction 1 with 12 rules applied. Total rules applied 180 place count 648 transition count 1684
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 191 place count 637 transition count 1656
Iterating global reduction 1 with 11 rules applied. Total rules applied 202 place count 637 transition count 1656
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 213 place count 626 transition count 1632
Iterating global reduction 1 with 11 rules applied. Total rules applied 224 place count 626 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 227 place count 623 transition count 1626
Iterating global reduction 1 with 3 rules applied. Total rules applied 230 place count 623 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 233 place count 620 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 620 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 239 place count 617 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 242 place count 617 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 245 place count 614 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 248 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 249 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 250 place count 613 transition count 1606
Applied a total of 250 rules in 250 ms. Remains 613 /734 variables (removed 121) and now considering 1606/1908 (removed 302) transitions.
[2023-03-11 06:48:05] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-11 06:48:05] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 06:48:06] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-11 06:48:06] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:48:06] [INFO ] Invariant cache hit.
[2023-03-11 06:48:06] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:48:07] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2023-03-11 06:48:07] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:48:07] [INFO ] Invariant cache hit.
[2023-03-11 06:48:08] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 613/734 places, 1606/1908 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2733 ms. Remains : 613/734 places, 1606/1908 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LEQ s533 s474) (LEQ s70 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 443 ms.
Product exploration explored 100000 steps with 3 reset in 518 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 481454 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481454 steps, saw 312496 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:48:12] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:48:12] [INFO ] Invariant cache hit.
[2023-03-11 06:48:12] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:48:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:48:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 06:48:12] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:13] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:48:13] [INFO ] After 104ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:13] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-11 06:48:13] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 91 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 572588 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :{}
Probabilistic random walk after 572588 steps, saw 351101 distinct states, run finished after 3001 ms. (steps per millisecond=190 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:48:16] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-11 06:48:16] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-11 06:48:16] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:48:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 06:48:16] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 06:48:16] [INFO ] After 56ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:16] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-11 06:48:16] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-11 06:48:16] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:48:16] [INFO ] Invariant cache hit.
[2023-03-11 06:48:17] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-11 06:48:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:48:17] [INFO ] Invariant cache hit.
[2023-03-11 06:48:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 06:48:18] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2023-03-11 06:48:18] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 06:48:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:48:18] [INFO ] Invariant cache hit.
[2023-03-11 06:48:18] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1635 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
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 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 22 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-11 06:48:18] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-11 06:48:18] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:48:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 06:48:18] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:48:18] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:18] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 06:48:18] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 17 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-11 06:48:18] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-11 06:48:18] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 06:48:19] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-11 06:48:19] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:48:19] [INFO ] Invariant cache hit.
[2023-03-11 06:48:19] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:48:20] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 1961 ms to find 0 implicit places.
[2023-03-11 06:48:20] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:48:20] [INFO ] Invariant cache hit.
[2023-03-11 06:48:21] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2597 ms. Remains : 613/613 places, 1606/1606 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10005 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 480724 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 480724 steps, saw 312023 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:48:24] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:48:24] [INFO ] Invariant cache hit.
[2023-03-11 06:48:24] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:48:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 06:48:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 06:48:25] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:48:25] [INFO ] After 88ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:25] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-11 06:48:25] [INFO ] After 523ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Graph (complete) has 2679 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1222
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 421 transition count 1218
Applied a total of 389 rules in 84 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1606 (removed 388) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 421/613 places, 1218/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 568107 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 568107 steps, saw 348353 distinct states, run finished after 3003 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 06:48:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2023-03-11 06:48:28] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-11 06:48:28] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:48:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-11 06:48:28] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 06:48:28] [INFO ] After 55ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:28] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-11 06:48:28] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2023-03-11 06:48:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:48:28] [INFO ] Invariant cache hit.
[2023-03-11 06:48:29] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-11 06:48:29] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:48:29] [INFO ] Invariant cache hit.
[2023-03-11 06:48:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2023-03-11 06:48:30] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2023-03-11 06:48:30] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-11 06:48:30] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2023-03-11 06:48:30] [INFO ] Invariant cache hit.
[2023-03-11 06:48:30] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1634 ms. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 550 place count 411 transition count 606
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 694 place count 339 transition count 606
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 946 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1009 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1072 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1073 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1135 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1197 place count 88 transition count 229
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1258 place count 27 transition count 107
Iterating global reduction 3 with 61 rules applied. Total rules applied 1319 place count 27 transition count 107
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 1379 place count 27 transition count 47
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 1381 place count 26 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 1383 place count 25 transition count 49
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1387 place count 25 transition count 45
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1388 place count 25 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1389 place count 24 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1390 place count 24 transition count 43
Applied a total of 1390 rules in 19 ms. Remains 24 /421 variables (removed 397) and now considering 43/1218 (removed 1175) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 43 rows 24 cols
[2023-03-11 06:48:30] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 06:48:30] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:48:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 06:48:30] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 06:48:30] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:48:30] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 06:48:30] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 467 ms.
Product exploration explored 100000 steps with 0 reset in 506 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 138 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2023-03-11 06:48:32] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 06:48:32] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2023-03-11 06:48:32] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-11 06:48:33] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 826 ms. Remains : 613/613 places, 1602/1606 transitions.
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 11 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2023-03-11 06:48:33] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2023-03-11 06:48:33] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-11 06:48:33] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-11 06:48:33] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:48:33] [INFO ] Invariant cache hit.
[2023-03-11 06:48:33] [INFO ] State equation strengthened by 265 read => feed constraints.
[2023-03-11 06:48:35] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2023-03-11 06:48:35] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2023-03-11 06:48:35] [INFO ] Invariant cache hit.
[2023-03-11 06:48:35] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2624 ms. Remains : 613/613 places, 1606/1606 transitions.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 30515 ms.
[2023-03-11 06:48:36] [INFO ] Flatten gal took : 153 ms
[2023-03-11 06:48:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 06:48:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 734 places, 1908 transitions and 7758 arcs took 32 ms.
Total runtime 146740 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-c016
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality
BK_STOP 1678517387349
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 FunctionPointer-PT-c016-LTLCardinality-07
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 5/32 FunctionPointer-PT-c016-LTLCardinality-07 500410 m, 100082 m/sec, 877017 t fired, .
Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 11/32 FunctionPointer-PT-c016-LTLCardinality-07 1022652 m, 104448 m/sec, 1792494 t fired, .
Time elapsed: 10 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 16/32 FunctionPointer-PT-c016-LTLCardinality-07 1544070 m, 104283 m/sec, 2706499 t fired, .
Time elapsed: 15 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 21/32 FunctionPointer-PT-c016-LTLCardinality-07 2065049 m, 104195 m/sec, 3619739 t fired, .
Time elapsed: 20 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 26/32 FunctionPointer-PT-c016-LTLCardinality-07 2583665 m, 103723 m/sec, 4528850 t fired, .
Time elapsed: 25 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 31/32 FunctionPointer-PT-c016-LTLCardinality-07 3102276 m, 103722 m/sec, 5437946 t fired, .
Time elapsed: 30 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for FunctionPointer-PT-c016-LTLCardinality-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-c016-LTLCardinality-06
lola: time limit : 3565 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3565 6/32 FunctionPointer-PT-c016-LTLCardinality-06 531959 m, 106391 m/sec, 932316 t fired, .
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3565 11/32 FunctionPointer-PT-c016-LTLCardinality-06 1059642 m, 105536 m/sec, 1857325 t fired, .
Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3565 16/32 FunctionPointer-PT-c016-LTLCardinality-06 1585527 m, 105177 m/sec, 2779163 t fired, .
Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3565 21/32 FunctionPointer-PT-c016-LTLCardinality-06 2109697 m, 104834 m/sec, 3698019 t fired, .
Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3565 27/32 FunctionPointer-PT-c016-LTLCardinality-06 2632904 m, 104641 m/sec, 4615157 t fired, .
Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3565 32/32 FunctionPointer-PT-c016-LTLCardinality-06 3155304 m, 104480 m/sec, 5530907 t fired, .
Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-c016-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-c016-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-c016-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-c016-LTLCardinality-06: LTL unknown AGGR
FunctionPointer-PT-c016-LTLCardinality-07: LTL unknown AGGR
Time elapsed: 70 secs. Pages in use: 32
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="FunctionPointer-PT-c016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FunctionPointer-PT-c016, 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 r167-tall-167838853500739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 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 ;