About the Execution of 2023-gold for FunctionPointer-PT-c004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.651 | 3600000.00 | 3663886.00 | 35506.10 | 0 ? 0 ? 0 ? ? 0 0 0 ? ? ? 0 0 4 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625000176.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FunctionPointer-PT-c004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000176
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 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-c004-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716528294534
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 05:24:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 05:24:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 05:24:57] [INFO ] Load time of PNML (sax parser for PT used): 344 ms
[2024-05-24 05:24:57] [INFO ] Transformed 2826 places.
[2024-05-24 05:24:57] [INFO ] Transformed 8960 transitions.
[2024-05-24 05:24:57] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1198 places in 44 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3540 out of 5962 initially.
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-24 05:24:57] [INFO ] Computed 4 invariants in 115 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
[2024-05-24 05:24:57] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-24 05:24:57] [INFO ] Computed 4 invariants in 70 ms
[2024-05-24 05:24:58] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-24 05:24:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:24:59] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2024-05-24 05:24:59] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-24 05:24:59] [INFO ] [Real]Added 479 Read/Feed constraints in 186 ms returned sat
[2024-05-24 05:24:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:24:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-24 05:24:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:00] [INFO ] [Nat]Absence check using state equation in 835 ms returned sat
[2024-05-24 05:25:00] [INFO ] [Nat]Added 479 Read/Feed constraints in 90 ms returned sat
[2024-05-24 05:25:01] [INFO ] Deduced a trap composed of 133 places in 1157 ms of which 14 ms to minimize.
[2024-05-24 05:25:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1415 ms
[2024-05-24 05:25:02] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 804 ms.
[2024-05-24 05:25:03] [INFO ] Added : 2 causal constraints over 1 iterations in 1170 ms. Result :sat
[2024-05-24 05:25:03] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-24 05:25:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-24 05:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:04] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2024-05-24 05:25:04] [INFO ] [Real]Added 479 Read/Feed constraints in 220 ms returned sat
[2024-05-24 05:25:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-24 05:25:04] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:25:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:05] [INFO ] [Nat]Absence check using state equation in 871 ms returned sat
[2024-05-24 05:25:05] [INFO ] [Nat]Added 479 Read/Feed constraints in 135 ms returned sat
[2024-05-24 05:25:07] [INFO ] Deduced a trap composed of 133 places in 1106 ms of which 2 ms to minimize.
[2024-05-24 05:25:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1279 ms
[2024-05-24 05:25:07] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 666 ms.
[2024-05-24 05:25:08] [INFO ] Added : 2 causal constraints over 1 iterations in 1002 ms. Result :sat
[2024-05-24 05:25:08] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-24 05:25:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:09] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2024-05-24 05:25:09] [INFO ] [Real]Added 479 Read/Feed constraints in 188 ms returned sat
[2024-05-24 05:25:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-24 05:25:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:10] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2024-05-24 05:25:10] [INFO ] [Nat]Added 479 Read/Feed constraints in 141 ms returned sat
[2024-05-24 05:25:12] [INFO ] Deduced a trap composed of 133 places in 1224 ms of which 2 ms to minimize.
[2024-05-24 05:25:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1424 ms
[2024-05-24 05:25:12] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 524 ms.
[2024-05-24 05:25:13] [INFO ] Added : 2 causal constraints over 1 iterations in 838 ms. Result :sat
[2024-05-24 05:25:13] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-24 05:25:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:14] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2024-05-24 05:25:14] [INFO ] [Real]Added 479 Read/Feed constraints in 125 ms returned sat
[2024-05-24 05:25:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-24 05:25:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:25:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:15] [INFO ] [Nat]Absence check using state equation in 948 ms returned sat
[2024-05-24 05:25:16] [INFO ] [Nat]Added 479 Read/Feed constraints in 232 ms returned sat
[2024-05-24 05:25:16] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 470 ms.
[2024-05-24 05:25:16] [INFO ] Added : 4 causal constraints over 1 iterations in 836 ms. Result :sat
[2024-05-24 05:25:17] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-24 05:25:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:25:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:18] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2024-05-24 05:25:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-24 05:25:18] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-24 05:25:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:19] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2024-05-24 05:25:19] [INFO ] [Nat]Added 479 Read/Feed constraints in 83 ms returned sat
[2024-05-24 05:25:20] [INFO ] Deduced a trap composed of 133 places in 718 ms of which 1 ms to minimize.
[2024-05-24 05:25:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 976 ms
[2024-05-24 05:25:20] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 492 ms.
[2024-05-24 05:25:21] [INFO ] Added : 2 causal constraints over 1 iterations in 818 ms. Result :sat
[2024-05-24 05:25:21] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-24 05:25:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:22] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2024-05-24 05:25:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-24 05:25:22] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:25:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:23] [INFO ] [Nat]Absence check using state equation in 825 ms returned sat
[2024-05-24 05:25:23] [INFO ] [Nat]Added 479 Read/Feed constraints in 255 ms returned sat
[2024-05-24 05:25:24] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 438 ms.
[2024-05-24 05:25:24] [INFO ] Added : 2 causal constraints over 1 iterations in 748 ms. Result :sat
[2024-05-24 05:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-24 05:25:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-24 05:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:25] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2024-05-24 05:25:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-24 05:25:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:26] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2024-05-24 05:25:26] [INFO ] [Nat]Added 479 Read/Feed constraints in 94 ms returned sat
[2024-05-24 05:25:27] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 441 ms.
[2024-05-24 05:25:28] [INFO ] Deduced a trap composed of 133 places in 1155 ms of which 2 ms to minimize.
[2024-05-24 05:25:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1378 ms
[2024-05-24 05:25:29] [INFO ] Added : 2 causal constraints over 1 iterations in 2225 ms. Result :sat
[2024-05-24 05:25:29] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-24 05:25:29] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:30] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2024-05-24 05:25:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-24 05:25:30] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:31] [INFO ] [Nat]Absence check using state equation in 835 ms returned sat
[2024-05-24 05:25:31] [INFO ] [Nat]Added 479 Read/Feed constraints in 103 ms returned sat
[2024-05-24 05:25:31] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 457 ms.
[2024-05-24 05:25:32] [INFO ] Added : 2 causal constraints over 1 iterations in 773 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, 4] Max seen :[1, 1, 1, 1, 0, 0, 0, 0]
Support contains 8 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1423 are kept as prefixes of interest. Removing 205 places using SCC suffix rule.16 ms
Discarding 205 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1423 transition count 5583
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 680 place count 1123 transition count 3301
Iterating global reduction 1 with 300 rules applied. Total rules applied 980 place count 1123 transition count 3301
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 1342 place count 1123 transition count 2939
Discarding 155 places :
Symmetric choice reduction at 2 with 155 rule applications. Total rules 1497 place count 968 transition count 2629
Iterating global reduction 2 with 155 rules applied. Total rules applied 1652 place count 968 transition count 2629
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1720 place count 968 transition count 2561
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1733 place count 955 transition count 2535
Iterating global reduction 3 with 13 rules applied. Total rules applied 1746 place count 955 transition count 2535
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1759 place count 942 transition count 2509
Iterating global reduction 3 with 13 rules applied. Total rules applied 1772 place count 942 transition count 2509
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1785 place count 929 transition count 2483
Iterating global reduction 3 with 13 rules applied. Total rules applied 1798 place count 929 transition count 2483
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1811 place count 916 transition count 2457
Iterating global reduction 3 with 13 rules applied. Total rules applied 1824 place count 916 transition count 2457
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1837 place count 903 transition count 2431
Iterating global reduction 3 with 13 rules applied. Total rules applied 1850 place count 903 transition count 2431
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1863 place count 890 transition count 2405
Iterating global reduction 3 with 13 rules applied. Total rules applied 1876 place count 890 transition count 2405
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1889 place count 877 transition count 2379
Iterating global reduction 3 with 13 rules applied. Total rules applied 1902 place count 877 transition count 2379
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1954 place count 825 transition count 2185
Iterating global reduction 3 with 52 rules applied. Total rules applied 2006 place count 825 transition count 2185
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2063 place count 768 transition count 1957
Iterating global reduction 3 with 57 rules applied. Total rules applied 2120 place count 768 transition count 1957
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2177 place count 711 transition count 1815
Iterating global reduction 3 with 57 rules applied. Total rules applied 2234 place count 711 transition count 1815
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2291 place count 654 transition count 1701
Iterating global reduction 3 with 57 rules applied. Total rules applied 2348 place count 654 transition count 1701
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2405 place count 597 transition count 1587
Iterating global reduction 3 with 57 rules applied. Total rules applied 2462 place count 597 transition count 1587
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2519 place count 540 transition count 1473
Iterating global reduction 3 with 57 rules applied. Total rules applied 2576 place count 540 transition count 1473
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2633 place count 483 transition count 1359
Iterating global reduction 3 with 57 rules applied. Total rules applied 2690 place count 483 transition count 1359
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 2704 place count 469 transition count 1331
Iterating global reduction 3 with 14 rules applied. Total rules applied 2718 place count 469 transition count 1331
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 2732 place count 469 transition count 1317
Applied a total of 2732 rules in 1212 ms. Remains 469 /1628 variables (removed 1159) and now considering 1317/5962 (removed 4645) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1213 ms. Remains : 469/1628 places, 1317/5962 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:25:33] [INFO ] Computed 3 invariants in 8 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2366 ms. (steps per millisecond=422 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 8) seen :291
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=1655 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 8) seen :192
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 8) seen :276
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 8) seen :196
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=1715 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 598 ms. (steps per millisecond=1672 ) properties (out of 8) seen :133
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 8) seen :194
[2024-05-24 05:25:40] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:25:40] [INFO ] Computed 3 invariants in 11 ms
[2024-05-24 05:25:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:41] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-24 05:25:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:25:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:41] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-24 05:25:41] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:25:41] [INFO ] [Nat]Added 95 Read/Feed constraints in 82 ms returned sat
[2024-05-24 05:25:41] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 1 ms to minimize.
[2024-05-24 05:25:41] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 0 ms to minimize.
[2024-05-24 05:25:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 499 ms
[2024-05-24 05:25:42] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-24 05:25:42] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 49 ms.
[2024-05-24 05:25:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:42] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-24 05:25:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:42] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-24 05:25:42] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:25:43] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:25:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-24 05:25:43] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 86 ms.
[2024-05-24 05:25:43] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 44 ms.
[2024-05-24 05:25:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:43] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-24 05:25:43] [INFO ] [Real]Added 95 Read/Feed constraints in 24 ms returned sat
[2024-05-24 05:25:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:43] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-24 05:25:43] [INFO ] [Nat]Added 95 Read/Feed constraints in 77 ms returned sat
[2024-05-24 05:25:44] [INFO ] Deduced a trap composed of 100 places in 224 ms of which 1 ms to minimize.
[2024-05-24 05:25:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2024-05-24 05:25:44] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:25:44] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:25:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:44] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-24 05:25:44] [INFO ] [Real]Added 95 Read/Feed constraints in 58 ms returned sat
[2024-05-24 05:25:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:45] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-24 05:25:45] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:25:45] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 81 ms.
[2024-05-24 05:25:45] [INFO ] Added : 4 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 44 ms.
[2024-05-24 05:25:45] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:45] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-24 05:25:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:25:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:45] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-24 05:25:45] [INFO ] [Nat]Added 95 Read/Feed constraints in 45 ms returned sat
[2024-05-24 05:25:46] [INFO ] Deduced a trap composed of 100 places in 220 ms of which 1 ms to minimize.
[2024-05-24 05:25:46] [INFO ] Deduced a trap composed of 99 places in 199 ms of which 1 ms to minimize.
[2024-05-24 05:25:46] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 1 ms to minimize.
[2024-05-24 05:25:46] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 0 ms to minimize.
[2024-05-24 05:25:47] [INFO ] Deduced a trap composed of 82 places in 201 ms of which 0 ms to minimize.
[2024-05-24 05:25:47] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 1 ms to minimize.
[2024-05-24 05:25:47] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 0 ms to minimize.
[2024-05-24 05:25:47] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 1 ms to minimize.
[2024-05-24 05:25:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1826 ms
[2024-05-24 05:25:47] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 84 ms.
[2024-05-24 05:25:47] [INFO ] Added : 2 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 88 ms.
[2024-05-24 05:25:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:48] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 05:25:48] [INFO ] [Real]Added 95 Read/Feed constraints in 28 ms returned sat
[2024-05-24 05:25:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:48] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-24 05:25:48] [INFO ] [Nat]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-24 05:25:48] [INFO ] Deduced a trap composed of 100 places in 226 ms of which 0 ms to minimize.
[2024-05-24 05:25:49] [INFO ] Deduced a trap composed of 99 places in 209 ms of which 1 ms to minimize.
[2024-05-24 05:25:49] [INFO ] Deduced a trap composed of 97 places in 219 ms of which 0 ms to minimize.
[2024-05-24 05:25:49] [INFO ] Deduced a trap composed of 85 places in 209 ms of which 1 ms to minimize.
[2024-05-24 05:25:49] [INFO ] Deduced a trap composed of 83 places in 218 ms of which 1 ms to minimize.
[2024-05-24 05:25:49] [INFO ] Deduced a trap composed of 78 places in 211 ms of which 1 ms to minimize.
[2024-05-24 05:25:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1467 ms
[2024-05-24 05:25:50] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-24 05:25:50] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 62 ms.
[2024-05-24 05:25:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:50] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-24 05:25:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:25:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:50] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-24 05:25:50] [INFO ] [Nat]Added 95 Read/Feed constraints in 20 ms returned sat
[2024-05-24 05:25:50] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-24 05:25:50] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 45 ms.
[2024-05-24 05:25:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:51] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:25:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:25:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:25:51] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:25:51] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:25:51] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 77 ms.
[2024-05-24 05:25:51] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, 4] Max seen :[3, 1, 5, 291, 1, 6, 0, 1]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 59 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 50 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:25:54] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:25:54] [INFO ] Invariant cache hit.
[2024-05-24 05:25:54] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-24 05:25:54] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:25:54] [INFO ] Invariant cache hit.
[2024-05-24 05:25:54] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:25:55] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1604 ms to find 0 implicit places.
[2024-05-24 05:25:55] [INFO ] Redundant transitions in 89 ms returned []
[2024-05-24 05:25:55] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:25:55] [INFO ] Invariant cache hit.
[2024-05-24 05:25:56] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2214 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:25:56] [INFO ] Computed 3 invariants in 4 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 2336 ms. (steps per millisecond=428 ) properties (out of 8) seen :7096
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 8) seen :172
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 8) seen :194
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 8) seen :362
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 8) seen :202
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 8) seen :250
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 8) seen :255
[2024-05-24 05:26:03] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:26:03] [INFO ] Computed 3 invariants in 9 ms
[2024-05-24 05:26:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:03] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-24 05:26:03] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:26:03] [INFO ] [Real]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-24 05:26:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:03] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-24 05:26:04] [INFO ] [Nat]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:26:04] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 0 ms to minimize.
[2024-05-24 05:26:04] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 0 ms to minimize.
[2024-05-24 05:26:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 502 ms
[2024-05-24 05:26:04] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-24 05:26:04] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 59 ms.
[2024-05-24 05:26:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:05] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-24 05:26:05] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:26:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:05] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:26:05] [INFO ] [Nat]Added 95 Read/Feed constraints in 81 ms returned sat
[2024-05-24 05:26:05] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:26:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-05-24 05:26:05] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 77 ms.
[2024-05-24 05:26:05] [INFO ] Added : 2 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 48 ms.
[2024-05-24 05:26:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:06] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-24 05:26:06] [INFO ] [Real]Added 95 Read/Feed constraints in 23 ms returned sat
[2024-05-24 05:26:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:06] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-24 05:26:06] [INFO ] [Nat]Added 95 Read/Feed constraints in 77 ms returned sat
[2024-05-24 05:26:06] [INFO ] Deduced a trap composed of 100 places in 208 ms of which 0 ms to minimize.
[2024-05-24 05:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-24 05:26:06] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 80 ms.
[2024-05-24 05:26:06] [INFO ] Added : 2 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 41 ms.
[2024-05-24 05:26:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:07] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-24 05:26:07] [INFO ] [Real]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:26:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:07] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:26:07] [INFO ] [Nat]Added 95 Read/Feed constraints in 20 ms returned sat
[2024-05-24 05:26:07] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-24 05:26:07] [INFO ] Added : 4 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:26:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:08] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:26:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:08] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:26:08] [INFO ] [Nat]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:26:08] [INFO ] Deduced a trap composed of 100 places in 240 ms of which 1 ms to minimize.
[2024-05-24 05:26:08] [INFO ] Deduced a trap composed of 99 places in 209 ms of which 0 ms to minimize.
[2024-05-24 05:26:09] [INFO ] Deduced a trap composed of 85 places in 208 ms of which 0 ms to minimize.
[2024-05-24 05:26:09] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 0 ms to minimize.
[2024-05-24 05:26:09] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 1 ms to minimize.
[2024-05-24 05:26:09] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 0 ms to minimize.
[2024-05-24 05:26:10] [INFO ] Deduced a trap composed of 82 places in 211 ms of which 2 ms to minimize.
[2024-05-24 05:26:10] [INFO ] Deduced a trap composed of 78 places in 226 ms of which 4 ms to minimize.
[2024-05-24 05:26:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1925 ms
[2024-05-24 05:26:10] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-24 05:26:10] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 112 ms.
[2024-05-24 05:26:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:10] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-24 05:26:10] [INFO ] [Real]Added 95 Read/Feed constraints in 30 ms returned sat
[2024-05-24 05:26:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:11] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:26:11] [INFO ] [Nat]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-24 05:26:11] [INFO ] Deduced a trap composed of 100 places in 223 ms of which 1 ms to minimize.
[2024-05-24 05:26:11] [INFO ] Deduced a trap composed of 99 places in 213 ms of which 0 ms to minimize.
[2024-05-24 05:26:11] [INFO ] Deduced a trap composed of 97 places in 200 ms of which 1 ms to minimize.
[2024-05-24 05:26:12] [INFO ] Deduced a trap composed of 85 places in 203 ms of which 1 ms to minimize.
[2024-05-24 05:26:12] [INFO ] Deduced a trap composed of 83 places in 203 ms of which 0 ms to minimize.
[2024-05-24 05:26:12] [INFO ] Deduced a trap composed of 78 places in 216 ms of which 1 ms to minimize.
[2024-05-24 05:26:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1453 ms
[2024-05-24 05:26:12] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 73 ms.
[2024-05-24 05:26:12] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 55 ms.
[2024-05-24 05:26:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:13] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-24 05:26:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:13] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-24 05:26:13] [INFO ] [Nat]Added 95 Read/Feed constraints in 77 ms returned sat
[2024-05-24 05:26:13] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 1 ms to minimize.
[2024-05-24 05:26:13] [INFO ] Deduced a trap composed of 85 places in 208 ms of which 1 ms to minimize.
[2024-05-24 05:26:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 513 ms
[2024-05-24 05:26:14] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:26:14] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 48 ms.
[2024-05-24 05:26:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:14] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-24 05:26:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:14] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-24 05:26:14] [INFO ] [Nat]Added 95 Read/Feed constraints in 20 ms returned sat
[2024-05-24 05:26:14] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-24 05:26:14] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, 4] Max seen :[6, 4, 5, 7096, 2, 10, 3, 1]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 51 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 49 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:26:45] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:26:45] [INFO ] Invariant cache hit.
[2024-05-24 05:26:45] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-05-24 05:26:45] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:26:45] [INFO ] Invariant cache hit.
[2024-05-24 05:26:46] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:26:47] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1773 ms to find 0 implicit places.
[2024-05-24 05:26:47] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:26:47] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:26:47] [INFO ] Invariant cache hit.
[2024-05-24 05:26:47] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2355 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:26:47] [INFO ] Computed 3 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2413 ms. (steps per millisecond=414 ) properties (out of 8) seen :7218
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 8) seen :206
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 8) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 8) seen :13
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 8) seen :364
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 8) seen :257
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 8) seen :199
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 8) seen :170
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=1785 ) properties (out of 8) seen :3
[2024-05-24 05:26:54] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:26:54] [INFO ] Computed 3 invariants in 8 ms
[2024-05-24 05:26:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:54] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-24 05:26:54] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:26:54] [INFO ] [Real]Added 95 Read/Feed constraints in 28 ms returned sat
[2024-05-24 05:26:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:55] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:26:55] [INFO ] [Nat]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:26:55] [INFO ] Deduced a trap composed of 75 places in 223 ms of which 0 ms to minimize.
[2024-05-24 05:26:55] [INFO ] Deduced a trap composed of 85 places in 227 ms of which 0 ms to minimize.
[2024-05-24 05:26:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 518 ms
[2024-05-24 05:26:55] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 83 ms.
[2024-05-24 05:26:55] [INFO ] Added : 2 causal constraints over 1 iterations in 186 ms. Result :sat
Minimization took 57 ms.
[2024-05-24 05:26:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:56] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:26:56] [INFO ] [Real]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-24 05:26:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:56] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-24 05:26:56] [INFO ] [Nat]Added 95 Read/Feed constraints in 81 ms returned sat
[2024-05-24 05:26:56] [INFO ] Deduced a trap composed of 75 places in 230 ms of which 0 ms to minimize.
[2024-05-24 05:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-05-24 05:26:56] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-24 05:26:57] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 48 ms.
[2024-05-24 05:26:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:57] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:26:57] [INFO ] [Real]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-24 05:26:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:57] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:26:57] [INFO ] [Nat]Added 95 Read/Feed constraints in 78 ms returned sat
[2024-05-24 05:26:58] [INFO ] Deduced a trap composed of 100 places in 232 ms of which 1 ms to minimize.
[2024-05-24 05:26:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-05-24 05:26:58] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-24 05:26:58] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:26:58] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-24 05:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:58] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2024-05-24 05:26:58] [INFO ] [Real]Added 95 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:26:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:58] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-24 05:26:59] [INFO ] [Nat]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-24 05:26:59] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-24 05:26:59] [INFO ] Added : 4 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 43 ms.
[2024-05-24 05:26:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:59] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2024-05-24 05:26:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:26:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:26:59] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-24 05:26:59] [INFO ] [Nat]Added 95 Read/Feed constraints in 68 ms returned sat
[2024-05-24 05:27:00] [INFO ] Deduced a trap composed of 100 places in 214 ms of which 1 ms to minimize.
[2024-05-24 05:27:00] [INFO ] Deduced a trap composed of 99 places in 234 ms of which 0 ms to minimize.
[2024-05-24 05:27:00] [INFO ] Deduced a trap composed of 85 places in 232 ms of which 0 ms to minimize.
[2024-05-24 05:27:00] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 1 ms to minimize.
[2024-05-24 05:27:01] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 1 ms to minimize.
[2024-05-24 05:27:01] [INFO ] Deduced a trap composed of 82 places in 229 ms of which 0 ms to minimize.
[2024-05-24 05:27:01] [INFO ] Deduced a trap composed of 135 places in 203 ms of which 1 ms to minimize.
[2024-05-24 05:27:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1749 ms
[2024-05-24 05:27:01] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 67 ms.
[2024-05-24 05:27:01] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 99 ms.
[2024-05-24 05:27:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:02] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:27:02] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-24 05:27:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:02] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:27:02] [INFO ] [Nat]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-24 05:27:02] [INFO ] Deduced a trap composed of 100 places in 240 ms of which 0 ms to minimize.
[2024-05-24 05:27:02] [INFO ] Deduced a trap composed of 99 places in 227 ms of which 1 ms to minimize.
[2024-05-24 05:27:03] [INFO ] Deduced a trap composed of 97 places in 220 ms of which 9 ms to minimize.
[2024-05-24 05:27:03] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 0 ms to minimize.
[2024-05-24 05:27:03] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 1 ms to minimize.
[2024-05-24 05:27:03] [INFO ] Deduced a trap composed of 78 places in 223 ms of which 1 ms to minimize.
[2024-05-24 05:27:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1531 ms
[2024-05-24 05:27:04] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:27:04] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 60 ms.
[2024-05-24 05:27:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:04] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:27:04] [INFO ] [Real]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-24 05:27:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:04] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:27:04] [INFO ] [Nat]Added 95 Read/Feed constraints in 67 ms returned sat
[2024-05-24 05:27:05] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 1 ms to minimize.
[2024-05-24 05:27:05] [INFO ] Deduced a trap composed of 85 places in 227 ms of which 1 ms to minimize.
[2024-05-24 05:27:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 539 ms
[2024-05-24 05:27:05] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 115 ms.
[2024-05-24 05:27:05] [INFO ] Added : 2 causal constraints over 1 iterations in 207 ms. Result :sat
Minimization took 66 ms.
[2024-05-24 05:27:05] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-24 05:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:06] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:27:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:06] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-24 05:27:06] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:27:06] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 91 ms.
[2024-05-24 05:27:06] [INFO ] Added : 2 causal constraints over 1 iterations in 180 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, 4] Max seen :[6, 4, 5, 62367, 3, 10, 6, 1]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 52 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 47 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:27:36] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:27:36] [INFO ] Invariant cache hit.
[2024-05-24 05:27:37] [INFO ] Implicit Places using invariants in 685 ms returned []
[2024-05-24 05:27:37] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:27:37] [INFO ] Invariant cache hit.
[2024-05-24 05:27:37] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:27:38] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
[2024-05-24 05:27:38] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 05:27:38] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:27:38] [INFO ] Invariant cache hit.
[2024-05-24 05:27:38] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2218 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:27:39] [INFO ] Computed 3 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2245 ms. (steps per millisecond=445 ) properties (out of 8) seen :7083
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=1754 ) properties (out of 8) seen :247
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 8) seen :446
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 8) seen :199
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 8) seen :188
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 8) seen :462
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 8) seen :3
[2024-05-24 05:27:45] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:27:45] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 05:27:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:45] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:27:45] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:27:45] [INFO ] [Real]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-24 05:27:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:46] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-24 05:27:46] [INFO ] [Nat]Added 95 Read/Feed constraints in 58 ms returned sat
[2024-05-24 05:27:46] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 1 ms to minimize.
[2024-05-24 05:27:46] [INFO ] Deduced a trap composed of 85 places in 219 ms of which 1 ms to minimize.
[2024-05-24 05:27:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2024-05-24 05:27:46] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 86 ms.
[2024-05-24 05:27:46] [INFO ] Added : 2 causal constraints over 1 iterations in 190 ms. Result :sat
Minimization took 54 ms.
[2024-05-24 05:27:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:47] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:27:47] [INFO ] [Real]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:27:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:47] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-24 05:27:47] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:27:47] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 3 ms to minimize.
[2024-05-24 05:27:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2024-05-24 05:27:48] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:27:48] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 43 ms.
[2024-05-24 05:27:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:48] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-24 05:27:48] [INFO ] [Real]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:27:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:48] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-24 05:27:48] [INFO ] [Nat]Added 95 Read/Feed constraints in 73 ms returned sat
[2024-05-24 05:27:49] [INFO ] Deduced a trap composed of 100 places in 212 ms of which 1 ms to minimize.
[2024-05-24 05:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-24 05:27:49] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:27:49] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 45 ms.
[2024-05-24 05:27:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:49] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-24 05:27:49] [INFO ] [Real]Added 95 Read/Feed constraints in 56 ms returned sat
[2024-05-24 05:27:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:49] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:27:49] [INFO ] [Nat]Added 95 Read/Feed constraints in 19 ms returned sat
[2024-05-24 05:27:49] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:27:50] [INFO ] Added : 4 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 44 ms.
[2024-05-24 05:27:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:50] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:27:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-24 05:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:50] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-24 05:27:50] [INFO ] [Nat]Added 95 Read/Feed constraints in 64 ms returned sat
[2024-05-24 05:27:50] [INFO ] Deduced a trap composed of 100 places in 200 ms of which 2 ms to minimize.
[2024-05-24 05:27:51] [INFO ] Deduced a trap composed of 99 places in 203 ms of which 11 ms to minimize.
[2024-05-24 05:27:51] [INFO ] Deduced a trap composed of 85 places in 215 ms of which 3 ms to minimize.
[2024-05-24 05:27:51] [INFO ] Deduced a trap composed of 78 places in 217 ms of which 1 ms to minimize.
[2024-05-24 05:27:51] [INFO ] Deduced a trap composed of 76 places in 210 ms of which 1 ms to minimize.
[2024-05-24 05:27:52] [INFO ] Deduced a trap composed of 82 places in 216 ms of which 0 ms to minimize.
[2024-05-24 05:27:52] [INFO ] Deduced a trap composed of 135 places in 195 ms of which 0 ms to minimize.
[2024-05-24 05:27:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1646 ms
[2024-05-24 05:27:52] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:27:52] [INFO ] Added : 2 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 90 ms.
[2024-05-24 05:27:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:52] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-24 05:27:52] [INFO ] [Real]Added 95 Read/Feed constraints in 30 ms returned sat
[2024-05-24 05:27:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-24 05:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:53] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-24 05:27:53] [INFO ] [Nat]Added 95 Read/Feed constraints in 24 ms returned sat
[2024-05-24 05:27:53] [INFO ] Deduced a trap composed of 100 places in 207 ms of which 0 ms to minimize.
[2024-05-24 05:27:53] [INFO ] Deduced a trap composed of 99 places in 201 ms of which 0 ms to minimize.
[2024-05-24 05:27:53] [INFO ] Deduced a trap composed of 97 places in 199 ms of which 1 ms to minimize.
[2024-05-24 05:27:54] [INFO ] Deduced a trap composed of 85 places in 197 ms of which 1 ms to minimize.
[2024-05-24 05:27:54] [INFO ] Deduced a trap composed of 83 places in 201 ms of which 1 ms to minimize.
[2024-05-24 05:27:54] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 1 ms to minimize.
[2024-05-24 05:27:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1393 ms
[2024-05-24 05:27:54] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 85 ms.
[2024-05-24 05:27:54] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 05:27:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:55] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:27:55] [INFO ] [Real]Added 95 Read/Feed constraints in 78 ms returned sat
[2024-05-24 05:27:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:55] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:27:55] [INFO ] [Nat]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:27:55] [INFO ] Deduced a trap composed of 75 places in 227 ms of which 0 ms to minimize.
[2024-05-24 05:27:55] [INFO ] Deduced a trap composed of 85 places in 205 ms of which 0 ms to minimize.
[2024-05-24 05:27:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 519 ms
[2024-05-24 05:27:56] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:27:56] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 72 ms.
[2024-05-24 05:27:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:56] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-24 05:27:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:27:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:27:56] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:27:56] [INFO ] [Nat]Added 95 Read/Feed constraints in 20 ms returned sat
[2024-05-24 05:27:56] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-24 05:27:56] [INFO ] Added : 2 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, 4] Max seen :[6, 446, 5, 62367, 3, 10, 457, 1]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 46 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 46 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:28:30] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:28:30] [INFO ] Invariant cache hit.
[2024-05-24 05:28:30] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-24 05:28:30] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:28:30] [INFO ] Invariant cache hit.
[2024-05-24 05:28:31] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:28:31] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
[2024-05-24 05:28:31] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 05:28:31] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:28:31] [INFO ] Invariant cache hit.
[2024-05-24 05:28:32] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1826 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:28:32] [INFO ] Computed 3 invariants in 6 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2433 ms. (steps per millisecond=411 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 8) seen :204
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 8) seen :339
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 8) seen :563
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 8) seen :155
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 8) seen :186
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 8) seen :182
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 8) seen :194
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 8) seen :356
[2024-05-24 05:28:39] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:28:39] [INFO ] Computed 3 invariants in 5 ms
[2024-05-24 05:28:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:39] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:28:39] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:28:39] [INFO ] [Real]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-24 05:28:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:28:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:40] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-24 05:28:40] [INFO ] [Nat]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:28:40] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 0 ms to minimize.
[2024-05-24 05:28:40] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 1 ms to minimize.
[2024-05-24 05:28:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 499 ms
[2024-05-24 05:28:40] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:28:40] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 60 ms.
[2024-05-24 05:28:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:41] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-24 05:28:41] [INFO ] [Real]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:28:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:28:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:41] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:28:41] [INFO ] [Nat]Added 95 Read/Feed constraints in 57 ms returned sat
[2024-05-24 05:28:41] [INFO ] Deduced a trap composed of 75 places in 201 ms of which 1 ms to minimize.
[2024-05-24 05:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-05-24 05:28:41] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-24 05:28:42] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 44 ms.
[2024-05-24 05:28:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:42] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 05:28:42] [INFO ] [Real]Added 95 Read/Feed constraints in 70 ms returned sat
[2024-05-24 05:28:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:28:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:42] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-24 05:28:42] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:28:42] [INFO ] Deduced a trap composed of 100 places in 214 ms of which 1 ms to minimize.
[2024-05-24 05:28:43] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 1 ms to minimize.
[2024-05-24 05:28:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2024-05-24 05:28:43] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 79 ms.
[2024-05-24 05:28:43] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 46 ms.
[2024-05-24 05:28:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:43] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:28:43] [INFO ] [Real]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:28:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:28:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:44] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-24 05:28:44] [INFO ] [Nat]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:28:44] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-24 05:28:44] [INFO ] Added : 4 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 46 ms.
[2024-05-24 05:28:44] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-24 05:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:44] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:28:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:44] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-24 05:28:44] [INFO ] [Nat]Added 95 Read/Feed constraints in 75 ms returned sat
[2024-05-24 05:28:45] [INFO ] Deduced a trap composed of 100 places in 217 ms of which 1 ms to minimize.
[2024-05-24 05:28:45] [INFO ] Deduced a trap composed of 99 places in 206 ms of which 0 ms to minimize.
[2024-05-24 05:28:45] [INFO ] Deduced a trap composed of 85 places in 204 ms of which 1 ms to minimize.
[2024-05-24 05:28:45] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 0 ms to minimize.
[2024-05-24 05:28:46] [INFO ] Deduced a trap composed of 76 places in 207 ms of which 1 ms to minimize.
[2024-05-24 05:28:46] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 1 ms to minimize.
[2024-05-24 05:28:46] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 0 ms to minimize.
[2024-05-24 05:28:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1620 ms
[2024-05-24 05:28:46] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:28:46] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 90 ms.
[2024-05-24 05:28:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:47] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2024-05-24 05:28:47] [INFO ] [Real]Added 95 Read/Feed constraints in 30 ms returned sat
[2024-05-24 05:28:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:28:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:47] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:28:47] [INFO ] [Nat]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-24 05:28:47] [INFO ] Deduced a trap composed of 100 places in 221 ms of which 0 ms to minimize.
[2024-05-24 05:28:47] [INFO ] Deduced a trap composed of 99 places in 209 ms of which 1 ms to minimize.
[2024-05-24 05:28:48] [INFO ] Deduced a trap composed of 97 places in 202 ms of which 0 ms to minimize.
[2024-05-24 05:28:48] [INFO ] Deduced a trap composed of 85 places in 196 ms of which 0 ms to minimize.
[2024-05-24 05:28:48] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 1 ms to minimize.
[2024-05-24 05:28:48] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 1 ms to minimize.
[2024-05-24 05:28:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1409 ms
[2024-05-24 05:28:48] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:28:48] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 05:28:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:49] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-24 05:28:49] [INFO ] [Real]Added 95 Read/Feed constraints in 74 ms returned sat
[2024-05-24 05:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:28:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:49] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-24 05:28:49] [INFO ] [Nat]Added 95 Read/Feed constraints in 65 ms returned sat
[2024-05-24 05:28:49] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 1 ms to minimize.
[2024-05-24 05:28:50] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 1 ms to minimize.
[2024-05-24 05:28:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2024-05-24 05:28:50] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-24 05:28:50] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 71 ms.
[2024-05-24 05:28:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:50] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-24 05:28:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:28:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:28:50] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-24 05:28:50] [INFO ] [Nat]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:28:51] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:28:51] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, 4] Max seen :[6, 446, 381, 63641, 3, 10, 457, 1]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 48 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 47 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:29:26] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:29:26] [INFO ] Invariant cache hit.
[2024-05-24 05:29:26] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-24 05:29:26] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:29:26] [INFO ] Invariant cache hit.
[2024-05-24 05:29:26] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:29:27] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
[2024-05-24 05:29:27] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 05:29:27] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:29:27] [INFO ] Invariant cache hit.
[2024-05-24 05:29:27] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1884 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:29:27] [INFO ] Computed 3 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2330 ms. (steps per millisecond=429 ) properties (out of 8) seen :3670
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 8) seen :177
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=1692 ) properties (out of 8) seen :322
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 8) seen :166
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 8) seen :138
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 8) seen :166
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=1766 ) properties (out of 8) seen :8
[2024-05-24 05:29:34] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:29:34] [INFO ] Computed 3 invariants in 10 ms
[2024-05-24 05:29:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:35] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-24 05:29:35] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:29:35] [INFO ] [Real]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-24 05:29:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:29:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:35] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-24 05:29:35] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:29:35] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:29:35] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 0 ms to minimize.
[2024-05-24 05:29:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 505 ms
[2024-05-24 05:29:35] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-24 05:29:36] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 61 ms.
[2024-05-24 05:29:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:36] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-24 05:29:36] [INFO ] [Real]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:29:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:29:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:36] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:29:36] [INFO ] [Nat]Added 95 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:29:37] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 1 ms to minimize.
[2024-05-24 05:29:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-05-24 05:29:37] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 96 ms.
[2024-05-24 05:29:37] [INFO ] Added : 2 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 48 ms.
[2024-05-24 05:29:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:37] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 05:29:37] [INFO ] [Real]Added 95 Read/Feed constraints in 70 ms returned sat
[2024-05-24 05:29:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:29:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:29:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:37] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:29:37] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:29:38] [INFO ] Deduced a trap composed of 100 places in 205 ms of which 0 ms to minimize.
[2024-05-24 05:29:38] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 1 ms to minimize.
[2024-05-24 05:29:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2024-05-24 05:29:38] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 77 ms.
[2024-05-24 05:29:38] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:29:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:38] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-24 05:29:38] [INFO ] [Real]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:29:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:29:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:39] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:29:39] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:29:39] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:29:39] [INFO ] Added : 4 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:29:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:39] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-24 05:29:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:29:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:39] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-24 05:29:40] [INFO ] [Nat]Added 95 Read/Feed constraints in 65 ms returned sat
[2024-05-24 05:29:40] [INFO ] Deduced a trap composed of 100 places in 220 ms of which 1 ms to minimize.
[2024-05-24 05:29:40] [INFO ] Deduced a trap composed of 99 places in 190 ms of which 1 ms to minimize.
[2024-05-24 05:29:40] [INFO ] Deduced a trap composed of 85 places in 189 ms of which 1 ms to minimize.
[2024-05-24 05:29:40] [INFO ] Deduced a trap composed of 78 places in 187 ms of which 0 ms to minimize.
[2024-05-24 05:29:41] [INFO ] Deduced a trap composed of 76 places in 201 ms of which 1 ms to minimize.
[2024-05-24 05:29:41] [INFO ] Deduced a trap composed of 82 places in 201 ms of which 1 ms to minimize.
[2024-05-24 05:29:41] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 0 ms to minimize.
[2024-05-24 05:29:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1548 ms
[2024-05-24 05:29:41] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 75 ms.
[2024-05-24 05:29:41] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 92 ms.
[2024-05-24 05:29:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:42] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-24 05:29:42] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-24 05:29:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:29:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:29:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:42] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-24 05:29:42] [INFO ] [Nat]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-24 05:29:42] [INFO ] Deduced a trap composed of 100 places in 209 ms of which 0 ms to minimize.
[2024-05-24 05:29:42] [INFO ] Deduced a trap composed of 99 places in 217 ms of which 0 ms to minimize.
[2024-05-24 05:29:43] [INFO ] Deduced a trap composed of 97 places in 210 ms of which 1 ms to minimize.
[2024-05-24 05:29:43] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:29:43] [INFO ] Deduced a trap composed of 83 places in 217 ms of which 0 ms to minimize.
[2024-05-24 05:29:43] [INFO ] Deduced a trap composed of 79 places in 212 ms of which 1 ms to minimize.
[2024-05-24 05:29:44] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 0 ms to minimize.
[2024-05-24 05:29:44] [INFO ] Deduced a trap composed of 75 places in 209 ms of which 1 ms to minimize.
[2024-05-24 05:29:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1921 ms
[2024-05-24 05:29:44] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 77 ms.
[2024-05-24 05:29:44] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 05:29:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:44] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2024-05-24 05:29:44] [INFO ] [Real]Added 95 Read/Feed constraints in 74 ms returned sat
[2024-05-24 05:29:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:29:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:29:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:45] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:29:45] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:29:45] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 0 ms to minimize.
[2024-05-24 05:29:45] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:29:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 510 ms
[2024-05-24 05:29:45] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 84 ms.
[2024-05-24 05:29:45] [INFO ] Added : 2 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 68 ms.
[2024-05-24 05:29:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:46] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-24 05:29:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:29:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:29:46] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-24 05:29:46] [INFO ] [Nat]Added 95 Read/Feed constraints in 20 ms returned sat
[2024-05-24 05:29:46] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 80 ms.
[2024-05-24 05:29:46] [INFO ] Added : 2 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, 4] Max seen :[6, 446, 381, 63641, 3, 13, 457, 1]
Support contains 8 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 49 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 45 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:30:21] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:30:21] [INFO ] Invariant cache hit.
[2024-05-24 05:30:22] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-24 05:30:22] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:30:22] [INFO ] Invariant cache hit.
[2024-05-24 05:30:22] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:30:23] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1342 ms to find 0 implicit places.
[2024-05-24 05:30:23] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 05:30:23] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:30:23] [INFO ] Invariant cache hit.
[2024-05-24 05:30:23] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1902 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:30:23] [INFO ] Computed 3 invariants in 4 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2213 ms. (steps per millisecond=451 ) properties (out of 8) seen :20
FORMULA FunctionPointer-PT-c004-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 7) seen :183
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 7) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 7) seen :1015
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 576 ms. (steps per millisecond=1736 ) properties (out of 7) seen :194
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 7) seen :165
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 7) seen :138
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties (out of 7) seen :271
[2024-05-24 05:30:29] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:30:29] [INFO ] Computed 3 invariants in 10 ms
[2024-05-24 05:30:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:30] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-24 05:30:30] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:30:30] [INFO ] [Real]Added 95 Read/Feed constraints in 33 ms returned sat
[2024-05-24 05:30:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:30:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:30] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:30:30] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:30:30] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 1 ms to minimize.
[2024-05-24 05:30:31] [INFO ] Deduced a trap composed of 85 places in 220 ms of which 0 ms to minimize.
[2024-05-24 05:30:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2024-05-24 05:30:31] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 67 ms.
[2024-05-24 05:30:31] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 60 ms.
[2024-05-24 05:30:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:31] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-24 05:30:31] [INFO ] [Real]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:30:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:30:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:31] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-24 05:30:31] [INFO ] [Nat]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:30:32] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 0 ms to minimize.
[2024-05-24 05:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-24 05:30:32] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-24 05:30:32] [INFO ] Added : 2 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 46 ms.
[2024-05-24 05:30:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:32] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-24 05:30:32] [INFO ] [Real]Added 95 Read/Feed constraints in 69 ms returned sat
[2024-05-24 05:30:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:30:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:33] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-24 05:30:33] [INFO ] [Nat]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:30:33] [INFO ] Deduced a trap composed of 100 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:30:33] [INFO ] Deduced a trap composed of 82 places in 217 ms of which 0 ms to minimize.
[2024-05-24 05:30:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2024-05-24 05:30:33] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:30:33] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 46 ms.
[2024-05-24 05:30:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:34] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:30:34] [INFO ] [Real]Added 95 Read/Feed constraints in 58 ms returned sat
[2024-05-24 05:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:30:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:34] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:30:34] [INFO ] [Nat]Added 95 Read/Feed constraints in 20 ms returned sat
[2024-05-24 05:30:34] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-24 05:30:34] [INFO ] Added : 4 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:30:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:34] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-24 05:30:34] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:30:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:35] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-24 05:30:35] [INFO ] [Nat]Added 95 Read/Feed constraints in 64 ms returned sat
[2024-05-24 05:30:35] [INFO ] Deduced a trap composed of 100 places in 213 ms of which 1 ms to minimize.
[2024-05-24 05:30:35] [INFO ] Deduced a trap composed of 99 places in 234 ms of which 0 ms to minimize.
[2024-05-24 05:30:35] [INFO ] Deduced a trap composed of 85 places in 213 ms of which 0 ms to minimize.
[2024-05-24 05:30:36] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 1 ms to minimize.
[2024-05-24 05:30:36] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 1 ms to minimize.
[2024-05-24 05:30:36] [INFO ] Deduced a trap composed of 82 places in 224 ms of which 1 ms to minimize.
[2024-05-24 05:30:36] [INFO ] Deduced a trap composed of 139 places in 196 ms of which 1 ms to minimize.
[2024-05-24 05:30:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1706 ms
[2024-05-24 05:30:37] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 81 ms.
[2024-05-24 05:30:37] [INFO ] Added : 2 causal constraints over 1 iterations in 187 ms. Result :sat
Minimization took 96 ms.
[2024-05-24 05:30:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:37] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:30:37] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-24 05:30:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:30:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:37] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-24 05:30:37] [INFO ] [Nat]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-24 05:30:38] [INFO ] Deduced a trap composed of 100 places in 219 ms of which 0 ms to minimize.
[2024-05-24 05:30:38] [INFO ] Deduced a trap composed of 99 places in 229 ms of which 1 ms to minimize.
[2024-05-24 05:30:38] [INFO ] Deduced a trap composed of 97 places in 224 ms of which 1 ms to minimize.
[2024-05-24 05:30:38] [INFO ] Deduced a trap composed of 85 places in 221 ms of which 0 ms to minimize.
[2024-05-24 05:30:39] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 1 ms to minimize.
[2024-05-24 05:30:39] [INFO ] Deduced a trap composed of 79 places in 222 ms of which 0 ms to minimize.
[2024-05-24 05:30:39] [INFO ] Deduced a trap composed of 76 places in 239 ms of which 0 ms to minimize.
[2024-05-24 05:30:39] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 2 ms to minimize.
[2024-05-24 05:30:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1989 ms
[2024-05-24 05:30:39] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:30:40] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 05:30:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:40] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:30:40] [INFO ] [Real]Added 95 Read/Feed constraints in 71 ms returned sat
[2024-05-24 05:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:30:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:30:40] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:30:40] [INFO ] [Nat]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:30:41] [INFO ] Deduced a trap composed of 75 places in 217 ms of which 1 ms to minimize.
[2024-05-24 05:30:41] [INFO ] Deduced a trap composed of 85 places in 229 ms of which 0 ms to minimize.
[2024-05-24 05:30:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 513 ms
[2024-05-24 05:30:41] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 85 ms.
[2024-05-24 05:30:41] [INFO ] Added : 2 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1] Max seen :[6, 446, 509, 63641, 4, 13, 457]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 59 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:31:16] [INFO ] Computed 3 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2207 ms. (steps per millisecond=453 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 7) seen :217
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 7) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 7) seen :188
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 7) seen :150
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=1715 ) properties (out of 7) seen :251
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 7) seen :282
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 7) seen :185
[2024-05-24 05:31:23] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:31:23] [INFO ] Computed 3 invariants in 9 ms
[2024-05-24 05:31:23] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-24 05:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:23] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:31:23] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:31:23] [INFO ] [Real]Added 95 Read/Feed constraints in 28 ms returned sat
[2024-05-24 05:31:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:31:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:23] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-24 05:31:23] [INFO ] [Nat]Added 95 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:31:23] [INFO ] Deduced a trap composed of 75 places in 216 ms of which 0 ms to minimize.
[2024-05-24 05:31:24] [INFO ] Deduced a trap composed of 85 places in 222 ms of which 0 ms to minimize.
[2024-05-24 05:31:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 508 ms
[2024-05-24 05:31:24] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:31:24] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 05:31:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:31:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:24] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-24 05:31:24] [INFO ] [Real]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:31:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:31:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:31:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:25] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:31:25] [INFO ] [Nat]Added 95 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:31:25] [INFO ] Deduced a trap composed of 75 places in 220 ms of which 1 ms to minimize.
[2024-05-24 05:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2024-05-24 05:31:25] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-24 05:31:25] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 44 ms.
[2024-05-24 05:31:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:25] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-24 05:31:25] [INFO ] [Real]Added 95 Read/Feed constraints in 70 ms returned sat
[2024-05-24 05:31:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:31:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 26 ms returned sat
[2024-05-24 05:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:26] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-24 05:31:26] [INFO ] [Nat]Added 95 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:31:26] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 0 ms to minimize.
[2024-05-24 05:31:26] [INFO ] Deduced a trap composed of 82 places in 242 ms of which 0 ms to minimize.
[2024-05-24 05:31:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 525 ms
[2024-05-24 05:31:26] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:31:27] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:31:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:27] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-24 05:31:27] [INFO ] [Real]Added 95 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:31:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:31:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:31:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:27] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:31:27] [INFO ] [Nat]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:31:27] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:31:27] [INFO ] Added : 4 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 43 ms.
[2024-05-24 05:31:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:28] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:31:28] [INFO ] [Real]Added 95 Read/Feed constraints in 23 ms returned sat
[2024-05-24 05:31:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:31:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:28] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:31:28] [INFO ] [Nat]Added 95 Read/Feed constraints in 67 ms returned sat
[2024-05-24 05:31:28] [INFO ] Deduced a trap composed of 100 places in 212 ms of which 0 ms to minimize.
[2024-05-24 05:31:29] [INFO ] Deduced a trap composed of 99 places in 219 ms of which 1 ms to minimize.
[2024-05-24 05:31:29] [INFO ] Deduced a trap composed of 85 places in 239 ms of which 0 ms to minimize.
[2024-05-24 05:31:29] [INFO ] Deduced a trap composed of 78 places in 227 ms of which 0 ms to minimize.
[2024-05-24 05:31:29] [INFO ] Deduced a trap composed of 76 places in 212 ms of which 1 ms to minimize.
[2024-05-24 05:31:30] [INFO ] Deduced a trap composed of 82 places in 230 ms of which 1 ms to minimize.
[2024-05-24 05:31:30] [INFO ] Deduced a trap composed of 139 places in 207 ms of which 0 ms to minimize.
[2024-05-24 05:31:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1742 ms
[2024-05-24 05:31:30] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-24 05:31:30] [INFO ] Added : 2 causal constraints over 1 iterations in 176 ms. Result :sat
Minimization took 93 ms.
[2024-05-24 05:31:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:30] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:31:30] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-24 05:31:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:31:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:31] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:31:31] [INFO ] [Nat]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-24 05:31:31] [INFO ] Deduced a trap composed of 100 places in 222 ms of which 1 ms to minimize.
[2024-05-24 05:31:31] [INFO ] Deduced a trap composed of 99 places in 202 ms of which 1 ms to minimize.
[2024-05-24 05:31:32] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 1 ms to minimize.
[2024-05-24 05:31:32] [INFO ] Deduced a trap composed of 85 places in 221 ms of which 1 ms to minimize.
[2024-05-24 05:31:32] [INFO ] Deduced a trap composed of 83 places in 241 ms of which 1 ms to minimize.
[2024-05-24 05:31:32] [INFO ] Deduced a trap composed of 79 places in 214 ms of which 0 ms to minimize.
[2024-05-24 05:31:33] [INFO ] Deduced a trap composed of 76 places in 240 ms of which 1 ms to minimize.
[2024-05-24 05:31:33] [INFO ] Deduced a trap composed of 75 places in 233 ms of which 1 ms to minimize.
[2024-05-24 05:31:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2027 ms
[2024-05-24 05:31:33] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-24 05:31:33] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 05:31:33] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:33] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:31:33] [INFO ] [Real]Added 95 Read/Feed constraints in 67 ms returned sat
[2024-05-24 05:31:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:31:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:31:34] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-24 05:31:34] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:31:34] [INFO ] Deduced a trap composed of 75 places in 224 ms of which 0 ms to minimize.
[2024-05-24 05:31:34] [INFO ] Deduced a trap composed of 85 places in 202 ms of which 0 ms to minimize.
[2024-05-24 05:31:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 486 ms
[2024-05-24 05:31:34] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:31:34] [INFO ] Added : 2 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1] Max seen :[6, 446, 509, 63641, 4, 13, 457]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 46 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 46 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:32:09] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:32:09] [INFO ] Invariant cache hit.
[2024-05-24 05:32:10] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-24 05:32:10] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:32:10] [INFO ] Invariant cache hit.
[2024-05-24 05:32:10] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:32:11] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
[2024-05-24 05:32:11] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 05:32:11] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:32:11] [INFO ] Invariant cache hit.
[2024-05-24 05:32:11] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1841 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:32:11] [INFO ] Computed 3 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2131 ms. (steps per millisecond=469 ) properties (out of 7) seen :6992
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 7) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=1792 ) properties (out of 7) seen :189
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 7) seen :129
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 7) seen :175
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=1801 ) properties (out of 7) seen :152
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=1754 ) properties (out of 7) seen :172
[2024-05-24 05:32:17] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:32:17] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:32:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:17] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-24 05:32:17] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:32:17] [INFO ] [Real]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-24 05:32:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:32:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:18] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-24 05:32:18] [INFO ] [Nat]Added 95 Read/Feed constraints in 57 ms returned sat
[2024-05-24 05:32:18] [INFO ] Deduced a trap composed of 75 places in 211 ms of which 0 ms to minimize.
[2024-05-24 05:32:18] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 1 ms to minimize.
[2024-05-24 05:32:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 504 ms
[2024-05-24 05:32:18] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:32:18] [INFO ] Added : 2 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 57 ms.
[2024-05-24 05:32:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:19] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-24 05:32:19] [INFO ] [Real]Added 95 Read/Feed constraints in 57 ms returned sat
[2024-05-24 05:32:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:32:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-24 05:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:19] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-24 05:32:19] [INFO ] [Nat]Added 95 Read/Feed constraints in 64 ms returned sat
[2024-05-24 05:32:19] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 1 ms to minimize.
[2024-05-24 05:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-05-24 05:32:19] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-24 05:32:19] [INFO ] Added : 2 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 45 ms.
[2024-05-24 05:32:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:20] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-24 05:32:20] [INFO ] [Real]Added 95 Read/Feed constraints in 68 ms returned sat
[2024-05-24 05:32:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:32:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:20] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-24 05:32:20] [INFO ] [Nat]Added 95 Read/Feed constraints in 58 ms returned sat
[2024-05-24 05:32:20] [INFO ] Deduced a trap composed of 100 places in 218 ms of which 1 ms to minimize.
[2024-05-24 05:32:21] [INFO ] Deduced a trap composed of 82 places in 236 ms of which 1 ms to minimize.
[2024-05-24 05:32:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2024-05-24 05:32:21] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 72 ms.
[2024-05-24 05:32:21] [INFO ] Added : 2 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 46 ms.
[2024-05-24 05:32:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:21] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-24 05:32:21] [INFO ] [Real]Added 95 Read/Feed constraints in 77 ms returned sat
[2024-05-24 05:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:32:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:32:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:22] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:32:22] [INFO ] [Nat]Added 95 Read/Feed constraints in 20 ms returned sat
[2024-05-24 05:32:22] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-24 05:32:22] [INFO ] Added : 4 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:32:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:22] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:32:22] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:32:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:22] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-24 05:32:22] [INFO ] [Nat]Added 95 Read/Feed constraints in 67 ms returned sat
[2024-05-24 05:32:23] [INFO ] Deduced a trap composed of 100 places in 224 ms of which 0 ms to minimize.
[2024-05-24 05:32:23] [INFO ] Deduced a trap composed of 99 places in 242 ms of which 1 ms to minimize.
[2024-05-24 05:32:23] [INFO ] Deduced a trap composed of 85 places in 228 ms of which 1 ms to minimize.
[2024-05-24 05:32:23] [INFO ] Deduced a trap composed of 78 places in 215 ms of which 1 ms to minimize.
[2024-05-24 05:32:24] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 1 ms to minimize.
[2024-05-24 05:32:24] [INFO ] Deduced a trap composed of 82 places in 229 ms of which 0 ms to minimize.
[2024-05-24 05:32:24] [INFO ] Deduced a trap composed of 139 places in 220 ms of which 1 ms to minimize.
[2024-05-24 05:32:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1825 ms
[2024-05-24 05:32:24] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:32:24] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 98 ms.
[2024-05-24 05:32:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:32:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:25] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-24 05:32:25] [INFO ] [Real]Added 95 Read/Feed constraints in 30 ms returned sat
[2024-05-24 05:32:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:32:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:25] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-05-24 05:32:25] [INFO ] [Nat]Added 95 Read/Feed constraints in 39 ms returned sat
[2024-05-24 05:32:25] [INFO ] Deduced a trap composed of 100 places in 210 ms of which 1 ms to minimize.
[2024-05-24 05:32:26] [INFO ] Deduced a trap composed of 99 places in 221 ms of which 1 ms to minimize.
[2024-05-24 05:32:26] [INFO ] Deduced a trap composed of 97 places in 226 ms of which 1 ms to minimize.
[2024-05-24 05:32:26] [INFO ] Deduced a trap composed of 85 places in 229 ms of which 1 ms to minimize.
[2024-05-24 05:32:26] [INFO ] Deduced a trap composed of 83 places in 223 ms of which 1 ms to minimize.
[2024-05-24 05:32:27] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 1 ms to minimize.
[2024-05-24 05:32:27] [INFO ] Deduced a trap composed of 76 places in 224 ms of which 0 ms to minimize.
[2024-05-24 05:32:27] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 1 ms to minimize.
[2024-05-24 05:32:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1996 ms
[2024-05-24 05:32:27] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-24 05:32:27] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 55 ms.
[2024-05-24 05:32:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:28] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:32:28] [INFO ] [Real]Added 95 Read/Feed constraints in 68 ms returned sat
[2024-05-24 05:32:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:32:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:32:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:32:28] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-24 05:32:28] [INFO ] [Nat]Added 95 Read/Feed constraints in 65 ms returned sat
[2024-05-24 05:32:28] [INFO ] Deduced a trap composed of 75 places in 239 ms of which 0 ms to minimize.
[2024-05-24 05:32:29] [INFO ] Deduced a trap composed of 85 places in 229 ms of which 1 ms to minimize.
[2024-05-24 05:32:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 541 ms
[2024-05-24 05:32:29] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:32:29] [INFO ] Added : 2 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1] Max seen :[6, 446, 509, 64138, 4, 13, 457]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 57 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 47 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:33:04] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:33:04] [INFO ] Invariant cache hit.
[2024-05-24 05:33:04] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-24 05:33:04] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:33:04] [INFO ] Invariant cache hit.
[2024-05-24 05:33:05] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:33:05] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
[2024-05-24 05:33:05] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 05:33:05] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:33:06] [INFO ] Invariant cache hit.
[2024-05-24 05:33:06] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1941 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:33:06] [INFO ] Computed 3 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2196 ms. (steps per millisecond=455 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 7) seen :442
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 7) seen :178
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 7) seen :193
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 7) seen :163
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 7) seen :277
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 577 ms. (steps per millisecond=1733 ) properties (out of 7) seen :239
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 7) seen :145
[2024-05-24 05:33:12] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:33:12] [INFO ] Computed 3 invariants in 12 ms
[2024-05-24 05:33:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:13] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-24 05:33:13] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:33:13] [INFO ] [Real]Added 95 Read/Feed constraints in 75 ms returned sat
[2024-05-24 05:33:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:33:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:13] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-24 05:33:13] [INFO ] [Nat]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:33:13] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 0 ms to minimize.
[2024-05-24 05:33:13] [INFO ] Deduced a trap composed of 85 places in 213 ms of which 1 ms to minimize.
[2024-05-24 05:33:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 501 ms
[2024-05-24 05:33:14] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 83 ms.
[2024-05-24 05:33:14] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 71 ms.
[2024-05-24 05:33:14] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-24 05:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:14] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-24 05:33:14] [INFO ] [Real]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:33:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:33:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:14] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-24 05:33:14] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:33:15] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 0 ms to minimize.
[2024-05-24 05:33:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-05-24 05:33:15] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 77 ms.
[2024-05-24 05:33:15] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 46 ms.
[2024-05-24 05:33:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:15] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:33:15] [INFO ] [Real]Added 95 Read/Feed constraints in 73 ms returned sat
[2024-05-24 05:33:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:33:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:33:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:15] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-24 05:33:16] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:33:16] [INFO ] Deduced a trap composed of 100 places in 242 ms of which 0 ms to minimize.
[2024-05-24 05:33:16] [INFO ] Deduced a trap composed of 82 places in 223 ms of which 1 ms to minimize.
[2024-05-24 05:33:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
[2024-05-24 05:33:16] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 74 ms.
[2024-05-24 05:33:16] [INFO ] Added : 2 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:33:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:17] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:33:17] [INFO ] [Real]Added 95 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:33:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:33:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:33:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:17] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-24 05:33:17] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:33:17] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 71 ms.
[2024-05-24 05:33:17] [INFO ] Added : 4 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:33:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:17] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:33:17] [INFO ] [Real]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:33:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:33:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:18] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:33:18] [INFO ] [Nat]Added 95 Read/Feed constraints in 65 ms returned sat
[2024-05-24 05:33:18] [INFO ] Deduced a trap composed of 100 places in 208 ms of which 1 ms to minimize.
[2024-05-24 05:33:18] [INFO ] Deduced a trap composed of 99 places in 241 ms of which 1 ms to minimize.
[2024-05-24 05:33:18] [INFO ] Deduced a trap composed of 85 places in 218 ms of which 0 ms to minimize.
[2024-05-24 05:33:19] [INFO ] Deduced a trap composed of 78 places in 206 ms of which 1 ms to minimize.
[2024-05-24 05:33:19] [INFO ] Deduced a trap composed of 76 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:33:19] [INFO ] Deduced a trap composed of 82 places in 218 ms of which 1 ms to minimize.
[2024-05-24 05:33:19] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 1 ms to minimize.
[2024-05-24 05:33:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1646 ms
[2024-05-24 05:33:19] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:33:20] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 95 ms.
[2024-05-24 05:33:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:20] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-24 05:33:20] [INFO ] [Real]Added 95 Read/Feed constraints in 28 ms returned sat
[2024-05-24 05:33:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:33:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:20] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2024-05-24 05:33:20] [INFO ] [Nat]Added 95 Read/Feed constraints in 37 ms returned sat
[2024-05-24 05:33:20] [INFO ] Deduced a trap composed of 100 places in 203 ms of which 0 ms to minimize.
[2024-05-24 05:33:21] [INFO ] Deduced a trap composed of 99 places in 194 ms of which 0 ms to minimize.
[2024-05-24 05:33:21] [INFO ] Deduced a trap composed of 97 places in 195 ms of which 0 ms to minimize.
[2024-05-24 05:33:21] [INFO ] Deduced a trap composed of 85 places in 203 ms of which 0 ms to minimize.
[2024-05-24 05:33:21] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 0 ms to minimize.
[2024-05-24 05:33:22] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 1 ms to minimize.
[2024-05-24 05:33:22] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 0 ms to minimize.
[2024-05-24 05:33:22] [INFO ] Deduced a trap composed of 75 places in 197 ms of which 1 ms to minimize.
[2024-05-24 05:33:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1817 ms
[2024-05-24 05:33:22] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-24 05:33:22] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 05:33:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:23] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-24 05:33:23] [INFO ] [Real]Added 95 Read/Feed constraints in 66 ms returned sat
[2024-05-24 05:33:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:33:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:33:23] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-24 05:33:23] [INFO ] [Nat]Added 95 Read/Feed constraints in 63 ms returned sat
[2024-05-24 05:33:23] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 0 ms to minimize.
[2024-05-24 05:33:23] [INFO ] Deduced a trap composed of 85 places in 197 ms of which 1 ms to minimize.
[2024-05-24 05:33:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 472 ms
[2024-05-24 05:33:23] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-24 05:33:24] [INFO ] Added : 2 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1] Max seen :[248, 446, 509, 96854, 4, 13, 457]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 55 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 45 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:34:00] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:34:00] [INFO ] Invariant cache hit.
[2024-05-24 05:34:00] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-24 05:34:00] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:34:00] [INFO ] Invariant cache hit.
[2024-05-24 05:34:00] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:34:01] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2024-05-24 05:34:01] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-24 05:34:01] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:34:01] [INFO ] Invariant cache hit.
[2024-05-24 05:34:02] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1875 ms. Remains : 469/469 places, 1317/1317 transitions.
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:34:02] [INFO ] Computed 3 invariants in 4 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2137 ms. (steps per millisecond=467 ) properties (out of 7) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties (out of 7) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=1766 ) properties (out of 7) seen :277
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 7) seen :211
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 7) seen :190
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 7) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 7) seen :186
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 7) seen :184
[2024-05-24 05:34:08] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:34:08] [INFO ] Computed 3 invariants in 9 ms
[2024-05-24 05:34:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:08] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-24 05:34:08] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:34:08] [INFO ] [Real]Added 95 Read/Feed constraints in 65 ms returned sat
[2024-05-24 05:34:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:34:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:34:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:08] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-24 05:34:08] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:34:09] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 1 ms to minimize.
[2024-05-24 05:34:09] [INFO ] Deduced a trap composed of 85 places in 225 ms of which 1 ms to minimize.
[2024-05-24 05:34:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 499 ms
[2024-05-24 05:34:09] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:34:09] [INFO ] Added : 2 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 05:34:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:09] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-24 05:34:09] [INFO ] [Real]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:34:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:34:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:10] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-24 05:34:10] [INFO ] [Nat]Added 95 Read/Feed constraints in 59 ms returned sat
[2024-05-24 05:34:10] [INFO ] Deduced a trap composed of 75 places in 209 ms of which 1 ms to minimize.
[2024-05-24 05:34:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-05-24 05:34:10] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 77 ms.
[2024-05-24 05:34:10] [INFO ] Added : 2 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 46 ms.
[2024-05-24 05:34:10] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:10] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-24 05:34:10] [INFO ] [Real]Added 95 Read/Feed constraints in 66 ms returned sat
[2024-05-24 05:34:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:34:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:11] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-24 05:34:11] [INFO ] [Nat]Added 95 Read/Feed constraints in 60 ms returned sat
[2024-05-24 05:34:11] [INFO ] Deduced a trap composed of 100 places in 215 ms of which 0 ms to minimize.
[2024-05-24 05:34:11] [INFO ] Deduced a trap composed of 82 places in 221 ms of which 1 ms to minimize.
[2024-05-24 05:34:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 514 ms
[2024-05-24 05:34:11] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 69 ms.
[2024-05-24 05:34:11] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 05:34:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:12] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:34:12] [INFO ] [Real]Added 95 Read/Feed constraints in 58 ms returned sat
[2024-05-24 05:34:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:34:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:12] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2024-05-24 05:34:12] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:34:12] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 68 ms.
[2024-05-24 05:34:12] [INFO ] Added : 4 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 45 ms.
[2024-05-24 05:34:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:13] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-24 05:34:13] [INFO ] [Real]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:34:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:34:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:34:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:13] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-24 05:34:13] [INFO ] [Nat]Added 95 Read/Feed constraints in 64 ms returned sat
[2024-05-24 05:34:13] [INFO ] Deduced a trap composed of 100 places in 223 ms of which 0 ms to minimize.
[2024-05-24 05:34:13] [INFO ] Deduced a trap composed of 99 places in 218 ms of which 0 ms to minimize.
[2024-05-24 05:34:14] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 1 ms to minimize.
[2024-05-24 05:34:14] [INFO ] Deduced a trap composed of 78 places in 215 ms of which 0 ms to minimize.
[2024-05-24 05:34:14] [INFO ] Deduced a trap composed of 76 places in 205 ms of which 0 ms to minimize.
[2024-05-24 05:34:14] [INFO ] Deduced a trap composed of 82 places in 202 ms of which 1 ms to minimize.
[2024-05-24 05:34:15] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 0 ms to minimize.
[2024-05-24 05:34:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1658 ms
[2024-05-24 05:34:15] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-24 05:34:15] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 101 ms.
[2024-05-24 05:34:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:15] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-24 05:34:15] [INFO ] [Real]Added 95 Read/Feed constraints in 29 ms returned sat
[2024-05-24 05:34:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:34:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:34:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:15] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-24 05:34:16] [INFO ] [Nat]Added 95 Read/Feed constraints in 38 ms returned sat
[2024-05-24 05:34:16] [INFO ] Deduced a trap composed of 100 places in 210 ms of which 1 ms to minimize.
[2024-05-24 05:34:16] [INFO ] Deduced a trap composed of 99 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:34:16] [INFO ] Deduced a trap composed of 97 places in 217 ms of which 1 ms to minimize.
[2024-05-24 05:34:16] [INFO ] Deduced a trap composed of 85 places in 205 ms of which 0 ms to minimize.
[2024-05-24 05:34:17] [INFO ] Deduced a trap composed of 83 places in 210 ms of which 0 ms to minimize.
[2024-05-24 05:34:17] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 0 ms to minimize.
[2024-05-24 05:34:17] [INFO ] Deduced a trap composed of 76 places in 221 ms of which 1 ms to minimize.
[2024-05-24 05:34:17] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 1 ms to minimize.
[2024-05-24 05:34:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1906 ms
[2024-05-24 05:34:18] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 79 ms.
[2024-05-24 05:34:18] [INFO ] Added : 2 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 57 ms.
[2024-05-24 05:34:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:18] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 05:34:18] [INFO ] [Real]Added 95 Read/Feed constraints in 69 ms returned sat
[2024-05-24 05:34:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:34:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:18] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-24 05:34:18] [INFO ] [Nat]Added 95 Read/Feed constraints in 62 ms returned sat
[2024-05-24 05:34:19] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 2 ms to minimize.
[2024-05-24 05:34:19] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 1 ms to minimize.
[2024-05-24 05:34:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 498 ms
[2024-05-24 05:34:19] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 76 ms.
[2024-05-24 05:34:19] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1] Max seen :[248, 446, 509, 96854, 4, 13, 457]
Support contains 7 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 47 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Applied a total of 0 rules in 46 ms. Remains 469 /469 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-05-24 05:34:56] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:34:56] [INFO ] Invariant cache hit.
[2024-05-24 05:34:56] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-24 05:34:56] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:34:56] [INFO ] Invariant cache hit.
[2024-05-24 05:34:56] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:34:57] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2024-05-24 05:34:57] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 05:34:57] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
[2024-05-24 05:34:57] [INFO ] Invariant cache hit.
[2024-05-24 05:34:57] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1844 ms. Remains : 469/469 places, 1317/1317 transitions.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-01
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:34:57] [INFO ] Computed 3 invariants in 6 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-24 05:34:58] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:34:58] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 05:34:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:58] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-24 05:34:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:34:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:34:58] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-24 05:34:58] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:34:58] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-24 05:34:58] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 90 ms.
[2024-05-24 05:34:58] [INFO ] Added : 2 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1268
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1258
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1248
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 432 transition count 1242
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 432 transition count 1242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 430 transition count 1238
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 430 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 429 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 428 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1220
Applied a total of 92 rules in 183 ms. Remains 422 /469 variables (removed 47) and now considering 1220/1317 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 422/469 places, 1220/1317 transitions.
Normalized transition count is 689 out of 1220 initially.
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 05:34:59] [INFO ] Computed 3 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2090 ms. (steps per millisecond=478 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 1) seen :0
[2024-05-24 05:35:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 05:35:01] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:35:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:01] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-24 05:35:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:02] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-24 05:35:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:02] [INFO ] [Nat]Added 75 Read/Feed constraints in 24 ms returned sat
[2024-05-24 05:35:02] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 72 ms.
[2024-05-24 05:35:02] [INFO ] Added : 20 causal constraints over 5 iterations in 421 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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 REACHABILITY mode , in 1 iterations and 45 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, 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.
[2024-05-24 05:35:02] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:02] [INFO ] Invariant cache hit.
[2024-05-24 05:35:03] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-24 05:35:03] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:03] [INFO ] Invariant cache hit.
[2024-05-24 05:35:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:03] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2024-05-24 05:35:03] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 05:35:03] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:03] [INFO ] Invariant cache hit.
[2024-05-24 05:35:04] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1646 ms. Remains : 422/422 places, 1220/1220 transitions.
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-01 in 6401 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-03
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:35:04] [INFO ] Computed 3 invariants in 6 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-24 05:35:04] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:35:04] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:35:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:04] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-24 05:35:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:04] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-24 05:35:04] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:35:04] [INFO ] [Nat]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:35:05] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 81 ms.
[2024-05-24 05:35:05] [INFO ] Added : 2 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1290
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1268
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1258
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1248
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 432 transition count 1242
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 432 transition count 1242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 430 transition count 1238
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 430 transition count 1238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 428 transition count 1234
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 428 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 421 transition count 1218
Applied a total of 94 rules in 174 ms. Remains 421 /469 variables (removed 48) and now considering 1218/1317 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 421/469 places, 1218/1317 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2024-05-24 05:35:05] [INFO ] Computed 3 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2099 ms. (steps per millisecond=476 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 1) seen :0
[2024-05-24 05:35:08] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-24 05:35:08] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:35:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:08] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-24 05:35:08] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:08] [INFO ] [Real]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-24 05:35:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:08] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-24 05:35:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 63 ms returned sat
[2024-05-24 05:35:08] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 0 ms to minimize.
[2024-05-24 05:35:09] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 1 ms to minimize.
[2024-05-24 05:35:09] [INFO ] Deduced a trap composed of 81 places in 189 ms of which 1 ms to minimize.
[2024-05-24 05:35:09] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 0 ms to minimize.
[2024-05-24 05:35:09] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 0 ms to minimize.
[2024-05-24 05:35:09] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 0 ms to minimize.
[2024-05-24 05:35:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1274 ms
[2024-05-24 05:35:09] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 70 ms.
[2024-05-24 05:35:10] [INFO ] Added : 12 causal constraints over 4 iterations in 295 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[12]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-24 05:35:10] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:10] [INFO ] Invariant cache hit.
[2024-05-24 05:35:10] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-24 05:35:10] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:10] [INFO ] Invariant cache hit.
[2024-05-24 05:35:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:11] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2024-05-24 05:35:11] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 05:35:11] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:11] [INFO ] Invariant cache hit.
[2024-05-24 05:35:12] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1677 ms. Remains : 421/421 places, 1218/1218 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2024-05-24 05:35:12] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 2084 ms. (steps per millisecond=479 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 572 ms. (steps per millisecond=1748 ) properties (out of 1) seen :470
[2024-05-24 05:35:14] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-24 05:35:14] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 05:35:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:14] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-24 05:35:14] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:14] [INFO ] [Real]Added 75 Read/Feed constraints in 41 ms returned sat
[2024-05-24 05:35:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:15] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-24 05:35:15] [INFO ] [Nat]Added 75 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:35:15] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 1 ms to minimize.
[2024-05-24 05:35:15] [INFO ] Deduced a trap composed of 97 places in 191 ms of which 0 ms to minimize.
[2024-05-24 05:35:15] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 1 ms to minimize.
[2024-05-24 05:35:16] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 1 ms to minimize.
[2024-05-24 05:35:16] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 0 ms to minimize.
[2024-05-24 05:35:16] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 0 ms to minimize.
[2024-05-24 05:35:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1297 ms
[2024-05-24 05:35:16] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 81 ms.
[2024-05-24 05:35:16] [INFO ] Added : 12 causal constraints over 4 iterations in 315 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[470]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-24 05:35:18] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:18] [INFO ] Invariant cache hit.
[2024-05-24 05:35:19] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-24 05:35:19] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:19] [INFO ] Invariant cache hit.
[2024-05-24 05:35:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:20] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2024-05-24 05:35:20] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 05:35:20] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:20] [INFO ] Invariant cache hit.
[2024-05-24 05:35:20] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1746 ms. Remains : 421/421 places, 1218/1218 transitions.
Normalized transition count is 688 out of 1218 initially.
// Phase 1: matrix 688 rows 421 cols
[2024-05-24 05:35:20] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2124 ms. (steps per millisecond=470 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=1782 ) properties (out of 1) seen :0
[2024-05-24 05:35:23] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-24 05:35:23] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:35:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:23] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-24 05:35:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:23] [INFO ] [Real]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-24 05:35:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:23] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-24 05:35:23] [INFO ] [Nat]Added 75 Read/Feed constraints in 61 ms returned sat
[2024-05-24 05:35:24] [INFO ] Deduced a trap composed of 113 places in 201 ms of which 1 ms to minimize.
[2024-05-24 05:35:24] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 1 ms to minimize.
[2024-05-24 05:35:24] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 1 ms to minimize.
[2024-05-24 05:35:24] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 3 ms to minimize.
[2024-05-24 05:35:24] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 1 ms to minimize.
[2024-05-24 05:35:25] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 0 ms to minimize.
[2024-05-24 05:35:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1247 ms
[2024-05-24 05:35:25] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 71 ms.
[2024-05-24 05:35:25] [INFO ] Added : 12 causal constraints over 4 iterations in 309 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[470]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-24 05:35:27] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:27] [INFO ] Invariant cache hit.
[2024-05-24 05:35:27] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-24 05:35:27] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:27] [INFO ] Invariant cache hit.
[2024-05-24 05:35:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:28] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
[2024-05-24 05:35:28] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-24 05:35:28] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-24 05:35:28] [INFO ] Invariant cache hit.
[2024-05-24 05:35:29] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1681 ms. Remains : 421/421 places, 1218/1218 transitions.
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-03 in 24826 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-05
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:35:29] [INFO ] Computed 3 invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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
[2024-05-24 05:35:29] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:35:29] [INFO ] Computed 3 invariants in 9 ms
[2024-05-24 05:35:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:29] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-24 05:35:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:29] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:35:29] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:35:29] [INFO ] [Nat]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:35:29] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-24 05:35:29] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1276
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1266
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1256
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1246
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 431 transition count 1238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 428 transition count 1232
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 426 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 421 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 421 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 420 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 419 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 419 transition count 1212
Applied a total of 98 rules in 176 ms. Remains 419 /469 variables (removed 50) and now considering 1212/1317 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 419/469 places, 1212/1317 transitions.
Normalized transition count is 685 out of 1212 initially.
// Phase 1: matrix 685 rows 419 cols
[2024-05-24 05:35:30] [INFO ] Computed 3 invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2085 ms. (steps per millisecond=479 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 1) seen :0
[2024-05-24 05:35:32] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-24 05:35:32] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 05:35:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:33] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-24 05:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:35:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:33] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-24 05:35:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:33] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2024-05-24 05:35:33] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 72 ms.
[2024-05-24 05:35:33] [INFO ] Added : 6 causal constraints over 2 iterations in 219 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 46 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 43 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-24 05:35:33] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-24 05:35:33] [INFO ] Invariant cache hit.
[2024-05-24 05:35:34] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-24 05:35:34] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-24 05:35:34] [INFO ] Invariant cache hit.
[2024-05-24 05:35:34] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:34] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
[2024-05-24 05:35:34] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 05:35:34] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-24 05:35:34] [INFO ] Invariant cache hit.
[2024-05-24 05:35:35] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1658 ms. Remains : 419/419 places, 1212/1212 transitions.
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-05 in 6122 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-06
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:35:35] [INFO ] Computed 3 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :50
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
[2024-05-24 05:35:35] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:35:35] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 05:35:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:35] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-24 05:35:35] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:35:35] [INFO ] [Real]Added 95 Read/Feed constraints in 51 ms returned sat
[2024-05-24 05:35:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:35] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-24 05:35:35] [INFO ] [Nat]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:35:36] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 81 ms.
[2024-05-24 05:35:36] [INFO ] Added : 4 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[50]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 466 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 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 466 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 461 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 461 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 456 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 456 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 451 transition count 1276
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 451 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 446 transition count 1266
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 446 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 441 transition count 1256
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 441 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 436 transition count 1246
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 436 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 433 transition count 1240
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 433 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 431 transition count 1236
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 431 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 430 transition count 1234
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 430 transition count 1234
Applied a total of 78 rules in 131 ms. Remains 430 /469 variables (removed 39) and now considering 1234/1317 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 430/469 places, 1234/1317 transitions.
Normalized transition count is 699 out of 1234 initially.
// Phase 1: matrix 699 rows 430 cols
[2024-05-24 05:35:36] [INFO ] Computed 3 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2060 ms. (steps per millisecond=485 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 1) seen :207
[2024-05-24 05:35:39] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
// Phase 1: matrix 699 rows 430 cols
[2024-05-24 05:35:39] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:35:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:39] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-24 05:35:39] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-24 05:35:39] [INFO ] [Real]Added 77 Read/Feed constraints in 33 ms returned sat
[2024-05-24 05:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:39] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:35:39] [INFO ] [Nat]Added 77 Read/Feed constraints in 18 ms returned sat
[2024-05-24 05:35:39] [INFO ] Computed and/alt/rep : 343/1274/336 causal constraints (skipped 361 transitions) in 67 ms.
[2024-05-24 05:35:40] [INFO ] Added : 12 causal constraints over 3 iterations in 266 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[207]
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 40 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 430/430 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 40 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-24 05:35:41] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:35:41] [INFO ] Invariant cache hit.
[2024-05-24 05:35:42] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-24 05:35:42] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:35:42] [INFO ] Invariant cache hit.
[2024-05-24 05:35:42] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-24 05:35:43] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2024-05-24 05:35:43] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 05:35:43] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:35:43] [INFO ] Invariant cache hit.
[2024-05-24 05:35:43] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1739 ms. Remains : 430/430 places, 1234/1234 transitions.
Normalized transition count is 699 out of 1234 initially.
// Phase 1: matrix 699 rows 430 cols
[2024-05-24 05:35:43] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2076 ms. (steps per millisecond=481 ) properties (out of 1) seen :7308
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 1) seen :188
[2024-05-24 05:35:46] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
// Phase 1: matrix 699 rows 430 cols
[2024-05-24 05:35:46] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 05:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:46] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-24 05:35:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-24 05:35:46] [INFO ] [Real]Added 77 Read/Feed constraints in 37 ms returned sat
[2024-05-24 05:35:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:35:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:35:46] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-24 05:35:46] [INFO ] [Nat]Added 77 Read/Feed constraints in 17 ms returned sat
[2024-05-24 05:35:46] [INFO ] Computed and/alt/rep : 343/1274/336 causal constraints (skipped 361 transitions) in 72 ms.
[2024-05-24 05:35:46] [INFO ] Added : 12 causal constraints over 3 iterations in 276 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[7308]
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 53 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 430/430 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 44 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-24 05:36:17] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:36:17] [INFO ] Invariant cache hit.
[2024-05-24 05:36:17] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-24 05:36:17] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:36:17] [INFO ] Invariant cache hit.
[2024-05-24 05:36:17] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-24 05:36:18] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2024-05-24 05:36:18] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 05:36:18] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:36:18] [INFO ] Invariant cache hit.
[2024-05-24 05:36:18] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1823 ms. Remains : 430/430 places, 1234/1234 transitions.
Normalized transition count is 699 out of 1234 initially.
// Phase 1: matrix 699 rows 430 cols
[2024-05-24 05:36:18] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2221 ms. (steps per millisecond=450 ) properties (out of 1) seen :2252
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=1763 ) properties (out of 1) seen :0
[2024-05-24 05:36:21] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
// Phase 1: matrix 699 rows 430 cols
[2024-05-24 05:36:21] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 05:36:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:36:21] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-24 05:36:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-24 05:36:22] [INFO ] [Real]Added 77 Read/Feed constraints in 36 ms returned sat
[2024-05-24 05:36:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:36:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:36:22] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-24 05:36:22] [INFO ] [Nat]Added 77 Read/Feed constraints in 19 ms returned sat
[2024-05-24 05:36:22] [INFO ] Computed and/alt/rep : 343/1274/336 causal constraints (skipped 361 transitions) in 77 ms.
[2024-05-24 05:36:22] [INFO ] Added : 12 causal constraints over 3 iterations in 286 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[76670]
Support contains 1 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 44 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 430/430 places, 1234/1234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 1234/1234 transitions.
Applied a total of 0 rules in 44 ms. Remains 430 /430 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-24 05:36:52] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:36:52] [INFO ] Invariant cache hit.
[2024-05-24 05:36:53] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-24 05:36:53] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:36:53] [INFO ] Invariant cache hit.
[2024-05-24 05:36:53] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-24 05:36:54] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2024-05-24 05:36:54] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 05:36:54] [INFO ] Flow matrix only has 699 transitions (discarded 535 similar events)
[2024-05-24 05:36:54] [INFO ] Invariant cache hit.
[2024-05-24 05:36:54] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1770 ms. Remains : 430/430 places, 1234/1234 transitions.
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-06 in 79165 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-10
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:36:54] [INFO ] Computed 3 invariants in 3 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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
[2024-05-24 05:36:54] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:36:54] [INFO ] Computed 3 invariants in 5 ms
[2024-05-24 05:36:54] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-24 05:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:36:54] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-24 05:36:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:36:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:36:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:36:55] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-24 05:36:55] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:36:55] [INFO ] [Nat]Added 95 Read/Feed constraints in 19 ms returned sat
[2024-05-24 05:36:55] [INFO ] Deduced a trap composed of 85 places in 212 ms of which 1 ms to minimize.
[2024-05-24 05:36:55] [INFO ] Deduced a trap composed of 85 places in 215 ms of which 0 ms to minimize.
[2024-05-24 05:36:55] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 1 ms to minimize.
[2024-05-24 05:36:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 785 ms
[2024-05-24 05:36:55] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 70 ms.
[2024-05-24 05:36:55] [INFO ] Added : 2 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 468 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 462 transition count 1303
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 462 transition count 1303
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 456 transition count 1289
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 456 transition count 1289
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 31 place count 450 transition count 1275
Iterating global reduction 0 with 6 rules applied. Total rules applied 37 place count 450 transition count 1275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 444 transition count 1263
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 444 transition count 1263
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 55 place count 438 transition count 1251
Iterating global reduction 0 with 6 rules applied. Total rules applied 61 place count 438 transition count 1251
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 67 place count 432 transition count 1239
Iterating global reduction 0 with 6 rules applied. Total rules applied 73 place count 432 transition count 1239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 77 place count 428 transition count 1231
Iterating global reduction 0 with 4 rules applied. Total rules applied 81 place count 428 transition count 1231
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 84 place count 425 transition count 1225
Iterating global reduction 0 with 3 rules applied. Total rules applied 87 place count 425 transition count 1225
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 89 place count 423 transition count 1221
Iterating global reduction 0 with 2 rules applied. Total rules applied 91 place count 423 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 92 place count 422 transition count 1217
Iterating global reduction 0 with 1 rules applied. Total rules applied 93 place count 422 transition count 1217
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 94 place count 421 transition count 1215
Iterating global reduction 0 with 1 rules applied. Total rules applied 95 place count 421 transition count 1215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 96 place count 420 transition count 1213
Iterating global reduction 0 with 1 rules applied. Total rules applied 97 place count 420 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 98 place count 419 transition count 1211
Iterating global reduction 0 with 1 rules applied. Total rules applied 99 place count 419 transition count 1211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 100 place count 418 transition count 1209
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 418 transition count 1209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 102 place count 417 transition count 1207
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 104 place count 416 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 416 transition count 1205
Applied a total of 105 rules in 176 ms. Remains 416 /469 variables (removed 53) and now considering 1205/1317 (removed 112) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 416/469 places, 1205/1317 transitions.
Normalized transition count is 680 out of 1205 initially.
// Phase 1: matrix 680 rows 416 cols
[2024-05-24 05:36:56] [INFO ] Computed 3 invariants in 5 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2003 ms. (steps per millisecond=499 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 1) seen :0
[2024-05-24 05:36:58] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-24 05:36:58] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:36:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:36:59] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-24 05:36:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:36:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:36:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:36:59] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-24 05:36:59] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:36:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 70 ms returned sat
[2024-05-24 05:36:59] [INFO ] Deduced a trap composed of 139 places in 182 ms of which 3 ms to minimize.
[2024-05-24 05:36:59] [INFO ] Deduced a trap composed of 69 places in 170 ms of which 1 ms to minimize.
[2024-05-24 05:36:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 437 ms
[2024-05-24 05:36:59] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 74 ms.
[2024-05-24 05:36:59] [INFO ] Added : 3 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 42 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 42 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-24 05:37:00] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-24 05:37:00] [INFO ] Invariant cache hit.
[2024-05-24 05:37:00] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-24 05:37:00] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-24 05:37:00] [INFO ] Invariant cache hit.
[2024-05-24 05:37:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:01] [INFO ] Implicit Places using invariants and state equation in 872 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2024-05-24 05:37:01] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 05:37:01] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-24 05:37:01] [INFO ] Invariant cache hit.
[2024-05-24 05:37:01] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1753 ms. Remains : 416/416 places, 1205/1205 transitions.
Normalized transition count is 680 out of 1205 initially.
// Phase 1: matrix 680 rows 416 cols
[2024-05-24 05:37:01] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2043 ms. (steps per millisecond=489 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 1) seen :0
[2024-05-24 05:37:04] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-24 05:37:04] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:37:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:04] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-24 05:37:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:04] [INFO ] [Real]Added 75 Read/Feed constraints in 22 ms returned sat
[2024-05-24 05:37:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:37:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:04] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-24 05:37:04] [INFO ] [Nat]Added 75 Read/Feed constraints in 53 ms returned sat
[2024-05-24 05:37:05] [INFO ] Deduced a trap composed of 80 places in 198 ms of which 1 ms to minimize.
[2024-05-24 05:37:05] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 1 ms to minimize.
[2024-05-24 05:37:05] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 0 ms to minimize.
[2024-05-24 05:37:05] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 1 ms to minimize.
[2024-05-24 05:37:06] [INFO ] Deduced a trap composed of 139 places in 195 ms of which 0 ms to minimize.
[2024-05-24 05:37:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1097 ms
[2024-05-24 05:37:06] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 62 ms.
[2024-05-24 05:37:06] [INFO ] Added : 6 causal constraints over 2 iterations in 175 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 38 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-24 05:37:06] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-24 05:37:06] [INFO ] Invariant cache hit.
[2024-05-24 05:37:06] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-24 05:37:06] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-24 05:37:06] [INFO ] Invariant cache hit.
[2024-05-24 05:37:06] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:07] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
[2024-05-24 05:37:07] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 05:37:07] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-24 05:37:07] [INFO ] Invariant cache hit.
[2024-05-24 05:37:08] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1686 ms. Remains : 416/416 places, 1205/1205 transitions.
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-10 in 13603 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-11
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:37:08] [INFO ] Computed 3 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-24 05:37:08] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:37:08] [INFO ] Computed 3 invariants in 2 ms
[2024-05-24 05:37:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:08] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-24 05:37:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:37:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:08] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-05-24 05:37:08] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:37:08] [INFO ] [Nat]Added 95 Read/Feed constraints in 30 ms returned sat
[2024-05-24 05:37:08] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 78 ms.
[2024-05-24 05:37:08] [INFO ] Added : 2 causal constraints over 1 iterations in 167 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1288
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1276
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1266
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1256
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1246
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 431 transition count 1238
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 431 transition count 1238
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 428 transition count 1232
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 426 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 421 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 421 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 420 transition count 1214
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 419 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 419 transition count 1212
Applied a total of 98 rules in 167 ms. Remains 419 /469 variables (removed 50) and now considering 1212/1317 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 419/469 places, 1212/1317 transitions.
Normalized transition count is 685 out of 1212 initially.
// Phase 1: matrix 685 rows 419 cols
[2024-05-24 05:37:09] [INFO ] Computed 3 invariants in 5 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties (out of 1) seen :0
[2024-05-24 05:37:11] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-24 05:37:11] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 05:37:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:11] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-24 05:37:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:37:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:12] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-24 05:37:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:12] [INFO ] [Nat]Added 75 Read/Feed constraints in 18 ms returned sat
[2024-05-24 05:37:12] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 63 ms.
[2024-05-24 05:37:12] [INFO ] Added : 6 causal constraints over 2 iterations in 209 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 39 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 38 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-24 05:37:12] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-24 05:37:12] [INFO ] Invariant cache hit.
[2024-05-24 05:37:12] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-24 05:37:12] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-24 05:37:12] [INFO ] Invariant cache hit.
[2024-05-24 05:37:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:13] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-24 05:37:13] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 05:37:13] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-24 05:37:13] [INFO ] Invariant cache hit.
[2024-05-24 05:37:14] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1638 ms. Remains : 419/419 places, 1212/1212 transitions.
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-11 in 6035 ms.
Starting property specific reduction for FunctionPointer-PT-c004-UpperBounds-12
Normalized transition count is 763 out of 1317 initially.
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:37:14] [INFO ] Computed 3 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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
[2024-05-24 05:37:14] [INFO ] Flow matrix only has 763 transitions (discarded 554 similar events)
// Phase 1: matrix 763 rows 469 cols
[2024-05-24 05:37:14] [INFO ] Computed 3 invariants in 3 ms
[2024-05-24 05:37:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:14] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-24 05:37:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:37:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-24 05:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:14] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-24 05:37:14] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-24 05:37:14] [INFO ] [Nat]Added 95 Read/Feed constraints in 19 ms returned sat
[2024-05-24 05:37:14] [INFO ] Computed and/alt/rep : 90/94/83 causal constraints (skipped 678 transitions) in 97 ms.
[2024-05-24 05:37:14] [INFO ] Added : 2 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 1317/1317 transitions.
Graph (complete) has 2272 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 465 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 460 transition count 1302
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 460 transition count 1302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 21 place count 455 transition count 1290
Iterating global reduction 1 with 5 rules applied. Total rules applied 26 place count 455 transition count 1290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 31 place count 450 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 36 place count 450 transition count 1278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 445 transition count 1268
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 445 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 440 transition count 1258
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 435 transition count 1248
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 432 transition count 1242
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 432 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 429 transition count 1236
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 429 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 427 transition count 1232
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 427 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 420 transition count 1216
Applied a total of 96 rules in 173 ms. Remains 420 /469 variables (removed 49) and now considering 1216/1317 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 420/469 places, 1216/1317 transitions.
Normalized transition count is 687 out of 1216 initially.
// Phase 1: matrix 687 rows 420 cols
[2024-05-24 05:37:15] [INFO ] Computed 3 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2000 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 1) seen :0
[2024-05-24 05:37:17] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-24 05:37:17] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 05:37:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:17] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-24 05:37:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:37:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:18] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-24 05:37:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 17 ms returned sat
[2024-05-24 05:37:18] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 63 ms.
[2024-05-24 05:37:18] [INFO ] Added : 15 causal constraints over 4 iterations in 365 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 40 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 40 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-24 05:37:18] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:18] [INFO ] Invariant cache hit.
[2024-05-24 05:37:18] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-24 05:37:18] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:18] [INFO ] Invariant cache hit.
[2024-05-24 05:37:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:19] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2024-05-24 05:37:19] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 05:37:19] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:19] [INFO ] Invariant cache hit.
[2024-05-24 05:37:20] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1672 ms. Remains : 420/420 places, 1216/1216 transitions.
Normalized transition count is 687 out of 1216 initially.
// Phase 1: matrix 687 rows 420 cols
[2024-05-24 05:37:20] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1975 ms. (steps per millisecond=506 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 1) seen :428
[2024-05-24 05:37:22] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-24 05:37:22] [INFO ] Computed 3 invariants in 4 ms
[2024-05-24 05:37:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:22] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-24 05:37:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:23] [INFO ] [Real]Added 75 Read/Feed constraints in 63 ms returned sat
[2024-05-24 05:37:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:37:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:37:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:23] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-24 05:37:23] [INFO ] [Nat]Added 75 Read/Feed constraints in 56 ms returned sat
[2024-05-24 05:37:23] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 1 ms to minimize.
[2024-05-24 05:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-24 05:37:23] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 66 ms.
[2024-05-24 05:37:23] [INFO ] Added : 15 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[428]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 38 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 39 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-24 05:37:25] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:25] [INFO ] Invariant cache hit.
[2024-05-24 05:37:25] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-24 05:37:25] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:25] [INFO ] Invariant cache hit.
[2024-05-24 05:37:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:27] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
[2024-05-24 05:37:27] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 05:37:27] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:27] [INFO ] Invariant cache hit.
[2024-05-24 05:37:27] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2346 ms. Remains : 420/420 places, 1216/1216 transitions.
Normalized transition count is 687 out of 1216 initially.
// Phase 1: matrix 687 rows 420 cols
[2024-05-24 05:37:27] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1992 ms. (steps per millisecond=502 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=1934 ) properties (out of 1) seen :0
[2024-05-24 05:37:30] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-24 05:37:30] [INFO ] Computed 3 invariants in 6 ms
[2024-05-24 05:37:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:37:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:30] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-24 05:37:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:30] [INFO ] [Real]Added 75 Read/Feed constraints in 64 ms returned sat
[2024-05-24 05:37:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:37:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:37:30] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-24 05:37:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 56 ms returned sat
[2024-05-24 05:37:31] [INFO ] Deduced a trap composed of 113 places in 204 ms of which 0 ms to minimize.
[2024-05-24 05:37:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-24 05:37:31] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 71 ms.
[2024-05-24 05:37:31] [INFO ] Added : 15 causal constraints over 4 iterations in 278 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[428]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 39 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 39 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-24 05:37:32] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:32] [INFO ] Invariant cache hit.
[2024-05-24 05:37:33] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-24 05:37:33] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:33] [INFO ] Invariant cache hit.
[2024-05-24 05:37:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:37:34] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
[2024-05-24 05:37:34] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 05:37:34] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-24 05:37:34] [INFO ] Invariant cache hit.
[2024-05-24 05:37:34] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1677 ms. Remains : 420/420 places, 1216/1216 transitions.
Ending property specific reduction for FunctionPointer-PT-c004-UpperBounds-12 in 20383 ms.
[2024-05-24 05:37:35] [INFO ] Flatten gal took : 210 ms
[2024-05-24 05:37:35] [INFO ] Applying decomposition
[2024-05-24 05:37:35] [INFO ] Flatten gal took : 114 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15352224976278736169.txt' '-o' '/tmp/graph15352224976278736169.bin' '-w' '/tmp/graph15352224976278736169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15352224976278736169.bin' '-l' '-1' '-v' '-w' '/tmp/graph15352224976278736169.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:37:35] [INFO ] Decomposing Gal with order
[2024-05-24 05:37:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:37:36] [INFO ] Removed a total of 2268 redundant transitions.
[2024-05-24 05:37:36] [INFO ] Flatten gal took : 537 ms
[2024-05-24 05:37:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 942 labels/synchronizations in 118 ms.
[2024-05-24 05:37:36] [INFO ] Time to serialize gal into /tmp/UpperBounds12433515774528333594.gal : 37 ms
[2024-05-24 05:37:36] [INFO ] Time to serialize properties into /tmp/UpperBounds2526276424969422312.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12433515774528333594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2526276424969422312.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds2526276424969422312.prop.
Detected timeout of ITS tools.
[2024-05-24 06:01:49] [INFO ] Flatten gal took : 49 ms
[2024-05-24 06:01:49] [INFO ] Time to serialize gal into /tmp/UpperBounds2744931950920517496.gal : 9 ms
[2024-05-24 06:01:49] [INFO ] Time to serialize properties into /tmp/UpperBounds4374391375357351754.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2744931950920517496.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4374391375357351754.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds4374391375357351754.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 161016 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16061512 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-c004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-c004, 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 r197-tall-171640625000176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 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 ;