About the Execution of 2021-gold for FunctionPointer-PT-c128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16243.283 | 3600000.00 | 3588502.00 | 46851.70 | ? 0 0 0 0 0 ? 0 128 0 0 128 0 0 ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292800196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is FunctionPointer-PT-c128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292800196
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 7 17:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 7 17:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Jun 7 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 7 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M Jun 6 12:11 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c128-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654771896864
Running Version 0
[2022-06-09 10:51:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 10:51:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 10:51:39] [INFO ] Load time of PNML (sax parser for PT used): 386 ms
[2022-06-09 10:51:39] [INFO ] Transformed 2826 places.
[2022-06-09 10:51:39] [INFO ] Transformed 8960 transitions.
[2022-06-09 10:51:39] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 476 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1198 places in 30 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3540 out of 5962 initially.
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 10:51:39] [INFO ] Computed 4 place invariants in 113 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :2
[2022-06-09 10:51:39] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2022-06-09 10:51:39] [INFO ] Computed 4 place invariants in 63 ms
[2022-06-09 10:51:40] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2022-06-09 10:51:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:51:40] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2022-06-09 10:51:41] [INFO ] State equation strengthened by 2822 read => feed constraints.
[2022-06-09 10:51:43] [INFO ] [Real]Added 2822 Read/Feed constraints in 2119 ms returned sat
[2022-06-09 10:51:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:51:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:51:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:51:44] [INFO ] [Nat]Absence check using state equation in 839 ms returned sat
[2022-06-09 10:51:46] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1954 ms returned sat
[2022-06-09 10:51:46] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 3 ms to minimize.
[2022-06-09 10:51:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
[2022-06-09 10:51:47] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 833 ms.
[2022-06-09 10:51:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 10:51:48] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:51:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:51:49] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2022-06-09 10:51:51] [INFO ] [Real]Added 2822 Read/Feed constraints in 2017 ms returned sat
[2022-06-09 10:51:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:51:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:51:52] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:51:52] [INFO ] [Nat]Absence check using state equation in 774 ms returned sat
[2022-06-09 10:51:54] [INFO ] [Nat]Added 2822 Read/Feed constraints in 1925 ms returned sat
[2022-06-09 10:51:55] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2022-06-09 10:51:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2022-06-09 10:51:55] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 461 ms.
[2022-06-09 10:51:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 10:51:57] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:51:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:51:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:51:57] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2022-06-09 10:52:00] [INFO ] [Real]Added 2822 Read/Feed constraints in 2017 ms returned sat
[2022-06-09 10:52:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:52:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-09 10:52:00] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:52:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:01] [INFO ] [Nat]Absence check using state equation in 778 ms returned sat
[2022-06-09 10:52:03] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2033 ms returned sat
[2022-06-09 10:52:03] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 455 ms.
[2022-06-09 10:52:06] [INFO ] Deduced a trap composed of 17 places in 1238 ms of which 4 ms to minimize.
[2022-06-09 10:52:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 10:52:06] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-06-09 10:52:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:07] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2022-06-09 10:52:09] [INFO ] [Real]Added 2822 Read/Feed constraints in 2143 ms returned sat
[2022-06-09 10:52:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:52:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:52:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:52:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:10] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2022-06-09 10:52:12] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2007 ms returned sat
[2022-06-09 10:52:13] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 695 ms.
[2022-06-09 10:52:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 10:52:14] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:52:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:52:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:15] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2022-06-09 10:52:17] [INFO ] [Real]Added 2822 Read/Feed constraints in 2099 ms returned sat
[2022-06-09 10:52:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:52:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:52:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:52:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:19] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2022-06-09 10:52:21] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2020 ms returned sat
[2022-06-09 10:52:21] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 452 ms.
[2022-06-09 10:52:24] [INFO ] Deduced a trap composed of 17 places in 1219 ms of which 6 ms to minimize.
[2022-06-09 10:52:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 10:52:24] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:52:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 10:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:25] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2022-06-09 10:52:27] [INFO ] [Real]Added 2822 Read/Feed constraints in 2114 ms returned sat
[2022-06-09 10:52:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:52:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-09 10:52:27] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:28] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2022-06-09 10:52:30] [INFO ] [Nat]Added 2822 Read/Feed constraints in 2003 ms returned sat
[2022-06-09 10:52:30] [INFO ] Deduced a trap composed of 131 places in 88 ms of which 1 ms to minimize.
[2022-06-09 10:52:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2022-06-09 10:52:31] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 452 ms.
[2022-06-09 10:52:33] [INFO ] Deduced a trap composed of 17 places in 1220 ms of which 16 ms to minimize.
[2022-06-09 10:52:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, -1, 128, 128, -1, -1] Max seen :[15, 1, 2, 1, 1, 1]
Support contains 6 out of 1628 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.16 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Iterating post reduction 0 with 378 rules applied. Total rules applied 379 place count 1422 transition count 5584
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 679 place count 1122 transition count 3302
Iterating global reduction 1 with 300 rules applied. Total rules applied 979 place count 1122 transition count 3302
Ensure Unique test removed 360 transitions
Reduce isomorphic transitions removed 360 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 1339 place count 1122 transition count 2942
Discarding 157 places :
Symmetric choice reduction at 2 with 157 rule applications. Total rules 1496 place count 965 transition count 2628
Iterating global reduction 2 with 157 rules applied. Total rules applied 1653 place count 965 transition count 2628
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1721 place count 965 transition count 2560
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1735 place count 951 transition count 2532
Iterating global reduction 3 with 14 rules applied. Total rules applied 1749 place count 951 transition count 2532
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1763 place count 937 transition count 2504
Iterating global reduction 3 with 14 rules applied. Total rules applied 1777 place count 937 transition count 2504
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1791 place count 923 transition count 2476
Iterating global reduction 3 with 14 rules applied. Total rules applied 1805 place count 923 transition count 2476
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1819 place count 909 transition count 2448
Iterating global reduction 3 with 14 rules applied. Total rules applied 1833 place count 909 transition count 2448
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1847 place count 895 transition count 2420
Iterating global reduction 3 with 14 rules applied. Total rules applied 1861 place count 895 transition count 2420
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1875 place count 881 transition count 2392
Iterating global reduction 3 with 14 rules applied. Total rules applied 1889 place count 881 transition count 2392
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1903 place count 867 transition count 2364
Iterating global reduction 3 with 14 rules applied. Total rules applied 1917 place count 867 transition count 2364
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1979 place count 805 transition count 2130
Iterating global reduction 3 with 62 rules applied. Total rules applied 2041 place count 805 transition count 2130
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 2103 place count 743 transition count 1882
Iterating global reduction 3 with 62 rules applied. Total rules applied 2165 place count 743 transition count 1882
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 2227 place count 681 transition count 1744
Iterating global reduction 3 with 62 rules applied. Total rules applied 2289 place count 681 transition count 1744
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 2351 place count 619 transition count 1620
Iterating global reduction 3 with 62 rules applied. Total rules applied 2413 place count 619 transition count 1620
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2474 place count 558 transition count 1498
Iterating global reduction 3 with 61 rules applied. Total rules applied 2535 place count 558 transition count 1498
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 2596 place count 497 transition count 1376
Iterating global reduction 3 with 61 rules applied. Total rules applied 2657 place count 497 transition count 1376
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2717 place count 437 transition count 1256
Iterating global reduction 3 with 60 rules applied. Total rules applied 2777 place count 437 transition count 1256
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2784 place count 430 transition count 1242
Iterating global reduction 3 with 7 rules applied. Total rules applied 2791 place count 430 transition count 1242
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 2795 place count 430 transition count 1238
Applied a total of 2795 rules in 1324 ms. Remains 430 /1628 variables (removed 1198) and now considering 1238/5962 (removed 4724) transitions.
Finished structural reductions, in 1 iterations. Remains : 430/1628 places, 1238/5962 transitions.
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:52:35] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2221 ms. (steps per millisecond=450 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7 resets, run finished after 1345 ms. (steps per millisecond=743 ) properties (out of 6) seen :297
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1485 ms. (steps per millisecond=673 ) properties (out of 6) seen :244
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 1428 ms. (steps per millisecond=700 ) properties (out of 6) seen :43
Incomplete Best-First random walk after 1000001 steps, including 11 resets, run finished after 1357 ms. (steps per millisecond=736 ) properties (out of 6) seen :40
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties (out of 6) seen :393
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1494 ms. (steps per millisecond=669 ) properties (out of 6) seen :112
[2022-06-09 10:52:46] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:52:46] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 10:52:46] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:52:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:46] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-09 10:52:46] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:52:46] [INFO ] [Real]Added 367 Read/Feed constraints in 212 ms returned sat
[2022-06-09 10:52:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:52:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:52:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:52:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:46] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2022-06-09 10:52:46] [INFO ] [Nat]Added 367 Read/Feed constraints in 193 ms returned sat
[2022-06-09 10:52:47] [INFO ] Deduced a trap composed of 131 places in 81 ms of which 1 ms to minimize.
[2022-06-09 10:52:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-06-09 10:52:47] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 65 ms.
[2022-06-09 10:52:48] [INFO ] Added : 93 causal constraints over 19 iterations in 1146 ms. Result :sat
Minimization took 755 ms.
[2022-06-09 10:52:49] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:52:49] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:49] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-06-09 10:52:49] [INFO ] [Real]Added 367 Read/Feed constraints in 200 ms returned sat
[2022-06-09 10:52:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:52:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:52:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:52:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:49] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-09 10:52:49] [INFO ] [Nat]Added 367 Read/Feed constraints in 200 ms returned sat
[2022-06-09 10:52:49] [INFO ] Deduced a trap composed of 131 places in 61 ms of which 0 ms to minimize.
[2022-06-09 10:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-06-09 10:52:50] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:52:51] [INFO ] Added : 94 causal constraints over 20 iterations in 1111 ms. Result :sat
Minimization took 644 ms.
[2022-06-09 10:52:51] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:52:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:52] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-09 10:52:52] [INFO ] [Real]Added 367 Read/Feed constraints in 189 ms returned sat
[2022-06-09 10:52:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:52:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:52:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:52:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:52] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-06-09 10:52:52] [INFO ] [Nat]Added 367 Read/Feed constraints in 189 ms returned sat
[2022-06-09 10:52:52] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:52:54] [INFO ] Added : 228 causal constraints over 46 iterations in 2013 ms. Result :sat
Minimization took 1962 ms.
[2022-06-09 10:52:56] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:52:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:56] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-06-09 10:52:57] [INFO ] [Real]Added 367 Read/Feed constraints in 195 ms returned sat
[2022-06-09 10:52:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:52:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:52:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:52:57] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-06-09 10:52:57] [INFO ] [Nat]Added 367 Read/Feed constraints in 187 ms returned sat
[2022-06-09 10:52:57] [INFO ] Deduced a trap composed of 131 places in 59 ms of which 0 ms to minimize.
[2022-06-09 10:52:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-06-09 10:52:57] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:53:00] [INFO ] Added : 255 causal constraints over 51 iterations in 2625 ms. Result :sat
Minimization took 2232 ms.
[2022-06-09 10:53:02] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:02] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-09 10:53:02] [INFO ] [Real]Added 367 Read/Feed constraints in 198 ms returned sat
[2022-06-09 10:53:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:53:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:03] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-09 10:53:03] [INFO ] [Nat]Added 367 Read/Feed constraints in 194 ms returned sat
[2022-06-09 10:53:03] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 71 ms.
[2022-06-09 10:53:04] [INFO ] Added : 97 causal constraints over 20 iterations in 993 ms. Result :sat
Minimization took 910 ms.
[2022-06-09 10:53:05] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:05] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-06-09 10:53:05] [INFO ] [Real]Added 367 Read/Feed constraints in 205 ms returned sat
[2022-06-09 10:53:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:53:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:05] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-06-09 10:53:06] [INFO ] [Nat]Added 367 Read/Feed constraints in 246 ms returned sat
[2022-06-09 10:53:06] [INFO ] Deduced a trap composed of 131 places in 66 ms of which 1 ms to minimize.
[2022-06-09 10:53:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2022-06-09 10:53:06] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 75 ms.
[2022-06-09 10:53:08] [INFO ] Added : 166 causal constraints over 34 iterations in 1724 ms. Result :sat
Minimization took 768 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, 128, 128, -1, -1] Max seen :[278, 193, 5, 4, 353, 82]
Incomplete Parikh walk after 115500 steps, including 188 resets, run finished after 448 ms. (steps per millisecond=257 ) properties (out of 6) seen :40 could not realise parikh vector
Incomplete Parikh walk after 276900 steps, including 571 resets, run finished after 1009 ms. (steps per millisecond=274 ) properties (out of 6) seen :9 could not realise parikh vector
Incomplete Parikh walk after 142900 steps, including 162 resets, run finished after 257 ms. (steps per millisecond=556 ) properties (out of 6) seen :128 could not realise parikh vector
FORMULA FunctionPointer-PT-c128-UpperBounds-11 128 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 97600 steps, including 118 resets, run finished after 95 ms. (steps per millisecond=1027 ) properties (out of 5) seen :128 could not realise parikh vector
FORMULA FunctionPointer-PT-c128-UpperBounds-08 128 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 368500 steps, including 469 resets, run finished after 2176 ms. (steps per millisecond=169 ) properties (out of 4) seen :5 could not realise parikh vector
Incomplete Parikh walk after 293200 steps, including 384 resets, run finished after 1731 ms. (steps per millisecond=169 ) properties (out of 4) seen :6 could not realise parikh vector
Support contains 4 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 46 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:53:14] [INFO ] Computed 2 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 4) seen :122
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 1373 ms. (steps per millisecond=728 ) properties (out of 4) seen :419
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 1373 ms. (steps per millisecond=728 ) properties (out of 4) seen :198
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1444 ms. (steps per millisecond=692 ) properties (out of 4) seen :600
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1473 ms. (steps per millisecond=678 ) properties (out of 4) seen :63
[2022-06-09 10:53:21] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:53:21] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 10:53:22] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:22] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-06-09 10:53:22] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:53:22] [INFO ] [Real]Added 367 Read/Feed constraints in 207 ms returned sat
[2022-06-09 10:53:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:22] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 10:53:22] [INFO ] [Nat]Added 367 Read/Feed constraints in 194 ms returned sat
[2022-06-09 10:53:22] [INFO ] Deduced a trap composed of 131 places in 62 ms of which 0 ms to minimize.
[2022-06-09 10:53:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2022-06-09 10:53:23] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 58 ms.
[2022-06-09 10:53:24] [INFO ] Added : 93 causal constraints over 19 iterations in 1107 ms. Result :sat
Minimization took 702 ms.
[2022-06-09 10:53:24] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 9 ms returned sat
[2022-06-09 10:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:24] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-09 10:53:25] [INFO ] [Real]Added 367 Read/Feed constraints in 203 ms returned sat
[2022-06-09 10:53:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-09 10:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:25] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-06-09 10:53:25] [INFO ] [Nat]Added 367 Read/Feed constraints in 195 ms returned sat
[2022-06-09 10:53:25] [INFO ] Deduced a trap composed of 131 places in 63 ms of which 1 ms to minimize.
[2022-06-09 10:53:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2022-06-09 10:53:25] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 63 ms.
[2022-06-09 10:53:26] [INFO ] Added : 94 causal constraints over 20 iterations in 1137 ms. Result :sat
Minimization took 855 ms.
[2022-06-09 10:53:27] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:27] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-06-09 10:53:28] [INFO ] [Real]Added 367 Read/Feed constraints in 203 ms returned sat
[2022-06-09 10:53:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:28] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-06-09 10:53:28] [INFO ] [Nat]Added 367 Read/Feed constraints in 196 ms returned sat
[2022-06-09 10:53:28] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:53:29] [INFO ] Added : 97 causal constraints over 20 iterations in 970 ms. Result :sat
Minimization took 872 ms.
[2022-06-09 10:53:30] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:53:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 10:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:30] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-06-09 10:53:30] [INFO ] [Real]Added 367 Read/Feed constraints in 204 ms returned sat
[2022-06-09 10:53:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:53:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:53:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:31] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-09 10:53:31] [INFO ] [Nat]Added 367 Read/Feed constraints in 196 ms returned sat
[2022-06-09 10:53:31] [INFO ] Deduced a trap composed of 131 places in 52 ms of which 0 ms to minimize.
[2022-06-09 10:53:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-06-09 10:53:31] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 61 ms.
[2022-06-09 10:53:33] [INFO ] Added : 201 causal constraints over 41 iterations in 2494 ms. Result :sat
Minimization took 741 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[402, 193, 534, 122]
Incomplete Parikh walk after 122700 steps, including 288 resets, run finished after 280 ms. (steps per millisecond=438 ) properties (out of 4) seen :9 could not realise parikh vector
Incomplete Parikh walk after 367400 steps, including 851 resets, run finished after 1233 ms. (steps per millisecond=297 ) properties (out of 4) seen :85 could not realise parikh vector
Incomplete Parikh walk after 368500 steps, including 479 resets, run finished after 2176 ms. (steps per millisecond=169 ) properties (out of 4) seen :5 could not realise parikh vector
Incomplete Parikh walk after 367600 steps, including 503 resets, run finished after 2121 ms. (steps per millisecond=173 ) properties (out of 4) seen :9 could not realise parikh vector
Support contains 4 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 46 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 45 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2022-06-09 10:53:40] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:53:40] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 10:53:40] [INFO ] Implicit Places using invariants in 305 ms returned []
[2022-06-09 10:53:40] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:53:40] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 10:53:41] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:53:42] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
[2022-06-09 10:53:42] [INFO ] Redundant transitions in 82 ms returned []
[2022-06-09 10:53:42] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:53:42] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 10:53:42] [INFO ] Dead Transitions using invariants and state equation in 364 ms returned []
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:53:42] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2243 ms. (steps per millisecond=445 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 1397 ms. (steps per millisecond=715 ) properties (out of 4) seen :292
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 1342 ms. (steps per millisecond=745 ) properties (out of 4) seen :332
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 1373 ms. (steps per millisecond=728 ) properties (out of 4) seen :337
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1484 ms. (steps per millisecond=673 ) properties (out of 4) seen :54
[2022-06-09 10:53:50] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:53:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:53:50] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:53:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:50] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-06-09 10:53:50] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:53:51] [INFO ] [Real]Added 367 Read/Feed constraints in 201 ms returned sat
[2022-06-09 10:53:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:53:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:51] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-06-09 10:53:51] [INFO ] [Nat]Added 367 Read/Feed constraints in 193 ms returned sat
[2022-06-09 10:53:51] [INFO ] Deduced a trap composed of 131 places in 56 ms of which 0 ms to minimize.
[2022-06-09 10:53:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-06-09 10:53:51] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 63 ms.
[2022-06-09 10:53:52] [INFO ] Added : 93 causal constraints over 19 iterations in 1123 ms. Result :sat
Minimization took 730 ms.
[2022-06-09 10:53:53] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:53:53] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:53] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-06-09 10:53:54] [INFO ] [Real]Added 367 Read/Feed constraints in 206 ms returned sat
[2022-06-09 10:53:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:54] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-06-09 10:53:54] [INFO ] [Nat]Added 367 Read/Feed constraints in 206 ms returned sat
[2022-06-09 10:53:54] [INFO ] Deduced a trap composed of 131 places in 57 ms of which 1 ms to minimize.
[2022-06-09 10:53:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-06-09 10:53:54] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 95 ms.
[2022-06-09 10:53:55] [INFO ] Added : 95 causal constraints over 20 iterations in 1163 ms. Result :sat
Minimization took 757 ms.
[2022-06-09 10:53:56] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-06-09 10:53:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:56] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-06-09 10:53:56] [INFO ] [Real]Added 367 Read/Feed constraints in 207 ms returned sat
[2022-06-09 10:53:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:57] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-06-09 10:53:57] [INFO ] [Nat]Added 367 Read/Feed constraints in 196 ms returned sat
[2022-06-09 10:53:57] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:53:58] [INFO ] Added : 97 causal constraints over 20 iterations in 984 ms. Result :sat
Minimization took 802 ms.
[2022-06-09 10:53:59] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:53:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:59] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-06-09 10:53:59] [INFO ] [Real]Added 367 Read/Feed constraints in 204 ms returned sat
[2022-06-09 10:53:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:53:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:53:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:53:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:53:59] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-09 10:54:00] [INFO ] [Nat]Added 367 Read/Feed constraints in 201 ms returned sat
[2022-06-09 10:54:00] [INFO ] Deduced a trap composed of 131 places in 61 ms of which 0 ms to minimize.
[2022-06-09 10:54:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-06-09 10:54:00] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 63 ms.
[2022-06-09 10:54:02] [INFO ] Added : 201 causal constraints over 41 iterations in 2455 ms. Result :sat
Minimization took 810 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[402, 316, 534, 122]
Incomplete Parikh walk after 122700 steps, including 289 resets, run finished after 293 ms. (steps per millisecond=418 ) properties (out of 4) seen :10 could not realise parikh vector
Incomplete Parikh walk after 367400 steps, including 883 resets, run finished after 1210 ms. (steps per millisecond=303 ) properties (out of 4) seen :6 could not realise parikh vector
Incomplete Parikh walk after 479600 steps, including 1000 resets, run finished after 1860 ms. (steps per millisecond=257 ) properties (out of 4) seen :88 could not realise parikh vector
Incomplete Parikh walk after 367600 steps, including 504 resets, run finished after 2151 ms. (steps per millisecond=170 ) properties (out of 4) seen :6 could not realise parikh vector
Support contains 4 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 45 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 44 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2022-06-09 10:54:09] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:09] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 10:54:09] [INFO ] Implicit Places using invariants in 293 ms returned []
[2022-06-09 10:54:09] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:09] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 10:54:09] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:54:11] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 1972 ms to find 0 implicit places.
[2022-06-09 10:54:11] [INFO ] Redundant transitions in 17 ms returned []
[2022-06-09 10:54:11] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:11] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 10:54:11] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:11] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2246 ms. (steps per millisecond=445 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1451 ms. (steps per millisecond=689 ) properties (out of 4) seen :594
Incomplete Best-First random walk after 1000001 steps, including 12 resets, run finished after 1266 ms. (steps per millisecond=789 ) properties (out of 4) seen :130
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1460 ms. (steps per millisecond=684 ) properties (out of 4) seen :562
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1478 ms. (steps per millisecond=676 ) properties (out of 4) seen :109
[2022-06-09 10:54:19] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:19] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 10:54:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:19] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 10:54:19] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:54:19] [INFO ] [Real]Added 367 Read/Feed constraints in 203 ms returned sat
[2022-06-09 10:54:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:54:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:20] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-06-09 10:54:20] [INFO ] [Nat]Added 367 Read/Feed constraints in 193 ms returned sat
[2022-06-09 10:54:20] [INFO ] Deduced a trap composed of 131 places in 59 ms of which 0 ms to minimize.
[2022-06-09 10:54:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2022-06-09 10:54:20] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 128 ms.
[2022-06-09 10:54:21] [INFO ] Added : 93 causal constraints over 19 iterations in 1159 ms. Result :sat
Minimization took 823 ms.
[2022-06-09 10:54:22] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:54:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:22] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-06-09 10:54:22] [INFO ] [Real]Added 367 Read/Feed constraints in 203 ms returned sat
[2022-06-09 10:54:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:54:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 10:54:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:22] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-06-09 10:54:23] [INFO ] [Nat]Added 367 Read/Feed constraints in 204 ms returned sat
[2022-06-09 10:54:23] [INFO ] Deduced a trap composed of 131 places in 59 ms of which 1 ms to minimize.
[2022-06-09 10:54:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-06-09 10:54:23] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 63 ms.
[2022-06-09 10:54:24] [INFO ] Added : 95 causal constraints over 20 iterations in 1155 ms. Result :sat
Minimization took 799 ms.
[2022-06-09 10:54:25] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:54:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:25] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 10:54:25] [INFO ] [Real]Added 367 Read/Feed constraints in 207 ms returned sat
[2022-06-09 10:54:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:54:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:54:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:25] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-06-09 10:54:26] [INFO ] [Nat]Added 367 Read/Feed constraints in 192 ms returned sat
[2022-06-09 10:54:26] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:54:27] [INFO ] Added : 97 causal constraints over 20 iterations in 955 ms. Result :sat
Minimization took 948 ms.
[2022-06-09 10:54:28] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:54:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:28] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-06-09 10:54:28] [INFO ] [Real]Added 367 Read/Feed constraints in 202 ms returned sat
[2022-06-09 10:54:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:54:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:54:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 10:54:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:28] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-06-09 10:54:28] [INFO ] [Nat]Added 367 Read/Feed constraints in 195 ms returned sat
[2022-06-09 10:54:28] [INFO ] Deduced a trap composed of 131 places in 61 ms of which 1 ms to minimize.
[2022-06-09 10:54:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-06-09 10:54:29] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:54:31] [INFO ] Added : 201 causal constraints over 41 iterations in 2504 ms. Result :sat
Minimization took 822 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[562, 316, 539, 122]
Incomplete Parikh walk after 122700 steps, including 280 resets, run finished after 271 ms. (steps per millisecond=452 ) properties (out of 4) seen :9 could not realise parikh vector
Incomplete Parikh walk after 369900 steps, including 867 resets, run finished after 1209 ms. (steps per millisecond=305 ) properties (out of 4) seen :481 could not realise parikh vector
Incomplete Parikh walk after 479600 steps, including 1000 resets, run finished after 1875 ms. (steps per millisecond=255 ) properties (out of 4) seen :41 could not realise parikh vector
Incomplete Parikh walk after 463600 steps, including 688 resets, run finished after 2622 ms. (steps per millisecond=176 ) properties (out of 4) seen :21 could not realise parikh vector
Support contains 4 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 45 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 45 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2022-06-09 10:54:38] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:38] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 10:54:38] [INFO ] Implicit Places using invariants in 282 ms returned []
[2022-06-09 10:54:38] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:54:38] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:54:40] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2022-06-09 10:54:40] [INFO ] Redundant transitions in 125 ms returned []
[2022-06-09 10:54:40] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:40] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 10:54:40] [INFO ] Dead Transitions using invariants and state equation in 390 ms returned []
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:40] [INFO ] Computed 2 place invariants in 5 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 2219 ms. (steps per millisecond=450 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1400 ms. (steps per millisecond=714 ) properties (out of 4) seen :37
Incomplete Best-First random walk after 1000001 steps, including 7 resets, run finished after 1389 ms. (steps per millisecond=719 ) properties (out of 4) seen :136
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 1471 ms. (steps per millisecond=679 ) properties (out of 4) seen :335
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1472 ms. (steps per millisecond=679 ) properties (out of 4) seen :61
[2022-06-09 10:54:48] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:54:48] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 10:54:48] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:54:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:49] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-06-09 10:54:49] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:54:49] [INFO ] [Real]Added 367 Read/Feed constraints in 206 ms returned sat
[2022-06-09 10:54:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:54:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:49] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-09 10:54:49] [INFO ] [Nat]Added 367 Read/Feed constraints in 194 ms returned sat
[2022-06-09 10:54:49] [INFO ] Deduced a trap composed of 131 places in 62 ms of which 0 ms to minimize.
[2022-06-09 10:54:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-06-09 10:54:49] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 62 ms.
[2022-06-09 10:54:50] [INFO ] Added : 93 causal constraints over 19 iterations in 1047 ms. Result :sat
Minimization took 742 ms.
[2022-06-09 10:54:51] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:51] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-09 10:54:52] [INFO ] [Real]Added 367 Read/Feed constraints in 199 ms returned sat
[2022-06-09 10:54:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:54:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:52] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-06-09 10:54:52] [INFO ] [Nat]Added 367 Read/Feed constraints in 201 ms returned sat
[2022-06-09 10:54:52] [INFO ] Deduced a trap composed of 131 places in 52 ms of which 0 ms to minimize.
[2022-06-09 10:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2022-06-09 10:54:52] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:54:53] [INFO ] Added : 95 causal constraints over 20 iterations in 1163 ms. Result :sat
Minimization took 724 ms.
[2022-06-09 10:54:54] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:54] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 10:54:54] [INFO ] [Real]Added 367 Read/Feed constraints in 202 ms returned sat
[2022-06-09 10:54:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:54:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:55] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 10:54:55] [INFO ] [Nat]Added 367 Read/Feed constraints in 193 ms returned sat
[2022-06-09 10:54:55] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 64 ms.
[2022-06-09 10:54:56] [INFO ] Added : 97 causal constraints over 20 iterations in 976 ms. Result :sat
Minimization took 856 ms.
[2022-06-09 10:54:57] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:57] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 10:54:57] [INFO ] [Real]Added 367 Read/Feed constraints in 204 ms returned sat
[2022-06-09 10:54:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:54:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:54:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:54:57] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-06-09 10:54:58] [INFO ] [Nat]Added 367 Read/Feed constraints in 194 ms returned sat
[2022-06-09 10:54:58] [INFO ] Deduced a trap composed of 131 places in 59 ms of which 1 ms to minimize.
[2022-06-09 10:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-06-09 10:54:58] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 66 ms.
[2022-06-09 10:55:00] [INFO ] Added : 201 causal constraints over 41 iterations in 2454 ms. Result :sat
Minimization took 694 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[562, 316, 539, 122]
Incomplete Parikh walk after 122700 steps, including 287 resets, run finished after 284 ms. (steps per millisecond=432 ) properties (out of 4) seen :9 could not realise parikh vector
Incomplete Parikh walk after 369900 steps, including 879 resets, run finished after 1226 ms. (steps per millisecond=301 ) properties (out of 4) seen :6 could not realise parikh vector
Incomplete Parikh walk after 479600 steps, including 1000 resets, run finished after 1854 ms. (steps per millisecond=258 ) properties (out of 4) seen :59 could not realise parikh vector
Incomplete Parikh walk after 463600 steps, including 664 resets, run finished after 2642 ms. (steps per millisecond=175 ) properties (out of 4) seen :15 could not realise parikh vector
Support contains 4 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 44 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Applied a total of 0 rules in 44 ms. Remains 430 /430 variables (removed 0) and now considering 1238/1238 (removed 0) transitions.
[2022-06-09 10:55:07] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:07] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 10:55:07] [INFO ] Implicit Places using invariants in 278 ms returned []
[2022-06-09 10:55:07] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:07] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 10:55:07] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:55:09] [INFO ] Implicit Places using invariants and state equation in 1718 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2022-06-09 10:55:09] [INFO ] Redundant transitions in 23 ms returned []
[2022-06-09 10:55:09] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:09] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 10:55:09] [INFO ] Dead Transitions using invariants and state equation in 363 ms returned []
Finished structural reductions, in 1 iterations. Remains : 430/430 places, 1238/1238 transitions.
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-00
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:09] [INFO ] Computed 2 place invariants in 3 ms
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 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-06-09 10:55:09] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:09] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 10:55:09] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:55:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:10] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-09 10:55:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:55:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:55:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:10] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 10:55:10] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:55:10] [INFO ] [Nat]Added 367 Read/Feed constraints in 221 ms returned sat
[2022-06-09 10:55:10] [INFO ] Deduced a trap composed of 131 places in 62 ms of which 1 ms to minimize.
[2022-06-09 10:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2022-06-09 10:55:10] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 62 ms.
[2022-06-09 10:55:12] [INFO ] Added : 156 causal constraints over 32 iterations in 1550 ms. Result :sat
Minimization took 730 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 127500 steps, including 165 resets, run finished after 504 ms. (steps per millisecond=252 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Graph (complete) has 2131 edges and 430 vertex of which 427 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 425 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 425 transition count 1228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 423 transition count 1222
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 422 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 422 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 421 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 421 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 420 transition count 1214
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 419 transition count 1212
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 419 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 418 transition count 1210
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 417 transition count 1208
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 416 transition count 1206
Applied a total of 31 rules in 175 ms. Remains 416 /430 variables (removed 14) and now considering 1206/1238 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/430 places, 1206/1238 transitions.
Normalized transition count is 681 out of 1206 initially.
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:13] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2133 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1356 ms. (steps per millisecond=737 ) properties (out of 1) seen :494
[2022-06-09 10:55:17] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:17] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 10:55:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 10:55:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:17] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-09 10:55:17] [INFO ] State equation strengthened by 347 read => feed constraints.
[2022-06-09 10:55:17] [INFO ] [Real]Added 347 Read/Feed constraints in 185 ms returned sat
[2022-06-09 10:55:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:55:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:17] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2022-06-09 10:55:17] [INFO ] [Nat]Added 347 Read/Feed constraints in 180 ms returned sat
[2022-06-09 10:55:17] [INFO ] Deduced a trap composed of 131 places in 68 ms of which 0 ms to minimize.
[2022-06-09 10:55:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-06-09 10:55:18] [INFO ] Computed and/alt/rep : 330/1240/330 causal constraints (skipped 349 transitions) in 59 ms.
[2022-06-09 10:55:19] [INFO ] Added : 101 causal constraints over 21 iterations in 1022 ms. Result :sat
Minimization took 711 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[494]
Incomplete Parikh walk after 387400 steps, including 961 resets, run finished after 1293 ms. (steps per millisecond=299 ) properties (out of 1) seen :7 could not realise parikh vector
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 10:55:21] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:21] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 10:55:21] [INFO ] Implicit Places using invariants in 272 ms returned []
[2022-06-09 10:55:21] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:21] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 10:55:21] [INFO ] State equation strengthened by 347 read => feed constraints.
[2022-06-09 10:55:23] [INFO ] Implicit Places using invariants and state equation in 1582 ms returned []
Implicit Place search using SMT with State Equation took 1868 ms to find 0 implicit places.
[2022-06-09 10:55:23] [INFO ] Redundant transitions in 17 ms returned []
[2022-06-09 10:55:23] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:23] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 10:55:23] [INFO ] Dead Transitions using invariants and state equation in 358 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1206/1206 transitions.
Normalized transition count is 681 out of 1206 initially.
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:23] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2171 ms. (steps per millisecond=460 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1357 ms. (steps per millisecond=736 ) properties (out of 1) seen :443
[2022-06-09 10:55:26] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:26] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 10:55:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 10:55:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:27] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-06-09 10:55:27] [INFO ] State equation strengthened by 347 read => feed constraints.
[2022-06-09 10:55:27] [INFO ] [Real]Added 347 Read/Feed constraints in 183 ms returned sat
[2022-06-09 10:55:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:55:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 10:55:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:27] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 10:55:27] [INFO ] [Nat]Added 347 Read/Feed constraints in 174 ms returned sat
[2022-06-09 10:55:27] [INFO ] Deduced a trap composed of 131 places in 60 ms of which 0 ms to minimize.
[2022-06-09 10:55:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2022-06-09 10:55:27] [INFO ] Computed and/alt/rep : 330/1240/330 causal constraints (skipped 349 transitions) in 62 ms.
[2022-06-09 10:55:28] [INFO ] Added : 101 causal constraints over 21 iterations in 1021 ms. Result :sat
Minimization took 710 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[494]
Incomplete Parikh walk after 387400 steps, including 993 resets, run finished after 1306 ms. (steps per millisecond=296 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 10:55:31] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:31] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 10:55:31] [INFO ] Implicit Places using invariants in 256 ms returned []
[2022-06-09 10:55:31] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:31] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 10:55:31] [INFO ] State equation strengthened by 347 read => feed constraints.
[2022-06-09 10:55:32] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 1869 ms to find 0 implicit places.
[2022-06-09 10:55:32] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-09 10:55:32] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:55:32] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 10:55:33] [INFO ] Dead Transitions using invariants and state equation in 364 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1206/1206 transitions.
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-00 in 23478 ms.
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-06
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:33] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :6
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
[2022-06-09 10:55:33] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:33] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 10:55:33] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:55:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:33] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-06-09 10:55:33] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:55:33] [INFO ] [Real]Added 367 Read/Feed constraints in 201 ms returned sat
[2022-06-09 10:55:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:55:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:55:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:33] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 10:55:34] [INFO ] [Nat]Added 367 Read/Feed constraints in 204 ms returned sat
[2022-06-09 10:55:34] [INFO ] Deduced a trap composed of 131 places in 56 ms of which 1 ms to minimize.
[2022-06-09 10:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-06-09 10:55:34] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 126 ms.
[2022-06-09 10:55:35] [INFO ] Added : 97 causal constraints over 20 iterations in 1243 ms. Result :sat
Minimization took 708 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[6]
Incomplete Parikh walk after 130400 steps, including 228 resets, run finished after 498 ms. (steps per millisecond=261 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Graph (complete) has 2131 edges and 430 vertex of which 427 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 425 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 425 transition count 1228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 425 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 423 transition count 1222
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 422 transition count 1220
Applied a total of 19 rules in 90 ms. Remains 422 /430 variables (removed 8) and now considering 1220/1238 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/430 places, 1220/1238 transitions.
Normalized transition count is 689 out of 1220 initially.
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:36] [INFO ] Computed 3 place invariants in 6 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2223 ms. (steps per millisecond=449 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties (out of 1) seen :156
[2022-06-09 10:55:40] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:40] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 10:55:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:40] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-09 10:55:40] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 10:55:40] [INFO ] [Real]Added 353 Read/Feed constraints in 188 ms returned sat
[2022-06-09 10:55:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:55:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:41] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-09 10:55:41] [INFO ] [Nat]Added 353 Read/Feed constraints in 196 ms returned sat
[2022-06-09 10:55:41] [INFO ] Deduced a trap composed of 131 places in 64 ms of which 1 ms to minimize.
[2022-06-09 10:55:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-06-09 10:55:41] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 62 ms.
[2022-06-09 10:55:42] [INFO ] Added : 107 causal constraints over 22 iterations in 1274 ms. Result :sat
Minimization took 747 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[156]
Incomplete Parikh walk after 285900 steps, including 711 resets, run finished after 1000 ms. (steps per millisecond=285 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2022-06-09 10:55:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:44] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 10:55:44] [INFO ] Implicit Places using invariants in 264 ms returned []
[2022-06-09 10:55:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:44] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 10:55:45] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 10:55:46] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
[2022-06-09 10:55:46] [INFO ] Redundant transitions in 18 ms returned []
[2022-06-09 10:55:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:46] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 10:55:46] [INFO ] Dead Transitions using invariants and state equation in 364 ms returned []
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Normalized transition count is 689 out of 1220 initially.
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:46] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2260 ms. (steps per millisecond=442 ) properties (out of 1) seen :14
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1367 ms. (steps per millisecond=731 ) properties (out of 1) seen :143
[2022-06-09 10:55:50] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:50] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 10:55:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:50] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-09 10:55:50] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 10:55:50] [INFO ] [Real]Added 353 Read/Feed constraints in 188 ms returned sat
[2022-06-09 10:55:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:55:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:51] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-06-09 10:55:51] [INFO ] [Nat]Added 353 Read/Feed constraints in 192 ms returned sat
[2022-06-09 10:55:51] [INFO ] Deduced a trap composed of 131 places in 61 ms of which 0 ms to minimize.
[2022-06-09 10:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-06-09 10:55:51] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 66 ms.
[2022-06-09 10:55:52] [INFO ] Added : 107 causal constraints over 22 iterations in 1291 ms. Result :sat
Minimization took 753 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[156]
Incomplete Parikh walk after 285900 steps, including 671 resets, run finished after 996 ms. (steps per millisecond=287 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2022-06-09 10:55:54] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:54] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 10:55:54] [INFO ] Implicit Places using invariants in 268 ms returned []
[2022-06-09 10:55:54] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:54] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 10:55:55] [INFO ] State equation strengthened by 353 read => feed constraints.
[2022-06-09 10:55:56] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 1809 ms to find 0 implicit places.
[2022-06-09 10:55:56] [INFO ] Redundant transitions in 18 ms returned []
[2022-06-09 10:55:56] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2022-06-09 10:55:56] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 10:55:56] [INFO ] Dead Transitions using invariants and state equation in 363 ms returned []
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 1220/1220 transitions.
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-06 in 23484 ms.
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-14
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:56] [INFO ] Computed 2 place invariants in 12 ms
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 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2022-06-09 10:55:56] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:55:56] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 10:55:56] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:55:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:57] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-09 10:55:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:55:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:55:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:55:57] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-06-09 10:55:57] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:55:57] [INFO ] [Nat]Added 367 Read/Feed constraints in 209 ms returned sat
[2022-06-09 10:55:57] [INFO ] Deduced a trap composed of 131 places in 60 ms of which 0 ms to minimize.
[2022-06-09 10:55:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2022-06-09 10:55:57] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 65 ms.
[2022-06-09 10:55:58] [INFO ] Added : 96 causal constraints over 20 iterations in 1116 ms. Result :sat
Minimization took 678 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 115800 steps, including 182 resets, run finished after 437 ms. (steps per millisecond=264 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Graph (complete) has 2131 edges and 430 vertex of which 427 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 427 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 425 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 425 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 423 transition count 1224
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 423 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 421 transition count 1218
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 420 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 419 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 419 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 418 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 418 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 417 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 417 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 416 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 415 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 415 transition count 1206
Applied a total of 31 rules in 121 ms. Remains 415 /430 variables (removed 15) and now considering 1206/1238 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/430 places, 1206/1238 transitions.
Normalized transition count is 680 out of 1206 initially.
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:55:59] [INFO ] Computed 3 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2128 ms. (steps per millisecond=469 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1388 ms. (steps per millisecond=720 ) properties (out of 1) seen :595
[2022-06-09 10:56:03] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:03] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 10:56:03] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:56:03] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-09 10:56:03] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 10:56:03] [INFO ] [Real]Added 348 Read/Feed constraints in 204 ms returned sat
[2022-06-09 10:56:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:56:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:56:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:56:04] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-09 10:56:04] [INFO ] [Nat]Added 348 Read/Feed constraints in 192 ms returned sat
[2022-06-09 10:56:04] [INFO ] Deduced a trap composed of 131 places in 64 ms of which 1 ms to minimize.
[2022-06-09 10:56:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-06-09 10:56:04] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 61 ms.
[2022-06-09 10:56:05] [INFO ] Added : 94 causal constraints over 19 iterations in 1121 ms. Result :sat
Minimization took 617 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[595]
Incomplete Parikh walk after 386100 steps, including 993 resets, run finished after 1266 ms. (steps per millisecond=304 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 10:56:07] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:07] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 10:56:07] [INFO ] Implicit Places using invariants in 251 ms returned []
[2022-06-09 10:56:07] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 10:56:08] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 10:56:09] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2022-06-09 10:56:09] [INFO ] Redundant transitions in 20 ms returned []
[2022-06-09 10:56:09] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:09] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 10:56:09] [INFO ] Dead Transitions using invariants and state equation in 359 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Normalized transition count is 680 out of 1206 initially.
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:09] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2150 ms. (steps per millisecond=465 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1380 ms. (steps per millisecond=724 ) properties (out of 1) seen :502
[2022-06-09 10:56:13] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:13] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 10:56:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 10:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:56:13] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-09 10:56:13] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 10:56:13] [INFO ] [Real]Added 348 Read/Feed constraints in 187 ms returned sat
[2022-06-09 10:56:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:56:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-09 10:56:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:56:13] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2022-06-09 10:56:14] [INFO ] [Nat]Added 348 Read/Feed constraints in 181 ms returned sat
[2022-06-09 10:56:14] [INFO ] Deduced a trap composed of 131 places in 63 ms of which 1 ms to minimize.
[2022-06-09 10:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2022-06-09 10:56:14] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 60 ms.
[2022-06-09 10:56:15] [INFO ] Added : 94 causal constraints over 19 iterations in 1120 ms. Result :sat
Minimization took 619 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[595]
Incomplete Parikh walk after 386100 steps, including 979 resets, run finished after 1264 ms. (steps per millisecond=305 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 415 /415 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 10:56:17] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:17] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 10:56:17] [INFO ] Implicit Places using invariants in 250 ms returned []
[2022-06-09 10:56:17] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:17] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 10:56:17] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 10:56:19] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
[2022-06-09 10:56:19] [INFO ] Redundant transitions in 21 ms returned []
[2022-06-09 10:56:19] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2022-06-09 10:56:19] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-09 10:56:19] [INFO ] Dead Transitions using invariants and state equation in 363 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 1206/1206 transitions.
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-14 in 22724 ms.
Starting property specific reduction for FunctionPointer-PT-c128-UpperBounds-15
Normalized transition count is 706 out of 1238 initially.
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:56:19] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10026 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 1) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
[2022-06-09 10:56:19] [INFO ] Flow matrix only has 706 transitions (discarded 532 similar events)
// Phase 1: matrix 706 rows 430 cols
[2022-06-09 10:56:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:56:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:56:19] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-06-09 10:56:19] [INFO ] State equation strengthened by 367 read => feed constraints.
[2022-06-09 10:56:19] [INFO ] [Real]Added 367 Read/Feed constraints in 208 ms returned sat
[2022-06-09 10:56:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:56:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:56:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:56:20] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-09 10:56:20] [INFO ] [Nat]Added 367 Read/Feed constraints in 193 ms returned sat
[2022-06-09 10:56:20] [INFO ] Deduced a trap composed of 131 places in 64 ms of which 0 ms to minimize.
[2022-06-09 10:56:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-06-09 10:56:20] [INFO ] Computed and/alt/rep : 337/2029/337 causal constraints (skipped 367 transitions) in 63 ms.
[2022-06-09 10:56:22] [INFO ] Added : 162 causal constraints over 33 iterations in 1725 ms. Result :sat
Minimization took 768 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[42]
Incomplete Parikh walk after 117000 steps, including 125 resets, run finished after 588 ms. (steps per millisecond=198 ) properties (out of 1) seen :44 could not realise parikh vector
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 430/430 places, 1238/1238 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 427 transition count 1232
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 427 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 427 transition count 1230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 424 transition count 1224
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 422 transition count 1218
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 422 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 421 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 421 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 420 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 419 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 419 transition count 1212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 418 transition count 1210
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 418 transition count 1210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 417 transition count 1208
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 416 transition count 1206
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 416 transition count 1206
Applied a total of 30 rules in 115 ms. Remains 416 /430 variables (removed 14) and now considering 1206/1238 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/430 places, 1206/1238 transitions.
Normalized transition count is 681 out of 1206 initially.
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:56:23] [INFO ] Computed 2 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2155 ms. (steps per millisecond=464 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1362 ms. (steps per millisecond=734 ) properties (out of 1) seen :41
[2022-06-09 10:56:27] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:56:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:27] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2022-06-09 10:56:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 10:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 10:56:27] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-06-09 10:56:27] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 10:56:27] [INFO ] [Real]Added 348 Read/Feed constraints in 174 ms returned sat
[2022-06-09 10:56:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 10:56:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-09 10:56:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 10:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 10:56:27] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-09 10:56:28] [INFO ] [Nat]Added 348 Read/Feed constraints in 176 ms returned sat
[2022-06-09 10:56:28] [INFO ] Deduced a trap composed of 131 places in 57 ms of which 1 ms to minimize.
[2022-06-09 10:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-06-09 10:56:28] [INFO ] Computed and/alt/rep : 334/1253/332 causal constraints (skipped 347 transitions) in 62 ms.
[2022-06-09 10:56:29] [INFO ] Added : 163 causal constraints over 33 iterations in 1528 ms. Result :sat
Minimization took 763 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[44]
Incomplete Parikh walk after 97300 steps, including 152 resets, run finished after 356 ms. (steps per millisecond=273 ) properties (out of 1) seen :33 could not realise parikh vector
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 44 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 43 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2022-06-09 10:56:30] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:56:30] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 10:56:31] [INFO ] Implicit Places using invariants in 262 ms returned []
[2022-06-09 10:56:31] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:56:31] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 10:56:31] [INFO ] State equation strengthened by 348 read => feed constraints.
[2022-06-09 10:56:32] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1527 ms to find 0 implicit places.
[2022-06-09 10:56:32] [INFO ] Redundant transitions in 16 ms returned []
[2022-06-09 10:56:32] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2022-06-09 10:56:32] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 10:56:32] [INFO ] Dead Transitions using invariants and state equation in 358 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1206/1206 transitions.
Ending property specific reduction for FunctionPointer-PT-c128-UpperBounds-15 in 13344 ms.
[2022-06-09 10:56:33] [INFO ] Flatten gal took : 204 ms
[2022-06-09 10:56:33] [INFO ] Applying decomposition
[2022-06-09 10:56:33] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14244670659526181363.txt, -o, /tmp/graph14244670659526181363.bin, -w, /tmp/graph14244670659526181363.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14244670659526181363.bin, -l, -1, -v, -w, /tmp/graph14244670659526181363.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 10:56:33] [INFO ] Decomposing Gal with order
[2022-06-09 10:56:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 10:56:34] [INFO ] Removed a total of 2117 redundant transitions.
[2022-06-09 10:56:34] [INFO ] Flatten gal took : 294 ms
[2022-06-09 10:56:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 885 labels/synchronizations in 92 ms.
[2022-06-09 10:56:34] [INFO ] Time to serialize gal into /tmp/UpperBounds7729135626314627357.gal : 15 ms
[2022-06-09 10:56:34] [INFO ] Time to serialize properties into /tmp/UpperBounds6035816827053673203.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7729135626314627357.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6035816827053673203.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7729135626314627357.gal -t CGAL -reachable-file /tmp/UpperBounds6035816827053673203.prop --nowitness
Loading property file /tmp/UpperBounds6035816827053673203.prop.
Detected timeout of ITS tools.
[2022-06-09 11:18:12] [INFO ] Flatten gal took : 57 ms
[2022-06-09 11:18:12] [INFO ] Time to serialize gal into /tmp/UpperBounds8167014807652703365.gal : 9 ms
[2022-06-09 11:18:12] [INFO ] Time to serialize properties into /tmp/UpperBounds6769759696782768823.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8167014807652703365.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6769759696782768823.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8167014807652703365.gal -t CGAL -reachable-file /tmp/UpperBounds6769759696782768823.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds6769759696782768823.prop.
Detected timeout of ITS tools.
[2022-06-09 11:39:51] [INFO ] Flatten gal took : 286 ms
[2022-06-09 11:39:59] [INFO ] Input system was already deterministic with 1238 transitions.
[2022-06-09 11:39:59] [INFO ] Transformed 430 places.
[2022-06-09 11:39:59] [INFO ] Transformed 1238 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 11:39:59] [INFO ] Time to serialize gal into /tmp/UpperBounds2768218522701713967.gal : 22 ms
[2022-06-09 11:39:59] [INFO ] Time to serialize properties into /tmp/UpperBounds10001342224220969244.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2768218522701713967.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10001342224220969244.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2768218522701713967.gal -t CGAL -reachable-file /tmp/UpperBounds10001342224220969244.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10001342224220969244.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-c128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is FunctionPointer-PT-c128, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472292800196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c128.tgz
mv FunctionPointer-PT-c128 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;