About the Execution of GreatSPN+red for FunctionPointer-PT-c032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13023.163 | 2311094.00 | 2948433.00 | 5774.50 | 0 32 32 32 ? inf 0 ? 0 0 ? ? 1 ? 32 ? | 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.r179-tall-171640601200309.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 greatspnxred
Input is FunctionPointer-PT-c032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200309
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:56 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:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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-c032-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c032-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716445036202
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 06:17:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 06:17:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 06:17:17] [INFO ] Load time of PNML (sax parser for PT used): 396 ms
[2024-05-23 06:17:17] [INFO ] Transformed 2826 places.
[2024-05-23 06:17:17] [INFO ] Transformed 8960 transitions.
[2024-05-23 06:17:17] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1198 places in 42 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:17:18] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-23 06:17:18] [INFO ] Computed 4 invariants in 83 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, 1, +inf, 32, +inf]
RANDOM walk for 10000 steps (2 resets) in 164 ms. (60 steps per ms)
BEST_FIRST walk for 120010 steps (53 resets) in 231 ms. (517 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, 1, +inf, 32, +inf]
[2024-05-23 06:17:18] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-23 06:17:18] [INFO ] Invariant cache hit.
[2024-05-23 06:17:18] [INFO ] [Real]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-05-23 06:17:18] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 06:17:19] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2024-05-23 06:17:19] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-23 06:17:20] [INFO ] [Real]Added 479 Read/Feed constraints in 166 ms returned sat
[2024-05-23 06:17:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 06:17:20] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:17:21] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2024-05-23 06:17:21] [INFO ] [Nat]Added 479 Read/Feed constraints in 146 ms returned sat
[2024-05-23 06:17:22] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 764 ms.
[2024-05-23 06:17:22] [INFO ] Added : 2 causal constraints over 1 iterations in 1139 ms. Result :sat
Minimization took 587 ms.
[2024-05-23 06:17:23] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:17:23] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:24] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2024-05-23 06:17:24] [INFO ] [Real]Added 479 Read/Feed constraints in 113 ms returned sat
[2024-05-23 06:17:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 06:17:24] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:17:25] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2024-05-23 06:17:25] [INFO ] [Nat]Added 479 Read/Feed constraints in 91 ms returned sat
[2024-05-23 06:17:26] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 430 ms.
[2024-05-23 06:17:26] [INFO ] Added : 0 causal constraints over 0 iterations in 668 ms. Result :sat
Minimization took 600 ms.
[2024-05-23 06:17:27] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-23 06:17:27] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:17:27] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2024-05-23 06:17:28] [INFO ] [Real]Added 479 Read/Feed constraints in 157 ms returned sat
[2024-05-23 06:17:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 06:17:28] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:29] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2024-05-23 06:17:29] [INFO ] [Nat]Added 479 Read/Feed constraints in 179 ms returned sat
[2024-05-23 06:17:29] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 473 ms.
[2024-05-23 06:17:30] [INFO ] Added : 2 causal constraints over 1 iterations in 805 ms. Result :sat
Minimization took 579 ms.
[2024-05-23 06:17:31] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:17:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:31] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2024-05-23 06:17:32] [INFO ] [Real]Added 479 Read/Feed constraints in 226 ms returned sat
[2024-05-23 06:17:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 06:17:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:17:33] [INFO ] [Nat]Absence check using state equation in 787 ms returned sat
[2024-05-23 06:17:33] [INFO ] [Nat]Added 479 Read/Feed constraints in 122 ms returned sat
[2024-05-23 06:17:33] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 444 ms.
[2024-05-23 06:17:34] [INFO ] Added : 1 causal constraints over 1 iterations in 754 ms. Result :sat
Minimization took 583 ms.
[2024-05-23 06:17:34] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:17:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:35] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2024-05-23 06:17:35] [INFO ] [Real]Added 479 Read/Feed constraints in 139 ms returned sat
[2024-05-23 06:17:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 06:17:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:17:36] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2024-05-23 06:17:36] [INFO ] [Nat]Added 479 Read/Feed constraints in 83 ms returned sat
[2024-05-23 06:17:37] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 484 ms.
[2024-05-23 06:17:37] [INFO ] Added : 1 causal constraints over 1 iterations in 800 ms. Result :sat
Minimization took 581 ms.
[2024-05-23 06:17:38] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:17:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:39] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-23 06:17:39] [INFO ] [Real]Added 479 Read/Feed constraints in 214 ms returned sat
[2024-05-23 06:17:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 06:17:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-23 06:17:40] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2024-05-23 06:17:40] [INFO ] [Nat]Added 479 Read/Feed constraints in 126 ms returned sat
[2024-05-23 06:17:41] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 485 ms.
[2024-05-23 06:17:41] [INFO ] Added : 2 causal constraints over 1 iterations in 802 ms. Result :sat
Minimization took 583 ms.
[2024-05-23 06:17:42] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:17:42] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:17:43] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2024-05-23 06:17:43] [INFO ] [Real]Added 479 Read/Feed constraints in 164 ms returned sat
[2024-05-23 06:17:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2024-05-23 06:17:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:17:44] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2024-05-23 06:17:44] [INFO ] [Nat]Added 479 Read/Feed constraints in 115 ms returned sat
[2024-05-23 06:17:45] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 476 ms.
[2024-05-23 06:17:45] [INFO ] Added : 2 causal constraints over 1 iterations in 785 ms. Result :sat
Minimization took 607 ms.
[2024-05-23 06:17:46] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:17:46] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:47] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2024-05-23 06:17:47] [INFO ] [Real]Added 479 Read/Feed constraints in 183 ms returned sat
[2024-05-23 06:17:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 06:17:47] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:48] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2024-05-23 06:17:48] [INFO ] [Nat]Added 479 Read/Feed constraints in 158 ms returned sat
[2024-05-23 06:17:49] [INFO ] Deduced a trap composed of 134 places in 1223 ms of which 86 ms to minimize.
[2024-05-23 06:17:51] [INFO ] Deduced a trap composed of 133 places in 1216 ms of which 12 ms to minimize.
[2024-05-23 06:17:52] [INFO ] Deduced a trap composed of 147 places in 1184 ms of which 10 ms to minimize.
[2024-05-23 06:17:53] [INFO ] Deduced a trap composed of 17 places in 1258 ms of which 18 ms to minimize.
[2024-05-23 06:17:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-23 06:17:54] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 06:17:54] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:17:54] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2024-05-23 06:17:55] [INFO ] [Real]Added 479 Read/Feed constraints in 160 ms returned sat
[2024-05-23 06:17:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 06:17:55] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:56] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2024-05-23 06:17:56] [INFO ] [Nat]Added 479 Read/Feed constraints in 85 ms returned sat
[2024-05-23 06:17:56] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 484 ms.
[2024-05-23 06:17:57] [INFO ] Added : 2 causal constraints over 1 iterations in 808 ms. Result :sat
Minimization took 581 ms.
[2024-05-23 06:17:57] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 06:17:57] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 06:17:58] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2024-05-23 06:17:58] [INFO ] [Real]Added 479 Read/Feed constraints in 176 ms returned sat
[2024-05-23 06:17:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:17:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 06:17:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:17:59] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2024-05-23 06:18:00] [INFO ] [Nat]Added 479 Read/Feed constraints in 119 ms returned sat
[2024-05-23 06:18:00] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 443 ms.
[2024-05-23 06:18:00] [INFO ] Added : 2 causal constraints over 1 iterations in 776 ms. Result :sat
Minimization took 600 ms.
[2024-05-23 06:18:01] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:18:01] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:18:02] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2024-05-23 06:18:02] [INFO ] [Real]Added 479 Read/Feed constraints in 163 ms returned sat
[2024-05-23 06:18:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 06:18:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 06:18:03] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2024-05-23 06:18:03] [INFO ] [Nat]Added 479 Read/Feed constraints in 94 ms returned sat
[2024-05-23 06:18:04] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 469 ms.
[2024-05-23 06:18:04] [INFO ] Added : 0 causal constraints over 0 iterations in 692 ms. Result :sat
Minimization took 583 ms.
[2024-05-23 06:18:05] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:18:05] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:18:06] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2024-05-23 06:18:06] [INFO ] [Real]Added 479 Read/Feed constraints in 119 ms returned sat
[2024-05-23 06:18:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-23 06:18:06] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 06:18:07] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2024-05-23 06:18:07] [INFO ] [Nat]Added 479 Read/Feed constraints in 103 ms returned sat
[2024-05-23 06:18:07] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 428 ms.
[2024-05-23 06:18:09] [INFO ] Deduced a trap composed of 142 places in 1264 ms of which 12 ms to minimize.
[2024-05-23 06:18:10] [INFO ] Deduced a trap composed of 136 places in 1202 ms of which 10 ms to minimize.
[2024-05-23 06:18:12] [INFO ] Deduced a trap composed of 134 places in 1125 ms of which 12 ms to minimize.
[2024-05-23 06:18:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, 1, +inf, 32, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, 1, +inf, 32, +inf]
Support contains 12 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 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.15 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 679 place count 1123 transition count 3303
Iterating global reduction 1 with 299 rules applied. Total rules applied 978 place count 1123 transition count 3303
Ensure Unique test removed 356 transitions
Reduce isomorphic transitions removed 356 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 1334 place count 1123 transition count 2947
Discarding 156 places :
Symmetric choice reduction at 2 with 156 rule applications. Total rules 1490 place count 967 transition count 2635
Iterating global reduction 2 with 156 rules applied. Total rules applied 1646 place count 967 transition count 2635
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1714 place count 967 transition count 2567
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1728 place count 953 transition count 2539
Iterating global reduction 3 with 14 rules applied. Total rules applied 1742 place count 953 transition count 2539
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1756 place count 939 transition count 2511
Iterating global reduction 3 with 14 rules applied. Total rules applied 1770 place count 939 transition count 2511
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1784 place count 925 transition count 2483
Iterating global reduction 3 with 14 rules applied. Total rules applied 1798 place count 925 transition count 2483
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1812 place count 911 transition count 2455
Iterating global reduction 3 with 14 rules applied. Total rules applied 1826 place count 911 transition count 2455
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1840 place count 897 transition count 2427
Iterating global reduction 3 with 14 rules applied. Total rules applied 1854 place count 897 transition count 2427
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1867 place count 884 transition count 2401
Iterating global reduction 3 with 13 rules applied. Total rules applied 1880 place count 884 transition count 2401
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1893 place count 871 transition count 2375
Iterating global reduction 3 with 13 rules applied. Total rules applied 1906 place count 871 transition count 2375
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1960 place count 817 transition count 2173
Iterating global reduction 3 with 54 rules applied. Total rules applied 2014 place count 817 transition count 2173
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 2073 place count 758 transition count 1937
Iterating global reduction 3 with 59 rules applied. Total rules applied 2132 place count 758 transition count 1937
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2190 place count 700 transition count 1797
Iterating global reduction 3 with 58 rules applied. Total rules applied 2248 place count 700 transition count 1797
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 2306 place count 642 transition count 1681
Iterating global reduction 3 with 58 rules applied. Total rules applied 2364 place count 642 transition count 1681
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2421 place count 585 transition count 1567
Iterating global reduction 3 with 57 rules applied. Total rules applied 2478 place count 585 transition count 1567
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 2535 place count 528 transition count 1453
Iterating global reduction 3 with 57 rules applied. Total rules applied 2592 place count 528 transition count 1453
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2648 place count 472 transition count 1341
Iterating global reduction 3 with 56 rules applied. Total rules applied 2704 place count 472 transition count 1341
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 2716 place count 460 transition count 1317
Iterating global reduction 3 with 12 rules applied. Total rules applied 2728 place count 460 transition count 1317
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 2738 place count 460 transition count 1307
Applied a total of 2738 rules in 1093 ms. Remains 460 /1628 variables (removed 1168) and now considering 1307/5962 (removed 4655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1109 ms. Remains : 460/1628 places, 1307/5962 transitions.
[2024-05-23 06:18:13] [INFO ] Flow matrix only has 756 transitions (discarded 551 similar events)
Found an invariant !
This invariant on transitions {210=1, 335=1, 539=1, 742=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 377=1, 709=1, 750=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 12) seen :[1, 1, 1, 4, 2, 0, 2, 1, 1, 3, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 1, 4, 2, 1, 2, 1, 1, 3, 1, 0] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, 1, +inf, 32, +inf]
[2024-05-23 06:18:13] [INFO ] Flow matrix only has 756 transitions (discarded 551 similar events)
// Phase 1: matrix 756 rows 460 cols
[2024-05-23 06:18:13] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 4, 2, 1, 2, 1, 1, 3, 1, 0] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, 1, +inf, 32, +inf]
FORMULA FunctionPointer-PT-c032-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000003 steps (2 resets) in 2296 ms. (435 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 12482 ms. (881 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1, 2, 71, 181, 145, 63, 17, 195, 3, 134] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
[2024-05-23 06:18:28] [INFO ] Flow matrix only has 756 transitions (discarded 551 similar events)
[2024-05-23 06:18:28] [INFO ] Invariant cache hit.
[2024-05-23 06:18:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:28] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2024-05-23 06:18:28] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-23 06:18:28] [INFO ] [Real]Added 94 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:18:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:29] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-23 06:18:29] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:18:29] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 71 ms.
[2024-05-23 06:18:29] [INFO ] Added : 1 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 340 ms.
[2024-05-23 06:18:29] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:18:29] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:18:29] [INFO ] [Real]Added 94 Read/Feed constraints in 30 ms returned sat
[2024-05-23 06:18:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:30] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:18:30] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 06:18:30] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 73 ms.
[2024-05-23 06:18:30] [INFO ] Added : 0 causal constraints over 0 iterations in 139 ms. Result :sat
Minimization took 312 ms.
[2024-05-23 06:18:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:30] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:18:30] [INFO ] [Real]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:31] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 06:18:31] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:18:31] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 75 ms.
[2024-05-23 06:18:31] [INFO ] Added : 1 causal constraints over 1 iterations in 184 ms. Result :sat
Minimization took 304 ms.
[2024-05-23 06:18:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:31] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 06:18:32] [INFO ] [Real]Added 94 Read/Feed constraints in 47 ms returned sat
[2024-05-23 06:18:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:32] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:18:32] [INFO ] [Nat]Added 94 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:18:32] [INFO ] Deduced a trap composed of 95 places in 213 ms of which 3 ms to minimize.
[2024-05-23 06:18:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2024-05-23 06:18:32] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 68 ms.
[2024-05-23 06:18:32] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 284 ms.
[2024-05-23 06:18:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:33] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:18:33] [INFO ] [Real]Added 94 Read/Feed constraints in 56 ms returned sat
[2024-05-23 06:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:33] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:18:33] [INFO ] [Nat]Added 94 Read/Feed constraints in 38 ms returned sat
[2024-05-23 06:18:33] [INFO ] Deduced a trap composed of 95 places in 213 ms of which 3 ms to minimize.
[2024-05-23 06:18:34] [INFO ] Deduced a trap composed of 88 places in 214 ms of which 3 ms to minimize.
[2024-05-23 06:18:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 504 ms
[2024-05-23 06:18:34] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 78 ms.
[2024-05-23 06:18:34] [INFO ] Added : 1 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 283 ms.
[2024-05-23 06:18:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:34] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:18:34] [INFO ] [Real]Added 94 Read/Feed constraints in 33 ms returned sat
[2024-05-23 06:18:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-23 06:18:35] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:18:35] [INFO ] [Nat]Added 94 Read/Feed constraints in 24 ms returned sat
[2024-05-23 06:18:35] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 66 ms.
[2024-05-23 06:18:35] [INFO ] Added : 9 causal constraints over 3 iterations in 244 ms. Result :sat
Minimization took 281 ms.
[2024-05-23 06:18:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:35] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 06:18:36] [INFO ] [Real]Added 94 Read/Feed constraints in 43 ms returned sat
[2024-05-23 06:18:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:36] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 06:18:36] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-05-23 06:18:36] [INFO ] Deduced a trap composed of 95 places in 218 ms of which 3 ms to minimize.
[2024-05-23 06:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2024-05-23 06:18:36] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 66 ms.
[2024-05-23 06:18:36] [INFO ] Added : 13 causal constraints over 4 iterations in 275 ms. Result :sat
Minimization took 310 ms.
[2024-05-23 06:18:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:37] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 06:18:37] [INFO ] [Real]Added 94 Read/Feed constraints in 31 ms returned sat
[2024-05-23 06:18:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:37] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-23 06:18:37] [INFO ] [Nat]Added 94 Read/Feed constraints in 67 ms returned sat
[2024-05-23 06:18:38] [INFO ] Deduced a trap composed of 127 places in 211 ms of which 3 ms to minimize.
[2024-05-23 06:18:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-23 06:18:38] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 70 ms.
[2024-05-23 06:18:38] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 325 ms.
[2024-05-23 06:18:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:38] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-23 06:18:38] [INFO ] [Real]Added 94 Read/Feed constraints in 48 ms returned sat
[2024-05-23 06:18:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:39] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 06:18:39] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:18:39] [INFO ] Deduced a trap composed of 95 places in 216 ms of which 3 ms to minimize.
[2024-05-23 06:18:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-05-23 06:18:39] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 68 ms.
[2024-05-23 06:18:39] [INFO ] Added : 9 causal constraints over 3 iterations in 237 ms. Result :sat
Minimization took 297 ms.
[2024-05-23 06:18:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:40] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:18:40] [INFO ] [Real]Added 94 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:18:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:40] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 06:18:40] [INFO ] [Nat]Added 94 Read/Feed constraints in 29 ms returned sat
[2024-05-23 06:18:40] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 77 ms.
[2024-05-23 06:18:40] [INFO ] Added : 0 causal constraints over 0 iterations in 134 ms. Result :sat
Minimization took 291 ms.
[2024-05-23 06:18:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:41] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:18:41] [INFO ] [Real]Added 94 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:18:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:41] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 06:18:41] [INFO ] [Nat]Added 94 Read/Feed constraints in 32 ms returned sat
[2024-05-23 06:18:41] [INFO ] Computed and/alt/rep : 101/217/96 causal constraints (skipped 658 transitions) in 75 ms.
[2024-05-23 06:18:41] [INFO ] Added : 15 causal constraints over 5 iterations in 320 ms. Result :sat
Minimization took 312 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1, 2, 71, 181, 145, 63, 17, 195, 3, 134] Max Struct:[32, 32, 32, +inf, +inf, +inf, +inf, +inf, +inf, 32, +inf]
FORMULA FunctionPointer-PT-c032-UpperBounds-14 32 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FunctionPointer-PT-c032-UpperBounds-02 32 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 31, 71, 181, 145, 63, 17, 195, 134] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1307/1307 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 459 transition count 1305
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 459 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 458 transition count 1303
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 458 transition count 1303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 457 transition count 1301
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 457 transition count 1301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 456 transition count 1299
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 456 transition count 1299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 455 transition count 1297
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 455 transition count 1297
Applied a total of 10 rules in 106 ms. Remains 455 /460 variables (removed 5) and now considering 1297/1307 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 455/460 places, 1297/1307 transitions.
[2024-05-23 06:18:43] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :[1, 0, 4, 3, 2, 0, 4, 2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 31, 71, 181, 145, 63, 17, 195, 134] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:18:44] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:18:44] [INFO ] Computed 3 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[30, 31, 71, 181, 145, 63, 17, 195, 134] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2317 ms. (431 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 10153 ms. (886 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 31, 151, 181, 145, 63, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:18:56] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:18:56] [INFO ] Invariant cache hit.
[2024-05-23 06:18:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:56] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:18:56] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:18:56] [INFO ] [Real]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 06:18:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:57] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:18:57] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:18:57] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-23 06:18:57] [INFO ] Added : 1 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 314 ms.
[2024-05-23 06:18:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:57] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:18:57] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:18:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:58] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 06:18:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:18:58] [INFO ] Deduced a trap composed of 126 places in 213 ms of which 3 ms to minimize.
[2024-05-23 06:18:58] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 3 ms to minimize.
[2024-05-23 06:18:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2024-05-23 06:18:58] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:18:58] [INFO ] Added : 1 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 302 ms.
[2024-05-23 06:18:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:18:59] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 06:18:59] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-23 06:18:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:18:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:18:59] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:18:59] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:18:59] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 77 ms.
[2024-05-23 06:18:59] [INFO ] Added : 1 causal constraints over 1 iterations in 179 ms. Result :sat
Minimization took 254 ms.
[2024-05-23 06:19:00] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:19:00] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 06:19:00] [INFO ] [Real]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-23 06:19:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:19:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:00] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:19:00] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-23 06:19:00] [INFO ] Deduced a trap composed of 169 places in 196 ms of which 4 ms to minimize.
[2024-05-23 06:19:01] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:19:01] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 2 ms to minimize.
[2024-05-23 06:19:01] [INFO ] Deduced a trap composed of 141 places in 189 ms of which 3 ms to minimize.
[2024-05-23 06:19:01] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 3 ms to minimize.
[2024-05-23 06:19:01] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:19:02] [INFO ] Deduced a trap composed of 172 places in 212 ms of which 3 ms to minimize.
[2024-05-23 06:19:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1563 ms
[2024-05-23 06:19:02] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 71 ms.
[2024-05-23 06:19:02] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 266 ms.
[2024-05-23 06:19:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:02] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 06:19:02] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 06:19:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:19:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:03] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:19:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-23 06:19:03] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 3 ms to minimize.
[2024-05-23 06:19:03] [INFO ] Deduced a trap composed of 172 places in 211 ms of which 3 ms to minimize.
[2024-05-23 06:19:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 500 ms
[2024-05-23 06:19:03] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 68 ms.
[2024-05-23 06:19:03] [INFO ] Added : 13 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 277 ms.
[2024-05-23 06:19:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:04] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:19:04] [INFO ] [Real]Added 91 Read/Feed constraints in 56 ms returned sat
[2024-05-23 06:19:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:19:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:04] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-23 06:19:04] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:19:05] [INFO ] Deduced a trap composed of 178 places in 230 ms of which 3 ms to minimize.
[2024-05-23 06:19:05] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:19:05] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 4 ms to minimize.
[2024-05-23 06:19:05] [INFO ] Deduced a trap composed of 147 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:19:06] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:19:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1194 ms
[2024-05-23 06:19:06] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-23 06:19:06] [INFO ] Added : 11 causal constraints over 4 iterations in 271 ms. Result :sat
Minimization took 304 ms.
[2024-05-23 06:19:06] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:19:06] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:19:06] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 06:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:19:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:07] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 06:19:07] [INFO ] [Nat]Added 91 Read/Feed constraints in 54 ms returned sat
[2024-05-23 06:19:07] [INFO ] Deduced a trap composed of 206 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:19:07] [INFO ] Deduced a trap composed of 172 places in 207 ms of which 3 ms to minimize.
[2024-05-23 06:19:07] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:19:08] [INFO ] Deduced a trap composed of 152 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:19:08] [INFO ] Deduced a trap composed of 143 places in 200 ms of which 4 ms to minimize.
[2024-05-23 06:19:08] [INFO ] Deduced a trap composed of 134 places in 207 ms of which 7 ms to minimize.
[2024-05-23 06:19:08] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:19:09] [INFO ] Deduced a trap composed of 91 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:19:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1866 ms
[2024-05-23 06:19:09] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 78 ms.
[2024-05-23 06:19:09] [INFO ] Added : 2 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 308 ms.
[2024-05-23 06:19:09] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:09] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 06:19:09] [INFO ] [Real]Added 91 Read/Feed constraints in 46 ms returned sat
[2024-05-23 06:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:19:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:10] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:19:10] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:19:10] [INFO ] Deduced a trap composed of 178 places in 193 ms of which 3 ms to minimize.
[2024-05-23 06:19:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-23 06:19:10] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-23 06:19:10] [INFO ] Added : 11 causal constraints over 4 iterations in 275 ms. Result :sat
Minimization took 290 ms.
[2024-05-23 06:19:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:19:11] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:19:11] [INFO ] [Real]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-23 06:19:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:19:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:19:11] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:19:11] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:19:11] [INFO ] Deduced a trap composed of 178 places in 199 ms of which 2 ms to minimize.
[2024-05-23 06:19:12] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 2 ms to minimize.
[2024-05-23 06:19:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 467 ms
[2024-05-23 06:19:12] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 74 ms.
[2024-05-23 06:19:12] [INFO ] Added : 11 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 31, 151, 181, 145, 63, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 31, 151, 181, 145, 63, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 52 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 52 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:19:14] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:19:14] [INFO ] Invariant cache hit.
[2024-05-23 06:19:15] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-23 06:19:15] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:19:15] [INFO ] Invariant cache hit.
[2024-05-23 06:19:15] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:19:16] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
[2024-05-23 06:19:16] [INFO ] Redundant transitions in 74 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:19:16] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:19:16] [INFO ] Invariant cache hit.
[2024-05-23 06:19:16] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:19:33] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64808ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64836ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66790 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:20:21] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :[0, 1, 0, 0, 3, 2, 0, 2, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 31, 151, 181, 145, 63, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:20:21] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:20:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 31, 151, 181, 145, 63, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000004 steps (2 resets) in 2258 ms. (442 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 10295 ms. (874 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 31, 151, 181, 212, 89, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:20:34] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:20:34] [INFO ] Invariant cache hit.
[2024-05-23 06:20:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:20:34] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:20:34] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:20:34] [INFO ] [Real]Added 91 Read/Feed constraints in 59 ms returned sat
[2024-05-23 06:20:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:35] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 06:20:35] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:20:35] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 77 ms.
[2024-05-23 06:20:35] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 273 ms.
[2024-05-23 06:20:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:35] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-23 06:20:35] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-23 06:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:36] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:20:36] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:20:36] [INFO ] Deduced a trap composed of 126 places in 187 ms of which 3 ms to minimize.
[2024-05-23 06:20:36] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 3 ms to minimize.
[2024-05-23 06:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2024-05-23 06:20:36] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:20:36] [INFO ] Added : 1 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 299 ms.
[2024-05-23 06:20:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:37] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-23 06:20:37] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:20:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:37] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 06:20:37] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:20:37] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-23 06:20:37] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 269 ms.
[2024-05-23 06:20:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:38] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:20:38] [INFO ] [Real]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:20:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:20:38] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:20:38] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 06:20:38] [INFO ] Deduced a trap composed of 169 places in 197 ms of which 3 ms to minimize.
[2024-05-23 06:20:39] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 3 ms to minimize.
[2024-05-23 06:20:39] [INFO ] Deduced a trap composed of 143 places in 189 ms of which 3 ms to minimize.
[2024-05-23 06:20:39] [INFO ] Deduced a trap composed of 141 places in 201 ms of which 6 ms to minimize.
[2024-05-23 06:20:39] [INFO ] Deduced a trap composed of 138 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:20:39] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 3 ms to minimize.
[2024-05-23 06:20:40] [INFO ] Deduced a trap composed of 172 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:20:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1552 ms
[2024-05-23 06:20:40] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:20:40] [INFO ] Added : 1 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 307 ms.
[2024-05-23 06:20:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:40] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 06:20:40] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 06:20:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:41] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 06:20:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-23 06:20:41] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 4 ms to minimize.
[2024-05-23 06:20:41] [INFO ] Deduced a trap composed of 172 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:20:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
[2024-05-23 06:20:41] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 75 ms.
[2024-05-23 06:20:41] [INFO ] Added : 13 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 279 ms.
[2024-05-23 06:20:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:20:42] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 06:20:42] [INFO ] [Real]Added 91 Read/Feed constraints in 61 ms returned sat
[2024-05-23 06:20:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:42] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:20:42] [INFO ] [Nat]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:20:43] [INFO ] Deduced a trap composed of 178 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:20:43] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:20:43] [INFO ] Deduced a trap composed of 159 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:20:43] [INFO ] Deduced a trap composed of 147 places in 205 ms of which 5 ms to minimize.
[2024-05-23 06:20:43] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 5 ms to minimize.
[2024-05-23 06:20:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1153 ms
[2024-05-23 06:20:44] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-23 06:20:44] [INFO ] Added : 11 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 268 ms.
[2024-05-23 06:20:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:20:44] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 06:20:44] [INFO ] [Real]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-23 06:20:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:45] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 06:20:45] [INFO ] [Nat]Added 91 Read/Feed constraints in 49 ms returned sat
[2024-05-23 06:20:45] [INFO ] Deduced a trap composed of 206 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:20:45] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 2 ms to minimize.
[2024-05-23 06:20:45] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:20:46] [INFO ] Deduced a trap composed of 152 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:20:46] [INFO ] Deduced a trap composed of 143 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:20:46] [INFO ] Deduced a trap composed of 134 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:20:46] [INFO ] Deduced a trap composed of 131 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:20:46] [INFO ] Deduced a trap composed of 91 places in 219 ms of which 3 ms to minimize.
[2024-05-23 06:20:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1859 ms
[2024-05-23 06:20:47] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:20:47] [INFO ] Added : 2 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 322 ms.
[2024-05-23 06:20:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:20:47] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:20:47] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-23 06:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:20:48] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:20:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:20:48] [INFO ] Deduced a trap composed of 178 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:20:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2024-05-23 06:20:48] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:20:48] [INFO ] Added : 11 causal constraints over 4 iterations in 262 ms. Result :sat
Minimization took 307 ms.
[2024-05-23 06:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:20:49] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 06:20:49] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:20:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:20:49] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:20:49] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:20:49] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 4 ms to minimize.
[2024-05-23 06:20:49] [INFO ] Deduced a trap composed of 178 places in 191 ms of which 4 ms to minimize.
[2024-05-23 06:20:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 463 ms
[2024-05-23 06:20:50] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-23 06:20:50] [INFO ] Added : 11 causal constraints over 4 iterations in 249 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 31, 151, 181, 212, 89, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 31, 151, 181, 212, 89, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 47 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 45 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:20:52] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:20:52] [INFO ] Invariant cache hit.
[2024-05-23 06:20:53] [INFO ] Implicit Places using invariants in 411 ms returned []
[2024-05-23 06:20:53] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:20:53] [INFO ] Invariant cache hit.
[2024-05-23 06:20:53] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:20:54] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2024-05-23 06:20:54] [INFO ] Redundant transitions in 28 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:20:54] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:20:54] [INFO ] Invariant cache hit.
[2024-05-23 06:20:54] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:21:11] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64634ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64645ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66596 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:21:59] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :[1, 1, 3, 3, 2, 2, 0, 1, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 31, 151, 181, 212, 89, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:21:59] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:21:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 31, 151, 181, 212, 89, 17, 195, 145] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2186 ms. (457 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 9530 ms. (944 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 31, 191, 181, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:22:11] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:22:11] [INFO ] Invariant cache hit.
[2024-05-23 06:22:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:22:11] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:22:11] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:22:11] [INFO ] [Real]Added 91 Read/Feed constraints in 56 ms returned sat
[2024-05-23 06:22:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:22:12] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 06:22:12] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:22:12] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-23 06:22:12] [INFO ] Added : 1 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 257 ms.
[2024-05-23 06:22:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:22:12] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:22:12] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:22:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:22:13] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-23 06:22:13] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:22:13] [INFO ] Deduced a trap composed of 126 places in 215 ms of which 3 ms to minimize.
[2024-05-23 06:22:13] [INFO ] Deduced a trap composed of 131 places in 183 ms of which 3 ms to minimize.
[2024-05-23 06:22:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2024-05-23 06:22:13] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 63 ms.
[2024-05-23 06:22:13] [INFO ] Added : 1 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 256 ms.
[2024-05-23 06:22:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:14] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:22:14] [INFO ] [Real]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:22:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:22:14] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:22:14] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 06:22:14] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-23 06:22:14] [INFO ] Added : 1 causal constraints over 1 iterations in 153 ms. Result :sat
Minimization took 244 ms.
[2024-05-23 06:22:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:22:15] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 06:22:15] [INFO ] [Real]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 06:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:22:15] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-23 06:22:15] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-23 06:22:15] [INFO ] Deduced a trap composed of 169 places in 210 ms of which 2 ms to minimize.
[2024-05-23 06:22:16] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 3 ms to minimize.
[2024-05-23 06:22:16] [INFO ] Deduced a trap composed of 143 places in 243 ms of which 3 ms to minimize.
[2024-05-23 06:22:16] [INFO ] Deduced a trap composed of 141 places in 212 ms of which 2 ms to minimize.
[2024-05-23 06:22:16] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-23 06:22:17] [INFO ] Deduced a trap composed of 137 places in 216 ms of which 3 ms to minimize.
[2024-05-23 06:22:17] [INFO ] Deduced a trap composed of 172 places in 216 ms of which 3 ms to minimize.
[2024-05-23 06:22:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1703 ms
[2024-05-23 06:22:17] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 63 ms.
[2024-05-23 06:22:17] [INFO ] Added : 1 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 318 ms.
[2024-05-23 06:22:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:22:18] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-23 06:22:18] [INFO ] [Real]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:22:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:18] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:22:18] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-23 06:22:18] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:22:18] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 3 ms to minimize.
[2024-05-23 06:22:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 500 ms
[2024-05-23 06:22:18] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-23 06:22:19] [INFO ] Added : 13 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 313 ms.
[2024-05-23 06:22:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:19] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:22:19] [INFO ] [Real]Added 91 Read/Feed constraints in 60 ms returned sat
[2024-05-23 06:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:20] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:22:20] [INFO ] [Nat]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:22:20] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 3 ms to minimize.
[2024-05-23 06:22:20] [INFO ] Deduced a trap composed of 161 places in 200 ms of which 2 ms to minimize.
[2024-05-23 06:22:20] [INFO ] Deduced a trap composed of 159 places in 183 ms of which 2 ms to minimize.
[2024-05-23 06:22:20] [INFO ] Deduced a trap composed of 147 places in 188 ms of which 3 ms to minimize.
[2024-05-23 06:22:21] [INFO ] Deduced a trap composed of 137 places in 182 ms of which 3 ms to minimize.
[2024-05-23 06:22:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1107 ms
[2024-05-23 06:22:21] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 79 ms.
[2024-05-23 06:22:21] [INFO ] Added : 11 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 317 ms.
[2024-05-23 06:22:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:22] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 06:22:22] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 06:22:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:22] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:22:22] [INFO ] [Nat]Added 91 Read/Feed constraints in 56 ms returned sat
[2024-05-23 06:22:22] [INFO ] Deduced a trap composed of 206 places in 191 ms of which 3 ms to minimize.
[2024-05-23 06:22:22] [INFO ] Deduced a trap composed of 172 places in 186 ms of which 3 ms to minimize.
[2024-05-23 06:22:23] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 2 ms to minimize.
[2024-05-23 06:22:23] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:22:23] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 3 ms to minimize.
[2024-05-23 06:22:23] [INFO ] Deduced a trap composed of 134 places in 188 ms of which 3 ms to minimize.
[2024-05-23 06:22:23] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 3 ms to minimize.
[2024-05-23 06:22:24] [INFO ] Deduced a trap composed of 91 places in 193 ms of which 3 ms to minimize.
[2024-05-23 06:22:24] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1779 ms
[2024-05-23 06:22:24] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-23 06:22:24] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 328 ms.
[2024-05-23 06:22:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:24] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:22:24] [INFO ] [Real]Added 91 Read/Feed constraints in 48 ms returned sat
[2024-05-23 06:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:25] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:22:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:22:25] [INFO ] Deduced a trap composed of 178 places in 197 ms of which 3 ms to minimize.
[2024-05-23 06:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-05-23 06:22:25] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-23 06:22:25] [INFO ] Added : 11 causal constraints over 4 iterations in 261 ms. Result :sat
Minimization took 251 ms.
[2024-05-23 06:22:26] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:26] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:22:26] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-23 06:22:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:22:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:22:26] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:22:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-23 06:22:26] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:22:27] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 4 ms to minimize.
[2024-05-23 06:22:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 473 ms
[2024-05-23 06:22:27] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 68 ms.
[2024-05-23 06:22:27] [INFO ] Added : 11 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 311 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 31, 191, 181, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 31, 191, 181, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 50 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 46 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:22:30] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:22:30] [INFO ] Invariant cache hit.
[2024-05-23 06:22:31] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-23 06:22:31] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:22:31] [INFO ] Invariant cache hit.
[2024-05-23 06:22:31] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:22:32] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
[2024-05-23 06:22:32] [INFO ] Redundant transitions in 17 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:22:32] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:22:32] [INFO ] Invariant cache hit.
[2024-05-23 06:22:32] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:22:48] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64693ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64707ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66506 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:23:37] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :[2, 1, 2, 2, 2, 1, 0, 4, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 31, 191, 181, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:23:37] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:23:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 31, 191, 181, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2337 ms. (427 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 10172 ms. (884 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 31, 266, 186, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:23:50] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:23:50] [INFO ] Invariant cache hit.
[2024-05-23 06:23:50] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:23:50] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:23:50] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:23:50] [INFO ] [Real]Added 91 Read/Feed constraints in 60 ms returned sat
[2024-05-23 06:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:23:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:23:50] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 06:23:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:23:51] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-23 06:23:51] [INFO ] Added : 1 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 271 ms.
[2024-05-23 06:23:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:23:51] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-23 06:23:51] [INFO ] [Real]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-23 06:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:23:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:23:51] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:23:51] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:23:52] [INFO ] Deduced a trap composed of 126 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:23:52] [INFO ] Deduced a trap composed of 131 places in 178 ms of which 3 ms to minimize.
[2024-05-23 06:23:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 460 ms
[2024-05-23 06:23:52] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 74 ms.
[2024-05-23 06:23:52] [INFO ] Added : 1 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 272 ms.
[2024-05-23 06:23:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:23:53] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:23:53] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:23:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:23:53] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 06:23:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:23:53] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 93 ms.
[2024-05-23 06:23:53] [INFO ] Added : 1 causal constraints over 1 iterations in 188 ms. Result :sat
Minimization took 261 ms.
[2024-05-23 06:23:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:23:54] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:23:54] [INFO ] [Real]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:23:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:23:54] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:23:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 06:23:54] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:23:54] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 4 ms to minimize.
[2024-05-23 06:23:55] [INFO ] Deduced a trap composed of 143 places in 185 ms of which 3 ms to minimize.
[2024-05-23 06:23:55] [INFO ] Deduced a trap composed of 141 places in 193 ms of which 3 ms to minimize.
[2024-05-23 06:23:55] [INFO ] Deduced a trap composed of 138 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:23:55] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:23:56] [INFO ] Deduced a trap composed of 172 places in 207 ms of which 3 ms to minimize.
[2024-05-23 06:23:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1605 ms
[2024-05-23 06:23:56] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 71 ms.
[2024-05-23 06:23:56] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 301 ms.
[2024-05-23 06:23:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:23:56] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 06:23:56] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 06:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:23:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:23:57] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 06:23:57] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-23 06:23:57] [INFO ] Deduced a trap composed of 178 places in 215 ms of which 3 ms to minimize.
[2024-05-23 06:23:57] [INFO ] Deduced a trap composed of 172 places in 207 ms of which 5 ms to minimize.
[2024-05-23 06:23:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 491 ms
[2024-05-23 06:23:57] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-23 06:23:57] [INFO ] Added : 13 causal constraints over 4 iterations in 288 ms. Result :sat
Minimization took 272 ms.
[2024-05-23 06:23:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:23:58] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 06:23:58] [INFO ] [Real]Added 91 Read/Feed constraints in 62 ms returned sat
[2024-05-23 06:23:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:23:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:23:58] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:23:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:23:58] [INFO ] Deduced a trap composed of 178 places in 211 ms of which 3 ms to minimize.
[2024-05-23 06:23:59] [INFO ] Deduced a trap composed of 161 places in 226 ms of which 3 ms to minimize.
[2024-05-23 06:23:59] [INFO ] Deduced a trap composed of 159 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:23:59] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 3 ms to minimize.
[2024-05-23 06:23:59] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 2 ms to minimize.
[2024-05-23 06:23:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1176 ms
[2024-05-23 06:24:00] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-23 06:24:00] [INFO ] Added : 11 causal constraints over 4 iterations in 267 ms. Result :sat
Minimization took 274 ms.
[2024-05-23 06:24:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:24:00] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:24:00] [INFO ] [Real]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-23 06:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:24:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:24:01] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 06:24:01] [INFO ] [Nat]Added 91 Read/Feed constraints in 50 ms returned sat
[2024-05-23 06:24:01] [INFO ] Deduced a trap composed of 206 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:24:01] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 3 ms to minimize.
[2024-05-23 06:24:01] [INFO ] Deduced a trap composed of 170 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:24:01] [INFO ] Deduced a trap composed of 152 places in 198 ms of which 3 ms to minimize.
[2024-05-23 06:24:02] [INFO ] Deduced a trap composed of 143 places in 197 ms of which 3 ms to minimize.
[2024-05-23 06:24:02] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:24:02] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 3 ms to minimize.
[2024-05-23 06:24:02] [INFO ] Deduced a trap composed of 91 places in 191 ms of which 3 ms to minimize.
[2024-05-23 06:24:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1815 ms
[2024-05-23 06:24:02] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-23 06:24:03] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 320 ms.
[2024-05-23 06:24:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:24:03] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:24:03] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-23 06:24:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:24:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:24:03] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 06:24:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:24:04] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-05-23 06:24:04] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 78 ms.
[2024-05-23 06:24:04] [INFO ] Added : 11 causal constraints over 4 iterations in 273 ms. Result :sat
Minimization took 269 ms.
[2024-05-23 06:24:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:24:05] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-23 06:24:05] [INFO ] [Real]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-23 06:24:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:24:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:24:05] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:24:05] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:24:05] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:24:05] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 3 ms to minimize.
[2024-05-23 06:24:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2024-05-23 06:24:05] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-23 06:24:06] [INFO ] Added : 11 causal constraints over 4 iterations in 264 ms. Result :sat
Minimization took 310 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 31, 266, 186, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 31, 266, 186, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 50 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 47 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:24:09] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:24:09] [INFO ] Invariant cache hit.
[2024-05-23 06:24:10] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-23 06:24:10] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:24:10] [INFO ] Invariant cache hit.
[2024-05-23 06:24:10] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:24:11] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
[2024-05-23 06:24:11] [INFO ] Redundant transitions in 18 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:24:11] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:24:11] [INFO ] Invariant cache hit.
[2024-05-23 06:24:11] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:24:27] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64831ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64844ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66695 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:25:16] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :[2, 2, 2, 2, 2, 2, 2, 2, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 31, 266, 186, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:25:16] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:25:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 31, 266, 186, 212, 89, 17, 195, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2362 ms. (423 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 10527 ms. (854 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 31, 266, 186, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:25:29] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:25:29] [INFO ] Invariant cache hit.
[2024-05-23 06:25:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:29] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:25:29] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:25:29] [INFO ] [Real]Added 91 Read/Feed constraints in 55 ms returned sat
[2024-05-23 06:25:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-05-23 06:25:30] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2024-05-23 06:25:30] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:25:30] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:25:30] [INFO ] Added : 1 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 255 ms.
[2024-05-23 06:25:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:31] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:25:31] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-23 06:25:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:31] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:25:31] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:25:31] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 3 ms to minimize.
[2024-05-23 06:25:31] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 3 ms to minimize.
[2024-05-23 06:25:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 470 ms
[2024-05-23 06:25:31] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-23 06:25:32] [INFO ] Added : 1 causal constraints over 1 iterations in 152 ms. Result :sat
Minimization took 262 ms.
[2024-05-23 06:25:32] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:32] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-23 06:25:32] [INFO ] [Real]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:25:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:25:32] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:25:32] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:25:32] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-23 06:25:32] [INFO ] Added : 1 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 249 ms.
[2024-05-23 06:25:33] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:33] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 06:25:33] [INFO ] [Real]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-23 06:25:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:25:33] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-23 06:25:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-23 06:25:33] [INFO ] Deduced a trap composed of 169 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:25:34] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 3 ms to minimize.
[2024-05-23 06:25:34] [INFO ] Deduced a trap composed of 143 places in 191 ms of which 3 ms to minimize.
[2024-05-23 06:25:34] [INFO ] Deduced a trap composed of 141 places in 214 ms of which 3 ms to minimize.
[2024-05-23 06:25:34] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 3 ms to minimize.
[2024-05-23 06:25:35] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 2 ms to minimize.
[2024-05-23 06:25:35] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:25:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1616 ms
[2024-05-23 06:25:35] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:25:35] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 268 ms.
[2024-05-23 06:25:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:36] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:25:36] [INFO ] [Real]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:25:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:25:36] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:25:36] [INFO ] [Nat]Added 91 Read/Feed constraints in 22 ms returned sat
[2024-05-23 06:25:36] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:25:36] [INFO ] Deduced a trap composed of 172 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:25:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 477 ms
[2024-05-23 06:25:36] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-23 06:25:37] [INFO ] Added : 13 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 268 ms.
[2024-05-23 06:25:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:37] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 06:25:37] [INFO ] [Real]Added 91 Read/Feed constraints in 62 ms returned sat
[2024-05-23 06:25:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:25:37] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 06:25:38] [INFO ] [Nat]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:25:38] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 3 ms to minimize.
[2024-05-23 06:25:38] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:25:38] [INFO ] Deduced a trap composed of 159 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:25:38] [INFO ] Deduced a trap composed of 147 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:25:39] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 2 ms to minimize.
[2024-05-23 06:25:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1178 ms
[2024-05-23 06:25:39] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:25:39] [INFO ] Added : 11 causal constraints over 4 iterations in 266 ms. Result :sat
Minimization took 268 ms.
[2024-05-23 06:25:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:25:39] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-23 06:25:40] [INFO ] [Real]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-23 06:25:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:25:40] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:25:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 51 ms returned sat
[2024-05-23 06:25:40] [INFO ] Deduced a trap composed of 206 places in 208 ms of which 2 ms to minimize.
[2024-05-23 06:25:40] [INFO ] Deduced a trap composed of 172 places in 187 ms of which 4 ms to minimize.
[2024-05-23 06:25:41] [INFO ] Deduced a trap composed of 170 places in 222 ms of which 2 ms to minimize.
[2024-05-23 06:25:41] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:25:41] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 3 ms to minimize.
[2024-05-23 06:25:41] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 3 ms to minimize.
[2024-05-23 06:25:41] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:25:42] [INFO ] Deduced a trap composed of 91 places in 214 ms of which 3 ms to minimize.
[2024-05-23 06:25:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1876 ms
[2024-05-23 06:25:42] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 75 ms.
[2024-05-23 06:25:42] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 309 ms.
[2024-05-23 06:25:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:25:42] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 06:25:42] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-23 06:25:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:25:43] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:25:43] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:25:43] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 3 ms to minimize.
[2024-05-23 06:25:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-05-23 06:25:43] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 71 ms.
[2024-05-23 06:25:43] [INFO ] Added : 11 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 272 ms.
[2024-05-23 06:25:44] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:44] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:25:44] [INFO ] [Real]Added 91 Read/Feed constraints in 45 ms returned sat
[2024-05-23 06:25:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:25:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:25:44] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 06:25:44] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:25:44] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 3 ms to minimize.
[2024-05-23 06:25:45] [INFO ] Deduced a trap composed of 178 places in 194 ms of which 3 ms to minimize.
[2024-05-23 06:25:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2024-05-23 06:25:45] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-23 06:25:45] [INFO ] Added : 11 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 304 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 31, 266, 186, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[30, 31, 266, 186, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 56 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 50 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:25:49] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:25:49] [INFO ] Invariant cache hit.
[2024-05-23 06:25:49] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-23 06:25:49] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:25:49] [INFO ] Invariant cache hit.
[2024-05-23 06:25:49] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:25:50] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
[2024-05-23 06:25:50] [INFO ] Redundant transitions in 21 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:25:51] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:25:51] [INFO ] Invariant cache hit.
[2024-05-23 06:25:51] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:26:07] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64432ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66314 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:26:55] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 9) seen :[3, 1, 4, 6, 2, 3, 1, 3, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[30, 31, 266, 186, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:26:55] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:26:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[30, 31, 266, 186, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2263 ms. (441 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 10009 ms. (899 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[30, 31, 266, 192, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:27:08] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:27:08] [INFO ] Invariant cache hit.
[2024-05-23 06:27:08] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-23 06:27:08] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2024-05-23 06:27:08] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:27:08] [INFO ] [Real]Added 91 Read/Feed constraints in 59 ms returned sat
[2024-05-23 06:27:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-23 06:27:08] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-05-23 06:27:08] [INFO ] [Nat]Added 91 Read/Feed constraints in 46 ms returned sat
[2024-05-23 06:27:08] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-23 06:27:08] [INFO ] Added : 1 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 290 ms.
[2024-05-23 06:27:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:27:09] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-23 06:27:09] [INFO ] [Real]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-23 06:27:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:27:09] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:27:09] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:27:10] [INFO ] Deduced a trap composed of 126 places in 202 ms of which 4 ms to minimize.
[2024-05-23 06:27:10] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 3 ms to minimize.
[2024-05-23 06:27:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 473 ms
[2024-05-23 06:27:10] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 79 ms.
[2024-05-23 06:27:10] [INFO ] Added : 1 causal constraints over 1 iterations in 178 ms. Result :sat
Minimization took 290 ms.
[2024-05-23 06:27:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:11] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:27:11] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:27:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:11] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-23 06:27:11] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 06:27:11] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-23 06:27:11] [INFO ] Added : 1 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 281 ms.
[2024-05-23 06:27:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:12] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:27:12] [INFO ] [Real]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:27:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:12] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:27:12] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 06:27:12] [INFO ] Deduced a trap composed of 169 places in 215 ms of which 3 ms to minimize.
[2024-05-23 06:27:12] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:27:13] [INFO ] Deduced a trap composed of 143 places in 193 ms of which 3 ms to minimize.
[2024-05-23 06:27:13] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 4 ms to minimize.
[2024-05-23 06:27:13] [INFO ] Deduced a trap composed of 138 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:27:13] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:27:13] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:27:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1651 ms
[2024-05-23 06:27:14] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-23 06:27:14] [INFO ] Added : 1 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 296 ms.
[2024-05-23 06:27:14] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:27:14] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 06:27:14] [INFO ] [Real]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:27:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:15] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:27:15] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-23 06:27:15] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 3 ms to minimize.
[2024-05-23 06:27:15] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:27:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2024-05-23 06:27:15] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 72 ms.
[2024-05-23 06:27:15] [INFO ] Added : 13 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 274 ms.
[2024-05-23 06:27:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:16] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:27:16] [INFO ] [Real]Added 91 Read/Feed constraints in 61 ms returned sat
[2024-05-23 06:27:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:27:16] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:27:16] [INFO ] [Nat]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:27:16] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:27:17] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:27:17] [INFO ] Deduced a trap composed of 159 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:27:17] [INFO ] Deduced a trap composed of 147 places in 202 ms of which 3 ms to minimize.
[2024-05-23 06:27:17] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:27:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1177 ms
[2024-05-23 06:27:17] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:27:18] [INFO ] Added : 11 causal constraints over 4 iterations in 261 ms. Result :sat
Minimization took 298 ms.
[2024-05-23 06:27:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:27:18] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:27:18] [INFO ] [Real]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-23 06:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:18] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 06:27:19] [INFO ] [Nat]Added 91 Read/Feed constraints in 51 ms returned sat
[2024-05-23 06:27:19] [INFO ] Deduced a trap composed of 206 places in 210 ms of which 3 ms to minimize.
[2024-05-23 06:27:19] [INFO ] Deduced a trap composed of 172 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:27:19] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:27:19] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:27:20] [INFO ] Deduced a trap composed of 143 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:27:20] [INFO ] Deduced a trap composed of 134 places in 207 ms of which 3 ms to minimize.
[2024-05-23 06:27:20] [INFO ] Deduced a trap composed of 131 places in 207 ms of which 3 ms to minimize.
[2024-05-23 06:27:20] [INFO ] Deduced a trap composed of 91 places in 212 ms of which 3 ms to minimize.
[2024-05-23 06:27:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1894 ms
[2024-05-23 06:27:20] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-23 06:27:21] [INFO ] Added : 2 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 309 ms.
[2024-05-23 06:27:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:21] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:27:21] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-23 06:27:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:21] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:27:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:27:22] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 3 ms to minimize.
[2024-05-23 06:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2024-05-23 06:27:22] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-23 06:27:22] [INFO ] Added : 11 causal constraints over 4 iterations in 262 ms. Result :sat
Minimization took 298 ms.
[2024-05-23 06:27:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:23] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:27:23] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:27:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:27:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:27:23] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:27:23] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:27:23] [INFO ] Deduced a trap composed of 178 places in 207 ms of which 3 ms to minimize.
[2024-05-23 06:27:23] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:27:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2024-05-23 06:27:23] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 81 ms.
[2024-05-23 06:27:24] [INFO ] Added : 11 causal constraints over 4 iterations in 270 ms. Result :sat
Minimization took 292 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[30, 31, 266, 192, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31, 31, 266, 192, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 47 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 45 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:27:27] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:27:27] [INFO ] Invariant cache hit.
[2024-05-23 06:27:28] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 06:27:28] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:27:28] [INFO ] Invariant cache hit.
[2024-05-23 06:27:28] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:27:29] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2024-05-23 06:27:29] [INFO ] Redundant transitions in 22 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:27:29] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:27:29] [INFO ] Invariant cache hit.
[2024-05-23 06:27:29] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:27:46] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 65117ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 65129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66944 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:28:34] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :[1, 2, 6, 2, 3, 0, 0, 1, 3]
Current structural bounds on expressions (after cover walk) : Max Seen:[31, 31, 266, 192, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:28:35] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:28:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[31, 31, 266, 192, 212, 97, 17, 205, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2313 ms. (432 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 9907 ms. (908 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[31, 31, 266, 236, 212, 97, 17, 224, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:28:47] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:28:47] [INFO ] Invariant cache hit.
[2024-05-23 06:28:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:28:47] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:28:47] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:28:47] [INFO ] [Real]Added 91 Read/Feed constraints in 46 ms returned sat
[2024-05-23 06:28:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:28:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:28:47] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:28:47] [INFO ] [Nat]Added 91 Read/Feed constraints in 51 ms returned sat
[2024-05-23 06:28:47] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 78 ms.
[2024-05-23 06:28:48] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 271 ms.
[2024-05-23 06:28:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:28:48] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:28:48] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-23 06:28:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:28:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:28:48] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:28:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:28:49] [INFO ] Deduced a trap composed of 126 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:28:49] [INFO ] Deduced a trap composed of 131 places in 181 ms of which 3 ms to minimize.
[2024-05-23 06:28:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2024-05-23 06:28:49] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 72 ms.
[2024-05-23 06:28:49] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 312 ms.
[2024-05-23 06:28:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:28:50] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:28:50] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:28:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:28:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:28:50] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:28:50] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:28:50] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 77 ms.
[2024-05-23 06:28:50] [INFO ] Added : 1 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 302 ms.
[2024-05-23 06:28:51] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:28:51] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-23 06:28:51] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-23 06:28:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:28:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:28:51] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:28:51] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 06:28:51] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:28:51] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:28:52] [INFO ] Deduced a trap composed of 143 places in 198 ms of which 4 ms to minimize.
[2024-05-23 06:28:52] [INFO ] Deduced a trap composed of 141 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:28:52] [INFO ] Deduced a trap composed of 138 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:28:52] [INFO ] Deduced a trap composed of 137 places in 198 ms of which 2 ms to minimize.
[2024-05-23 06:28:53] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:28:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1655 ms
[2024-05-23 06:28:53] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 80 ms.
[2024-05-23 06:28:53] [INFO ] Added : 1 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 270 ms.
[2024-05-23 06:28:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:28:53] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 06:28:53] [INFO ] [Real]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-23 06:28:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:28:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:28:54] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:28:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-23 06:28:54] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 3 ms to minimize.
[2024-05-23 06:28:54] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:28:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 496 ms
[2024-05-23 06:28:54] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-23 06:28:54] [INFO ] Added : 13 causal constraints over 4 iterations in 302 ms. Result :sat
Minimization took 309 ms.
[2024-05-23 06:28:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:28:55] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:28:55] [INFO ] [Real]Added 91 Read/Feed constraints in 66 ms returned sat
[2024-05-23 06:28:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:28:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:28:55] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-23 06:28:55] [INFO ] [Nat]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-23 06:28:56] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 3 ms to minimize.
[2024-05-23 06:28:56] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:28:56] [INFO ] Deduced a trap composed of 159 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:28:56] [INFO ] Deduced a trap composed of 147 places in 205 ms of which 3 ms to minimize.
[2024-05-23 06:28:57] [INFO ] Deduced a trap composed of 137 places in 210 ms of which 3 ms to minimize.
[2024-05-23 06:28:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1210 ms
[2024-05-23 06:28:57] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 80 ms.
[2024-05-23 06:28:57] [INFO ] Added : 11 causal constraints over 4 iterations in 291 ms. Result :sat
Minimization took 319 ms.
[2024-05-23 06:28:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:28:57] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:28:58] [INFO ] [Real]Added 91 Read/Feed constraints in 33 ms returned sat
[2024-05-23 06:28:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:28:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:28:58] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-23 06:28:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 54 ms returned sat
[2024-05-23 06:28:58] [INFO ] Deduced a trap composed of 206 places in 213 ms of which 3 ms to minimize.
[2024-05-23 06:28:58] [INFO ] Deduced a trap composed of 172 places in 207 ms of which 4 ms to minimize.
[2024-05-23 06:28:59] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 3 ms to minimize.
[2024-05-23 06:28:59] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:28:59] [INFO ] Deduced a trap composed of 143 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:28:59] [INFO ] Deduced a trap composed of 134 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:28:59] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:29:00] [INFO ] Deduced a trap composed of 91 places in 212 ms of which 3 ms to minimize.
[2024-05-23 06:29:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1902 ms
[2024-05-23 06:29:00] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 78 ms.
[2024-05-23 06:29:00] [INFO ] Added : 2 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 318 ms.
[2024-05-23 06:29:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:29:01] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-23 06:29:01] [INFO ] [Real]Added 91 Read/Feed constraints in 49 ms returned sat
[2024-05-23 06:29:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:29:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:29:01] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:29:01] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:29:01] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-23 06:29:01] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 77 ms.
[2024-05-23 06:29:01] [INFO ] Added : 11 causal constraints over 4 iterations in 289 ms. Result :sat
Minimization took 305 ms.
[2024-05-23 06:29:02] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:29:02] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:29:02] [INFO ] [Real]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-23 06:29:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:29:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:29:02] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-23 06:29:02] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:29:03] [INFO ] Deduced a trap composed of 178 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:29:03] [INFO ] Deduced a trap composed of 178 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:29:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 469 ms
[2024-05-23 06:29:03] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 72 ms.
[2024-05-23 06:29:03] [INFO ] Added : 11 causal constraints over 4 iterations in 277 ms. Result :sat
Minimization took 317 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[31, 31, 266, 236, 212, 97, 17, 224, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 224, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 56 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 47 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:29:07] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:29:07] [INFO ] Invariant cache hit.
[2024-05-23 06:29:07] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-23 06:29:07] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:29:07] [INFO ] Invariant cache hit.
[2024-05-23 06:29:08] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:29:09] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
[2024-05-23 06:29:09] [INFO ] Redundant transitions in 16 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:29:09] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:29:09] [INFO ] Invariant cache hit.
[2024-05-23 06:29:09] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:29:26] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64481ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66329 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:30:13] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :[1, 0, 5, 3, 1, 4, 1, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 224, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:30:14] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:30:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 224, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2241 ms. (446 steps per ms)
BEST_FIRST walk for 9000008 steps (18 resets) in 9829 ms. (915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:30:26] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:30:26] [INFO ] Invariant cache hit.
[2024-05-23 06:30:26] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 06:30:26] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-23 06:30:26] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:30:26] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-23 06:30:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:30:26] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 06:30:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 06:30:26] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-23 06:30:27] [INFO ] Added : 1 causal constraints over 1 iterations in 151 ms. Result :sat
Minimization took 307 ms.
[2024-05-23 06:30:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:27] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 06:30:27] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-23 06:30:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:27] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:30:27] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:30:28] [INFO ] Deduced a trap composed of 126 places in 207 ms of which 3 ms to minimize.
[2024-05-23 06:30:28] [INFO ] Deduced a trap composed of 131 places in 192 ms of which 3 ms to minimize.
[2024-05-23 06:30:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 480 ms
[2024-05-23 06:30:28] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 72 ms.
[2024-05-23 06:30:28] [INFO ] Added : 1 causal constraints over 1 iterations in 157 ms. Result :sat
Minimization took 297 ms.
[2024-05-23 06:30:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:29] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 06:30:29] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:30:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:29] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:30:29] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:30:29] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 65 ms.
[2024-05-23 06:30:29] [INFO ] Added : 1 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 285 ms.
[2024-05-23 06:30:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:30:30] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:30:30] [INFO ] [Real]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-23 06:30:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 06:30:30] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:30:30] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-23 06:30:30] [INFO ] Deduced a trap composed of 169 places in 212 ms of which 3 ms to minimize.
[2024-05-23 06:30:30] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 3 ms to minimize.
[2024-05-23 06:30:31] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 3 ms to minimize.
[2024-05-23 06:30:31] [INFO ] Deduced a trap composed of 141 places in 218 ms of which 3 ms to minimize.
[2024-05-23 06:30:31] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:30:31] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 4 ms to minimize.
[2024-05-23 06:30:32] [INFO ] Deduced a trap composed of 172 places in 220 ms of which 3 ms to minimize.
[2024-05-23 06:30:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1713 ms
[2024-05-23 06:30:32] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-23 06:30:32] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 302 ms.
[2024-05-23 06:30:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:32] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:30:32] [INFO ] [Real]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:30:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:33] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:30:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-23 06:30:33] [INFO ] Deduced a trap composed of 178 places in 216 ms of which 3 ms to minimize.
[2024-05-23 06:30:33] [INFO ] Deduced a trap composed of 172 places in 228 ms of which 3 ms to minimize.
[2024-05-23 06:30:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2024-05-23 06:30:33] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 72 ms.
[2024-05-23 06:30:33] [INFO ] Added : 13 causal constraints over 4 iterations in 294 ms. Result :sat
Minimization took 305 ms.
[2024-05-23 06:30:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:34] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:30:34] [INFO ] [Real]Added 91 Read/Feed constraints in 65 ms returned sat
[2024-05-23 06:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:34] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:30:34] [INFO ] [Nat]Added 91 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:30:35] [INFO ] Deduced a trap composed of 178 places in 213 ms of which 3 ms to minimize.
[2024-05-23 06:30:35] [INFO ] Deduced a trap composed of 161 places in 225 ms of which 3 ms to minimize.
[2024-05-23 06:30:35] [INFO ] Deduced a trap composed of 159 places in 218 ms of which 3 ms to minimize.
[2024-05-23 06:30:35] [INFO ] Deduced a trap composed of 147 places in 212 ms of which 3 ms to minimize.
[2024-05-23 06:30:36] [INFO ] Deduced a trap composed of 137 places in 212 ms of which 3 ms to minimize.
[2024-05-23 06:30:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1256 ms
[2024-05-23 06:30:36] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 84 ms.
[2024-05-23 06:30:36] [INFO ] Added : 11 causal constraints over 4 iterations in 292 ms. Result :sat
Minimization took 306 ms.
[2024-05-23 06:30:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:36] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:30:37] [INFO ] [Real]Added 91 Read/Feed constraints in 32 ms returned sat
[2024-05-23 06:30:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:30:37] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:30:37] [INFO ] [Nat]Added 91 Read/Feed constraints in 53 ms returned sat
[2024-05-23 06:30:37] [INFO ] Deduced a trap composed of 206 places in 217 ms of which 3 ms to minimize.
[2024-05-23 06:30:37] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:30:38] [INFO ] Deduced a trap composed of 170 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:30:38] [INFO ] Deduced a trap composed of 152 places in 213 ms of which 3 ms to minimize.
[2024-05-23 06:30:38] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 3 ms to minimize.
[2024-05-23 06:30:38] [INFO ] Deduced a trap composed of 134 places in 214 ms of which 3 ms to minimize.
[2024-05-23 06:30:38] [INFO ] Deduced a trap composed of 131 places in 218 ms of which 4 ms to minimize.
[2024-05-23 06:30:39] [INFO ] Deduced a trap composed of 91 places in 219 ms of which 3 ms to minimize.
[2024-05-23 06:30:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1914 ms
[2024-05-23 06:30:39] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 64 ms.
[2024-05-23 06:30:39] [INFO ] Added : 2 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 312 ms.
[2024-05-23 06:30:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:39] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:30:40] [INFO ] [Real]Added 91 Read/Feed constraints in 50 ms returned sat
[2024-05-23 06:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:30:40] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:30:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 06:30:40] [INFO ] Deduced a trap composed of 178 places in 223 ms of which 3 ms to minimize.
[2024-05-23 06:30:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2024-05-23 06:30:40] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 67 ms.
[2024-05-23 06:30:40] [INFO ] Added : 11 causal constraints over 4 iterations in 272 ms. Result :sat
Minimization took 314 ms.
[2024-05-23 06:30:41] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2024-05-23 06:30:41] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:30:41] [INFO ] [Real]Added 91 Read/Feed constraints in 44 ms returned sat
[2024-05-23 06:30:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:30:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:30:41] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 06:30:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:30:42] [INFO ] Deduced a trap composed of 178 places in 222 ms of which 3 ms to minimize.
[2024-05-23 06:30:42] [INFO ] Deduced a trap composed of 178 places in 209 ms of which 3 ms to minimize.
[2024-05-23 06:30:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2024-05-23 06:30:42] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-23 06:30:42] [INFO ] Added : 11 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 304 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 68 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 59 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:30:46] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:30:46] [INFO ] Invariant cache hit.
[2024-05-23 06:30:46] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-23 06:30:46] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:30:46] [INFO ] Invariant cache hit.
[2024-05-23 06:30:47] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:30:48] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2024-05-23 06:30:48] [INFO ] Redundant transitions in 14 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:30:48] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:30:48] [INFO ] Invariant cache hit.
[2024-05-23 06:30:48] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:31:04] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 64805ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 64815ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66758 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:31:53] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :[3, 2, 0, 3, 0, 0, 1, 2, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:31:53] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:31:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2354 ms. (424 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 10527 ms. (854 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-23 06:32:06] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:32:06] [INFO ] Invariant cache hit.
[2024-05-23 06:32:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:06] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2024-05-23 06:32:06] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:32:06] [INFO ] [Real]Added 91 Read/Feed constraints in 45 ms returned sat
[2024-05-23 06:32:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-23 06:32:07] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-23 06:32:07] [INFO ] [Nat]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:32:07] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 75 ms.
[2024-05-23 06:32:07] [INFO ] Added : 1 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 282 ms.
[2024-05-23 06:32:07] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:07] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-23 06:32:07] [INFO ] [Real]Added 91 Read/Feed constraints in 47 ms returned sat
[2024-05-23 06:32:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:08] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:32:08] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:32:08] [INFO ] Deduced a trap composed of 126 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:32:08] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 3 ms to minimize.
[2024-05-23 06:32:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 459 ms
[2024-05-23 06:32:08] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 82 ms.
[2024-05-23 06:32:08] [INFO ] Added : 1 causal constraints over 1 iterations in 177 ms. Result :sat
Minimization took 299 ms.
[2024-05-23 06:32:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:32:09] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:32:09] [INFO ] [Real]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:32:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:09] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 06:32:09] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:32:09] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 84 ms.
[2024-05-23 06:32:09] [INFO ] Added : 1 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 283 ms.
[2024-05-23 06:32:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:10] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:32:10] [INFO ] [Real]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:32:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:10] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-23 06:32:10] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 06:32:10] [INFO ] Deduced a trap composed of 169 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:32:11] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
[2024-05-23 06:32:11] [INFO ] Deduced a trap composed of 143 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:32:11] [INFO ] Deduced a trap composed of 141 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:32:11] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 3 ms to minimize.
[2024-05-23 06:32:12] [INFO ] Deduced a trap composed of 137 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:32:12] [INFO ] Deduced a trap composed of 172 places in 213 ms of which 6 ms to minimize.
[2024-05-23 06:32:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1639 ms
[2024-05-23 06:32:12] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 82 ms.
[2024-05-23 06:32:12] [INFO ] Added : 1 causal constraints over 1 iterations in 181 ms. Result :sat
Minimization took 284 ms.
[2024-05-23 06:32:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:13] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 06:32:13] [INFO ] [Real]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:32:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:13] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 06:32:13] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-23 06:32:13] [INFO ] Deduced a trap composed of 178 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:32:13] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 4 ms to minimize.
[2024-05-23 06:32:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2024-05-23 06:32:13] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 73 ms.
[2024-05-23 06:32:14] [INFO ] Added : 13 causal constraints over 4 iterations in 299 ms. Result :sat
Minimization took 281 ms.
[2024-05-23 06:32:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:14] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:32:14] [INFO ] [Real]Added 91 Read/Feed constraints in 64 ms returned sat
[2024-05-23 06:32:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:15] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 06:32:15] [INFO ] [Nat]Added 91 Read/Feed constraints in 40 ms returned sat
[2024-05-23 06:32:15] [INFO ] Deduced a trap composed of 178 places in 214 ms of which 5 ms to minimize.
[2024-05-23 06:32:15] [INFO ] Deduced a trap composed of 161 places in 209 ms of which 3 ms to minimize.
[2024-05-23 06:32:15] [INFO ] Deduced a trap composed of 159 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:32:15] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 3 ms to minimize.
[2024-05-23 06:32:16] [INFO ] Deduced a trap composed of 137 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:32:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1182 ms
[2024-05-23 06:32:16] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 88 ms.
[2024-05-23 06:32:16] [INFO ] Added : 11 causal constraints over 4 iterations in 284 ms. Result :sat
Minimization took 281 ms.
[2024-05-23 06:32:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:17] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-23 06:32:17] [INFO ] [Real]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:32:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:32:17] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:32:17] [INFO ] [Nat]Added 91 Read/Feed constraints in 51 ms returned sat
[2024-05-23 06:32:17] [INFO ] Deduced a trap composed of 206 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:32:17] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 3 ms to minimize.
[2024-05-23 06:32:18] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 3 ms to minimize.
[2024-05-23 06:32:18] [INFO ] Deduced a trap composed of 152 places in 213 ms of which 2 ms to minimize.
[2024-05-23 06:32:18] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 2 ms to minimize.
[2024-05-23 06:32:18] [INFO ] Deduced a trap composed of 134 places in 193 ms of which 3 ms to minimize.
[2024-05-23 06:32:19] [INFO ] Deduced a trap composed of 131 places in 202 ms of which 3 ms to minimize.
[2024-05-23 06:32:19] [INFO ] Deduced a trap composed of 91 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:32:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1864 ms
[2024-05-23 06:32:19] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 75 ms.
[2024-05-23 06:32:19] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 291 ms.
[2024-05-23 06:32:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:19] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-23 06:32:20] [INFO ] [Real]Added 91 Read/Feed constraints in 46 ms returned sat
[2024-05-23 06:32:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:32:20] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 06:32:20] [INFO ] [Nat]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:32:20] [INFO ] Deduced a trap composed of 178 places in 197 ms of which 3 ms to minimize.
[2024-05-23 06:32:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-23 06:32:20] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 80 ms.
[2024-05-23 06:32:20] [INFO ] Added : 11 causal constraints over 4 iterations in 294 ms. Result :sat
Minimization took 295 ms.
[2024-05-23 06:32:21] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-23 06:32:21] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:32:21] [INFO ] [Real]Added 91 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:32:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:32:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:32:21] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2024-05-23 06:32:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:32:21] [INFO ] Deduced a trap composed of 178 places in 206 ms of which 3 ms to minimize.
[2024-05-23 06:32:22] [INFO ] Deduced a trap composed of 178 places in 208 ms of which 3 ms to minimize.
[2024-05-23 06:32:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2024-05-23 06:32:22] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 70 ms.
[2024-05-23 06:32:22] [INFO ] Added : 11 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 52 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 50 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:32:26] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:32:26] [INFO ] Invariant cache hit.
[2024-05-23 06:32:27] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-23 06:32:27] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:32:27] [INFO ] Invariant cache hit.
[2024-05-23 06:32:27] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:32:28] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
[2024-05-23 06:32:28] [INFO ] Redundant transitions in 16 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:32:28] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:32:28] [INFO ] Invariant cache hit.
[2024-05-23 06:32:28] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:32:45] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1202 variables, and 4 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/455 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 3 (OVERLAPS) 747/1202 variables, 455/459 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 91/550 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 1295/1845 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1845 constraints, problems are : Problem set: 0 solved, 1295 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1295/1295 constraints, Known Traps: 1/1 constraints]
After SMT, in 65135ms problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 65147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66967 ms. Remains : 455/455 places, 1297/1297 transitions.
[2024-05-23 06:33:33] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
Found an invariant !
This invariant on transitions {201=1, 323=1, 526=1, 731=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 374=1, 577=1, 737=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :[1, 0, 2, 2, 2, 2, 0, 4, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40007 steps (8 resets) in 1454 ms. (27 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 151952 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 11
Probabilistic random walk after 151952 steps, saw 93621 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-23 06:33:37] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:33:37] [INFO ] Invariant cache hit.
[2024-05-23 06:33:37] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 658/1049 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 85/1134 variables, 21/413 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 84/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 11/1145 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1145 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1145 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 50/1195 variables, 36/536 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1195 variables, 7/543 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1195 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 7/1202 variables, 6/549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 549 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1833 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 658/1049 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 85/1134 variables, 21/413 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 84/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 11/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1134 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 11/1145 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1145 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 06:33:40] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1145 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 50/1195 variables, 36/548 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1195 variables, 7/555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1195 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 7/1202 variables, 6/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1202 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/1202 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 561 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2151 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 4003ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 44963 ms.
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 51 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 455/455 places, 1297/1297 transitions.
RANDOM walk for 40006 steps (8 resets) in 232 ms. (171 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 178153 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 11
Probabilistic random walk after 178153 steps, saw 109759 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-23 06:34:30] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:34:30] [INFO ] Invariant cache hit.
[2024-05-23 06:34:30] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 658/1049 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 85/1134 variables, 21/413 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 84/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 11/1145 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1145 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1145 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 50/1195 variables, 36/536 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1195 variables, 7/543 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1195 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 7/1202 variables, 6/549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/1202 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 549 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1713 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 382/391 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 658/1049 variables, 391/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 85/1134 variables, 21/413 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1134 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1134 variables, 84/498 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1134 variables, 11/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1134 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 11/1145 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1145 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 06:34:32] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1145 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 50/1195 variables, 36/548 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1195 variables, 7/555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1195 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 7/1202 variables, 6/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1202 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/1202 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 561 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2228 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 455/455 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 3965ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 54711 ms.
Support contains 9 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 64 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 455/455 places, 1297/1297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Applied a total of 0 rules in 50 ms. Remains 455 /455 variables (removed 0) and now considering 1297/1297 (removed 0) transitions.
[2024-05-23 06:35:28] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:35:28] [INFO ] Invariant cache hit.
[2024-05-23 06:35:29] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-23 06:35:29] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:35:29] [INFO ] Invariant cache hit.
[2024-05-23 06:35:29] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:35:30] [INFO ] Implicit Places using invariants and state equation in 1452 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
[2024-05-23 06:35:30] [INFO ] Redundant transitions in 19 ms returned []
Running 1295 sub problems to find dead transitions.
[2024-05-23 06:35:30] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:35:30] [INFO ] Invariant cache hit.
[2024-05-23 06:35:30] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
[2024-05-23 06:35:47] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1295 unsolved
SMT process timed out in 34955ms, After SMT, problems are : Problem set: 0 solved, 1295 unsolved
Search for dead transitions found 0 dead transitions in 34973ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36835 ms. Remains : 455/455 places, 1297/1297 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[31, 31, 266, 236, 212, 97, 19, 227, 274] Max Struct:[32, 32, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[32]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[32]
[2024-05-23 06:36:05] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:36:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[32]
RANDOM walk for 10000 steps (2 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[32]
[2024-05-23 06:36:05] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:36:05] [INFO ] Invariant cache hit.
[2024-05-23 06:36:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:36:06] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 06:36:06] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:36:06] [INFO ] [Real]Added 91 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:36:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:36:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:36:06] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:36:06] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 06:36:06] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 74 ms.
[2024-05-23 06:36:06] [INFO ] Added : 1 causal constraints over 1 iterations in 173 ms. Result :sat
Minimization took 281 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[32]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 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 (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 446 transition count 1276
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 446 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 446 transition count 1272
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 440 transition count 1258
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 435 transition count 1246
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 431 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 431 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 427 transition count 1228
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 427 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 423 transition count 1220
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 423 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 419 transition count 1212
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 419 transition count 1212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 416 transition count 1206
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 416 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 414 transition count 1202
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 413 transition count 1200
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 413 transition count 1200
Applied a total of 88 rules in 178 ms. Remains 413 /455 variables (removed 42) and now considering 1200/1297 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 413/455 places, 1200/1297 transitions.
[2024-05-23 06:36:07] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-23 06:36:07] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[32]
RANDOM walk for 1000000 steps (2 resets) in 2019 ms. (495 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 881 ms. (1133 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[32]
[2024-05-23 06:36:10] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:10] [INFO ] Invariant cache hit.
[2024-05-23 06:36:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:36:10] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-23 06:36:10] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:36:10] [INFO ] [Real]Added 72 Read/Feed constraints in 41 ms returned sat
[2024-05-23 06:36:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:36:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:36:10] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:36:10] [INFO ] [Nat]Added 72 Read/Feed constraints in 38 ms returned sat
[2024-05-23 06:36:10] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 74 ms.
[2024-05-23 06:36:10] [INFO ] Added : 3 causal constraints over 1 iterations in 155 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[29] Max Struct:[32]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 06:36:11] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:11] [INFO ] Invariant cache hit.
[2024-05-23 06:36:11] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-23 06:36:11] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:11] [INFO ] Invariant cache hit.
[2024-05-23 06:36:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:36:12] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1648 ms to find 0 implicit places.
[2024-05-23 06:36:12] [INFO ] Redundant transitions in 17 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 06:36:12] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:12] [INFO ] Invariant cache hit.
[2024-05-23 06:36:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-23 06:36:27] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)timeout
(s287 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34075ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35803 ms. Remains : 413/413 places, 1200/1200 transitions.
[2024-05-23 06:36:46] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[29] Max Struct:[32]
RANDOM walk for 1000000 steps (2 resets) in 2180 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 898 ms. (1112 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[29] Max Struct:[32]
[2024-05-23 06:36:49] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:49] [INFO ] Invariant cache hit.
[2024-05-23 06:36:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:36:50] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-23 06:36:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:36:50] [INFO ] [Real]Added 72 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:36:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:36:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:36:50] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:36:50] [INFO ] [Nat]Added 72 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:36:50] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 67 ms.
[2024-05-23 06:36:50] [INFO ] Added : 3 causal constraints over 1 iterations in 156 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[29] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31] Max Struct:[32]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 44 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 43 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 06:36:51] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:51] [INFO ] Invariant cache hit.
[2024-05-23 06:36:51] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-23 06:36:51] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:51] [INFO ] Invariant cache hit.
[2024-05-23 06:36:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:36:52] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2024-05-23 06:36:52] [INFO ] Redundant transitions in 20 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 06:36:52] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:36:52] [INFO ] Invariant cache hit.
[2024-05-23 06:36:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-23 06:37:06] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34274ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36111 ms. Remains : 413/413 places, 1200/1200 transitions.
[2024-05-23 06:37:27] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:37:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[31] Max Struct:[32]
RANDOM walk for 1000000 steps (2 resets) in 2109 ms. (473 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 900 ms. (1109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[31] Max Struct:[32]
[2024-05-23 06:37:30] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:37:30] [INFO ] Invariant cache hit.
[2024-05-23 06:37:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:37:30] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:37:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:37:30] [INFO ] [Real]Added 72 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:37:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:37:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:37:30] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-23 06:37:30] [INFO ] [Nat]Added 72 Read/Feed constraints in 32 ms returned sat
[2024-05-23 06:37:30] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 68 ms.
[2024-05-23 06:37:30] [INFO ] Added : 3 causal constraints over 1 iterations in 147 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[31] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[31] Max Struct:[32]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 41 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 39 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 06:37:31] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:37:31] [INFO ] Invariant cache hit.
[2024-05-23 06:37:31] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-23 06:37:31] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:37:31] [INFO ] Invariant cache hit.
[2024-05-23 06:37:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:37:33] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2024-05-23 06:37:33] [INFO ] Redundant transitions in 17 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 06:37:33] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:37:33] [INFO ] Invariant cache hit.
[2024-05-23 06:37:33] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-23 06:37:47] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34117ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35865 ms. Remains : 413/413 places, 1200/1200 transitions.
RANDOM walk for 40006 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 328687 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 2
Probabilistic random walk after 328687 steps, saw 201556 distinct states, run finished after 3003 ms. (steps per millisecond=109 ) properties seen :0
[2024-05-23 06:38:10] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:38:10] [INFO ] Invariant cache hit.
[2024-05-23 06:38:10] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/1049 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1066 variables, 11/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1066 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/1074 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1074 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/1082 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 6/1088 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1088 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 488 constraints, problems are : Problem set: 0 solved, 2 unsolved in 460 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/1043 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1043 variables, 68/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1043 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1043 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/1049 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1049 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1049 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1066 variables, 11/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1066 variables, 4/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/1074 variables, 4/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1074 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 8/1082 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 6/1088 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1088 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 490 constraints, problems are : Problem set: 0 solved, 2 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 413/413 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 990ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 416 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=46 )
Parikh walk visited 2 properties in 30 ms.
FORMULA FunctionPointer-PT-c032-UpperBounds-01 32 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-01 in 125639 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[32]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[32]
[2024-05-23 06:38:11] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:38:11] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[32]
RANDOM walk for 10002 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[32]
[2024-05-23 06:38:11] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:38:11] [INFO ] Invariant cache hit.
[2024-05-23 06:38:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:38:11] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-23 06:38:11] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:38:11] [INFO ] [Real]Added 91 Read/Feed constraints in 57 ms returned sat
[2024-05-23 06:38:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:38:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:38:11] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:38:12] [INFO ] [Nat]Added 91 Read/Feed constraints in 43 ms returned sat
[2024-05-23 06:38:12] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 69 ms.
[2024-05-23 06:38:12] [INFO ] Added : 1 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 288 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[32]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 446 transition count 1276
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 446 transition count 1276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 446 transition count 1272
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 440 transition count 1258
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 440 transition count 1258
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 435 transition count 1246
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 435 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 431 transition count 1236
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 431 transition count 1236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 427 transition count 1228
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 427 transition count 1228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 423 transition count 1220
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 423 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 419 transition count 1212
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 419 transition count 1212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 416 transition count 1206
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 416 transition count 1206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 414 transition count 1202
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 414 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 413 transition count 1200
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 413 transition count 1200
Applied a total of 88 rules in 117 ms. Remains 413 /455 variables (removed 42) and now considering 1200/1297 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 413/455 places, 1200/1297 transitions.
[2024-05-23 06:38:12] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
// Phase 1: matrix 675 rows 413 cols
[2024-05-23 06:38:12] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[32]
RANDOM walk for 1000000 steps (2 resets) in 2075 ms. (481 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 888 ms. (1124 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[32]
[2024-05-23 06:38:15] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:38:15] [INFO ] Invariant cache hit.
[2024-05-23 06:38:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:38:15] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:38:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:38:15] [INFO ] [Real]Added 72 Read/Feed constraints in 31 ms returned sat
[2024-05-23 06:38:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:38:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:38:16] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:38:16] [INFO ] [Nat]Added 72 Read/Feed constraints in 35 ms returned sat
[2024-05-23 06:38:16] [INFO ] Computed and/alt/rep : 332/994/330 causal constraints (skipped 343 transitions) in 65 ms.
[2024-05-23 06:38:16] [INFO ] Added : 2 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[32]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[32] Max Struct:[32]
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 50 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 413/413 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 1200/1200 transitions.
Applied a total of 0 rules in 40 ms. Remains 413 /413 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-23 06:38:16] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:38:16] [INFO ] Invariant cache hit.
[2024-05-23 06:38:17] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-23 06:38:17] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:38:17] [INFO ] Invariant cache hit.
[2024-05-23 06:38:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-23 06:38:18] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2024-05-23 06:38:18] [INFO ] Redundant transitions in 19 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-23 06:38:18] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:38:18] [INFO ] Invariant cache hit.
[2024-05-23 06:38:18] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-23 06:38:32] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/413 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/413 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 3 (OVERLAPS) 675/1088 variables, 413/417 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
SMT process timed out in 34038ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 34049ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35817 ms. Remains : 413/413 places, 1200/1200 transitions.
[2024-05-23 06:38:52] [INFO ] Flow matrix only has 675 transitions (discarded 525 similar events)
[2024-05-23 06:38:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[32] Max Struct:[32]
FORMULA FunctionPointer-PT-c032-UpperBounds-03 32 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1960 ms. (509 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-03 in 43137 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:38:54] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:38:54] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:38:54] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:38:54] [INFO ] Invariant cache hit.
[2024-05-23 06:38:54] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:38:54] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:38:54] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:38:54] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-23 06:38:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:38:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:38:55] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:38:55] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:38:55] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 74 ms.
[2024-05-23 06:38:55] [INFO ] Added : 1 causal constraints over 1 iterations in 169 ms. Result :sat
Minimization took 267 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 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 (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 447 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 442 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 438 transition count 1252
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 438 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 434 transition count 1242
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 434 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 430 transition count 1234
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 430 transition count 1234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 426 transition count 1226
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 426 transition count 1226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 422 transition count 1218
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 422 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 419 transition count 1212
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 419 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 417 transition count 1208
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 417 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 416 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 416 transition count 1206
Applied a total of 82 rules in 114 ms. Remains 416 /455 variables (removed 39) and now considering 1206/1297 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 416/455 places, 1206/1297 transitions.
[2024-05-23 06:38:55] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2024-05-23 06:38:56] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
// Phase 1: matrix 681 rows 416 cols
[2024-05-23 06:38:56] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2114 ms. (472 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 856 ms. (1166 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[684] Max Struct:[+inf]
[2024-05-23 06:38:59] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:38:59] [INFO ] Invariant cache hit.
[2024-05-23 06:38:59] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:38:59] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-23 06:38:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 06:38:59] [INFO ] [Real]Added 74 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:38:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:38:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:38:59] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-23 06:38:59] [INFO ] [Nat]Added 74 Read/Feed constraints in 17 ms returned sat
[2024-05-23 06:38:59] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2024-05-23 06:38:59] [INFO ] Computed and/alt/rep : 330/1240/330 causal constraints (skipped 349 transitions) in 65 ms.
[2024-05-23 06:39:00] [INFO ] Added : 6 causal constraints over 2 iterations in 226 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[684] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[684] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 38 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 37 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 06:39:02] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:39:02] [INFO ] Invariant cache hit.
[2024-05-23 06:39:02] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-23 06:39:02] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:39:02] [INFO ] Invariant cache hit.
[2024-05-23 06:39:02] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 06:39:03] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
[2024-05-23 06:39:03] [INFO ] Redundant transitions in 12 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 06:39:03] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:39:03] [INFO ] Invariant cache hit.
[2024-05-23 06:39:03] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-23 06:39:17] [INFO ] Deduced a trap composed of 131 places in 217 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34145ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34155ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35724 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 06:39:37] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[7]
Current structural bounds on expressions (after cover walk) : Max Seen:[684] Max Struct:[+inf]
[2024-05-23 06:39:38] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:39:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[684] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2065 ms. (484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 901 ms. (1108 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[684] Max Struct:[+inf]
[2024-05-23 06:39:41] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:39:41] [INFO ] Invariant cache hit.
[2024-05-23 06:39:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:39:41] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 06:39:41] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 06:39:41] [INFO ] [Real]Added 74 Read/Feed constraints in 31 ms returned sat
[2024-05-23 06:39:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:39:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 06:39:41] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-23 06:39:41] [INFO ] [Nat]Added 74 Read/Feed constraints in 17 ms returned sat
[2024-05-23 06:39:41] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-05-23 06:39:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-23 06:39:41] [INFO ] Computed and/alt/rep : 330/1240/330 causal constraints (skipped 349 transitions) in 69 ms.
[2024-05-23 06:39:42] [INFO ] Added : 6 causal constraints over 2 iterations in 216 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[684] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[684] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 51 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 06:39:44] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:39:44] [INFO ] Invariant cache hit.
[2024-05-23 06:39:44] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-23 06:39:44] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:39:44] [INFO ] Invariant cache hit.
[2024-05-23 06:39:44] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 06:39:45] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
[2024-05-23 06:39:45] [INFO ] Redundant transitions in 21 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 06:39:45] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:39:45] [INFO ] Invariant cache hit.
[2024-05-23 06:39:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-23 06:40:00] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34628ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36237 ms. Remains : 416/416 places, 1206/1206 transitions.
[2024-05-23 06:40:20] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {253=1, 340=1, 666=1, 679=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {233=1, 320=1, 646=1, 679=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[684] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 519641 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 519641 steps, saw 318629 distinct states, run finished after 3002 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-23 06:40:23] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:40:23] [INFO ] Invariant cache hit.
[2024-05-23 06:40:23] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/355 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/953 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/355 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 598/953 variables, 332/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/953 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1871 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 46 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 416/416 places, 1206/1206 transitions.
RANDOM walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502677 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502677 steps, saw 308230 distinct states, run finished after 3002 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-23 06:40:29] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:40:29] [INFO ] Invariant cache hit.
[2024-05-23 06:40:29] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5/355 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/953 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/953 variables, 73/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1015 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1015 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1083 variables, 66/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1083 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1091 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1091 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1097 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1097 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1097/1097 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 346/350 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/355 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 598/953 variables, 332/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/953 variables, 73/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/953 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1015 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1015 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/1083 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1083 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 8/1091 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1091 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/1097 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1097 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1097/1097 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 690ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1913 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 416/416 places, 1206/1206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1206/1206 transitions.
Applied a total of 0 rules in 38 ms. Remains 416 /416 variables (removed 0) and now considering 1206/1206 (removed 0) transitions.
[2024-05-23 06:40:32] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:40:32] [INFO ] Invariant cache hit.
[2024-05-23 06:40:32] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-23 06:40:32] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:40:32] [INFO ] Invariant cache hit.
[2024-05-23 06:40:32] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-23 06:40:33] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
[2024-05-23 06:40:33] [INFO ] Redundant transitions in 15 ms returned []
Running 1204 sub problems to find dead transitions.
[2024-05-23 06:40:33] [INFO ] Flow matrix only has 681 transitions (discarded 525 similar events)
[2024-05-23 06:40:33] [INFO ] Invariant cache hit.
[2024-05-23 06:40:33] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
[2024-05-23 06:40:48] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
At refinement iteration 3 (OVERLAPS) 681/1097 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1204 unsolved
SMT process timed out in 34407ms, After SMT, problems are : Problem set: 0 solved, 1204 unsolved
Search for dead transitions found 0 dead transitions in 34417ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35998 ms. Remains : 416/416 places, 1206/1206 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 670
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 405 transition count 670
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 547 place count 405 transition count 601
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 685 place count 336 transition count 601
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 939 place count 209 transition count 474
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1003 place count 145 transition count 346
Iterating global reduction 2 with 64 rules applied. Total rules applied 1067 place count 145 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1068 place count 145 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1070 place count 144 transition count 344
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1133 place count 81 transition count 218
Iterating global reduction 3 with 63 rules applied. Total rules applied 1196 place count 81 transition count 218
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1259 place count 18 transition count 92
Iterating global reduction 3 with 63 rules applied. Total rules applied 1322 place count 18 transition count 92
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1385 place count 18 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1387 place count 17 transition count 28
Applied a total of 1387 rules in 82 ms. Remains 17 /416 variables (removed 399) and now considering 28/1206 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 17 cols
[2024-05-23 06:41:08] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 06:41:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 06:41:08] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:41:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 06:41:08] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 06:41:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 06:41:08] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 06:41:08] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 06:41:08] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 158 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[684] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-04 in 133734 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:41:08] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:41:08] [INFO ] Computed 3 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:41:08] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:41:08] [INFO ] Invariant cache hit.
[2024-05-23 06:41:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:41:08] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:41:08] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:41:08] [INFO ] [Real]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 06:41:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:41:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:41:08] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:41:08] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-23 06:41:08] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 79 ms.
[2024-05-23 06:41:09] [INFO ] Added : 1 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 266 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 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 (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 442 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 442 transition count 1264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 437 transition count 1252
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 437 transition count 1252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 433 transition count 1242
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 433 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 429 transition count 1234
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 429 transition count 1234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 425 transition count 1226
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 425 transition count 1226
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 421 transition count 1218
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 421 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 418 transition count 1212
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 418 transition count 1212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 416 transition count 1208
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 416 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 415 transition count 1206
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 415 transition count 1206
Applied a total of 82 rules in 165 ms. Remains 415 /455 variables (removed 40) and now considering 1206/1297 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 415/455 places, 1206/1297 transitions.
[2024-05-23 06:41:09] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
Found an invariant !
This invariant on transitions {228=1, 256=1, 259=1, 315=1, 512=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {202=1, 289=1, 614=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2024-05-23 06:41:09] [INFO ] Flow matrix only has 680 transitions (discarded 526 similar events)
// Phase 1: matrix 680 rows 415 cols
[2024-05-23 06:41:09] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2098 ms. (476 steps per ms)
FORMULA FunctionPointer-PT-c032-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-05 in 3736 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:41:12] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:41:12] [INFO ] Computed 3 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:41:12] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:41:12] [INFO ] Invariant cache hit.
[2024-05-23 06:41:12] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:41:12] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-23 06:41:12] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:41:12] [INFO ] [Real]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:41:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:41:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:41:12] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-23 06:41:12] [INFO ] [Nat]Added 91 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:41:12] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 77 ms.
[2024-05-23 06:41:12] [INFO ] Added : 3 causal constraints over 1 iterations in 185 ms. Result :sat
Minimization took 263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1280
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 442 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 438 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 435 transition count 1246
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 432 transition count 1240
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 429 transition count 1234
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 426 transition count 1228
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 426 transition count 1228
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 423 transition count 1222
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 423 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 421 transition count 1218
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 420 transition count 1216
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 420 transition count 1216
Applied a total of 74 rules in 131 ms. Remains 420 /455 variables (removed 35) and now considering 1216/1297 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 420/455 places, 1216/1297 transitions.
[2024-05-23 06:41:13] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 06:41:13] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-23 06:41:13] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2210 ms. (452 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 957 ms. (1043 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[510] Max Struct:[+inf]
[2024-05-23 06:41:16] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:41:16] [INFO ] Invariant cache hit.
[2024-05-23 06:41:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:41:16] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-23 06:41:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:41:16] [INFO ] [Real]Added 75 Read/Feed constraints in 40 ms returned sat
[2024-05-23 06:41:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:41:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:41:17] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:41:17] [INFO ] [Nat]Added 75 Read/Feed constraints in 22 ms returned sat
[2024-05-23 06:41:17] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 3 ms to minimize.
[2024-05-23 06:41:17] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 2 ms to minimize.
[2024-05-23 06:41:17] [INFO ] Deduced a trap composed of 103 places in 193 ms of which 3 ms to minimize.
[2024-05-23 06:41:18] [INFO ] Deduced a trap composed of 85 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:41:18] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 2 ms to minimize.
[2024-05-23 06:41:18] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:41:18] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 3 ms to minimize.
[2024-05-23 06:41:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1493 ms
[2024-05-23 06:41:18] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 68 ms.
[2024-05-23 06:41:18] [INFO ] Added : 8 causal constraints over 2 iterations in 225 ms. Result :sat
Minimization took 295 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[510] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[510] Max Struct:[+inf]
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 46 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-23 06:41:21] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:41:21] [INFO ] Invariant cache hit.
[2024-05-23 06:41:21] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-23 06:41:21] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:41:21] [INFO ] Invariant cache hit.
[2024-05-23 06:41:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:41:22] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
[2024-05-23 06:41:22] [INFO ] Redundant transitions in 18 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 06:41:22] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:41:22] [INFO ] Invariant cache hit.
[2024-05-23 06:41:22] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 06:41:37] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 34236ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 34246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35913 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-23 06:41:57] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[510] Max Struct:[+inf]
[2024-05-23 06:41:57] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:41:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[510] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2145 ms. (465 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1020 ms. (979 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[536] Max Struct:[+inf]
[2024-05-23 06:42:00] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:00] [INFO ] Invariant cache hit.
[2024-05-23 06:42:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:42:00] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-23 06:42:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:42:00] [INFO ] [Real]Added 75 Read/Feed constraints in 39 ms returned sat
[2024-05-23 06:42:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:42:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:42:01] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-23 06:42:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 22 ms returned sat
[2024-05-23 06:42:01] [INFO ] Deduced a trap composed of 113 places in 195 ms of which 3 ms to minimize.
[2024-05-23 06:42:01] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 3 ms to minimize.
[2024-05-23 06:42:01] [INFO ] Deduced a trap composed of 103 places in 186 ms of which 3 ms to minimize.
[2024-05-23 06:42:01] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 3 ms to minimize.
[2024-05-23 06:42:02] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 2 ms to minimize.
[2024-05-23 06:42:02] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 2 ms to minimize.
[2024-05-23 06:42:02] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 3 ms to minimize.
[2024-05-23 06:42:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1536 ms
[2024-05-23 06:42:02] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 74 ms.
[2024-05-23 06:42:02] [INFO ] Added : 8 causal constraints over 2 iterations in 213 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[536] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[536] Max Struct:[+inf]
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 43 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 43 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 45 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-23 06:42:05] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:05] [INFO ] Invariant cache hit.
[2024-05-23 06:42:05] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-23 06:42:05] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:05] [INFO ] Invariant cache hit.
[2024-05-23 06:42:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:42:06] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1515 ms to find 0 implicit places.
[2024-05-23 06:42:06] [INFO ] Redundant transitions in 21 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 06:42:06] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:06] [INFO ] Invariant cache hit.
[2024-05-23 06:42:06] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 06:42:21] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 34523ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 34534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36126 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-23 06:42:41] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[536] Max Struct:[+inf]
[2024-05-23 06:42:41] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[536] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2087 ms. (478 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 920 ms. (1085 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[536] Max Struct:[+inf]
[2024-05-23 06:42:44] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:44] [INFO ] Invariant cache hit.
[2024-05-23 06:42:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:42:44] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-23 06:42:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:42:44] [INFO ] [Real]Added 75 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:42:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:42:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:42:45] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-23 06:42:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 22 ms returned sat
[2024-05-23 06:42:45] [INFO ] Deduced a trap composed of 113 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:42:45] [INFO ] Deduced a trap composed of 105 places in 188 ms of which 3 ms to minimize.
[2024-05-23 06:42:45] [INFO ] Deduced a trap composed of 103 places in 186 ms of which 3 ms to minimize.
[2024-05-23 06:42:45] [INFO ] Deduced a trap composed of 85 places in 188 ms of which 3 ms to minimize.
[2024-05-23 06:42:46] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:42:46] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 3 ms to minimize.
[2024-05-23 06:42:46] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 3 ms to minimize.
[2024-05-23 06:42:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1523 ms
[2024-05-23 06:42:46] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 65 ms.
[2024-05-23 06:42:46] [INFO ] Added : 8 causal constraints over 2 iterations in 230 ms. Result :sat
Minimization took 285 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[536] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[536] Max Struct:[+inf]
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 44 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 44 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 43 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-23 06:42:49] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:49] [INFO ] Invariant cache hit.
[2024-05-23 06:42:49] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-23 06:42:49] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:49] [INFO ] Invariant cache hit.
[2024-05-23 06:42:49] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:42:50] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-23 06:42:50] [INFO ] Redundant transitions in 17 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 06:42:50] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:42:50] [INFO ] Invariant cache hit.
[2024-05-23 06:42:50] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 06:43:04] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33986ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33997ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35620 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-23 06:43:24] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[536] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 532903 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 532903 steps, saw 326754 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-05-23 06:43:28] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:43:28] [INFO ] Invariant cache hit.
[2024-05-23 06:43:28] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 556ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2446 ms.
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 43 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 44 ms. Remains : 420/420 places, 1216/1216 transitions.
RANDOM walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 524837 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 524837 steps, saw 321809 distinct states, run finished after 3002 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 06:43:34] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:43:34] [INFO ] Invariant cache hit.
[2024-05-23 06:43:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2395 ms.
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-23 06:43:37] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:43:37] [INFO ] Invariant cache hit.
[2024-05-23 06:43:37] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-23 06:43:37] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:43:37] [INFO ] Invariant cache hit.
[2024-05-23 06:43:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:43:38] [INFO ] Implicit Places using invariants and state equation in 1241 ms returned []
Implicit Place search using SMT with State Equation took 1539 ms to find 0 implicit places.
[2024-05-23 06:43:38] [INFO ] Redundant transitions in 13 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-23 06:43:38] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-23 06:43:38] [INFO ] Invariant cache hit.
[2024-05-23 06:43:38] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-23 06:43:52] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33820ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33834ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35438 ms. Remains : 420/420 places, 1216/1216 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 529 transitions
Reduce isomorphic transitions removed 529 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 420 transition count 677
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 549 place count 410 transition count 677
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 549 place count 410 transition count 605
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 693 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 947 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1011 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1075 place count 147 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1077 place count 147 transition count 348
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1140 place count 84 transition count 222
Iterating global reduction 3 with 63 rules applied. Total rules applied 1203 place count 84 transition count 222
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1266 place count 21 transition count 96
Iterating global reduction 3 with 63 rules applied. Total rules applied 1329 place count 21 transition count 96
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1392 place count 21 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1392 place count 21 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1394 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 19 transition count 31
Applied a total of 1396 rules in 20 ms. Remains 19 /420 variables (removed 401) and now considering 31/1216 (removed 1185) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 06:44:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 06:44:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 06:44:12] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 06:44:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 06:44:12] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:44:12] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:44:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 06:44:12] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 06:44:12] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 06:44:12] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 06:44:12] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[536] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-07 in 180732 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:44:12] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:44:12] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:44:12] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:44:12] [INFO ] Invariant cache hit.
[2024-05-23 06:44:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:44:13] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:44:13] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:44:13] [INFO ] [Real]Added 91 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:44:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:44:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:44:13] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-23 06:44:13] [INFO ] [Nat]Added 91 Read/Feed constraints in 42 ms returned sat
[2024-05-23 06:44:13] [INFO ] Deduced a trap composed of 169 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-23 06:44:13] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-23 06:44:13] [INFO ] Added : 9 causal constraints over 3 iterations in 259 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 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 (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1280
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 447 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 442 transition count 1262
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 442 transition count 1262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 438 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 435 transition count 1246
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 432 transition count 1240
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 429 transition count 1234
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 426 transition count 1228
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 424 transition count 1224
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 423 transition count 1222
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 422 transition count 1220
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 422 transition count 1220
Applied a total of 72 rules in 123 ms. Remains 422 /455 variables (removed 33) and now considering 1220/1297 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 422/455 places, 1220/1297 transitions.
[2024-05-23 06:44:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :[5]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-23 06:44:14] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 06:44:14] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2178 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1030 ms. (969 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[200] Max Struct:[+inf]
[2024-05-23 06:44:17] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:44:17] [INFO ] Invariant cache hit.
[2024-05-23 06:44:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:44:18] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:44:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:44:18] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:44:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:44:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:44:18] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:44:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:44:18] [INFO ] Deduced a trap composed of 113 places in 188 ms of which 2 ms to minimize.
[2024-05-23 06:44:18] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 2 ms to minimize.
[2024-05-23 06:44:18] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 3 ms to minimize.
[2024-05-23 06:44:19] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 2 ms to minimize.
[2024-05-23 06:44:19] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 2 ms to minimize.
[2024-05-23 06:44:19] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 2 ms to minimize.
[2024-05-23 06:44:19] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 2 ms to minimize.
[2024-05-23 06:44:19] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 3 ms to minimize.
[2024-05-23 06:44:20] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 2 ms to minimize.
[2024-05-23 06:44:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1903 ms
[2024-05-23 06:44:20] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 60 ms.
[2024-05-23 06:44:20] [INFO ] Added : 12 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[200] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[200] Max Struct:[+inf]
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 39 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 39 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 40 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 06:44:21] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:44:21] [INFO ] Invariant cache hit.
[2024-05-23 06:44:22] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-23 06:44:22] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:44:22] [INFO ] Invariant cache hit.
[2024-05-23 06:44:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:44:24] [INFO ] Implicit Places using invariants and state equation in 1880 ms returned []
Implicit Place search using SMT with State Equation took 2187 ms to find 0 implicit places.
[2024-05-23 06:44:24] [INFO ] Redundant transitions in 15 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 06:44:24] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:44:24] [INFO ] Invariant cache hit.
[2024-05-23 06:44:24] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 06:44:38] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33910ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33920ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36172 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 06:44:57] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[200] Max Struct:[+inf]
[2024-05-23 06:44:58] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:44:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[200] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2040 ms. (489 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 980 ms. (1019 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[204] Max Struct:[+inf]
[2024-05-23 06:45:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:01] [INFO ] Invariant cache hit.
[2024-05-23 06:45:01] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:45:01] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-23 06:45:01] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:45:01] [INFO ] [Real]Added 75 Read/Feed constraints in 33 ms returned sat
[2024-05-23 06:45:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:45:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:45:01] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-23 06:45:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 24 ms returned sat
[2024-05-23 06:45:01] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 3 ms to minimize.
[2024-05-23 06:45:02] [INFO ] Deduced a trap composed of 109 places in 189 ms of which 2 ms to minimize.
[2024-05-23 06:45:02] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 2 ms to minimize.
[2024-05-23 06:45:02] [INFO ] Deduced a trap composed of 85 places in 188 ms of which 3 ms to minimize.
[2024-05-23 06:45:02] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 3 ms to minimize.
[2024-05-23 06:45:03] [INFO ] Deduced a trap composed of 73 places in 187 ms of which 3 ms to minimize.
[2024-05-23 06:45:03] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 3 ms to minimize.
[2024-05-23 06:45:03] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 3 ms to minimize.
[2024-05-23 06:45:03] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 3 ms to minimize.
[2024-05-23 06:45:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1933 ms
[2024-05-23 06:45:03] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 60 ms.
[2024-05-23 06:45:03] [INFO ] Added : 12 causal constraints over 4 iterations in 276 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[204] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[204] Max Struct:[+inf]
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 39 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 39 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 39 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 06:45:05] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:05] [INFO ] Invariant cache hit.
[2024-05-23 06:45:05] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-23 06:45:05] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:05] [INFO ] Invariant cache hit.
[2024-05-23 06:45:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:45:07] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
[2024-05-23 06:45:07] [INFO ] Redundant transitions in 18 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 06:45:07] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:07] [INFO ] Invariant cache hit.
[2024-05-23 06:45:07] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 06:45:21] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33766ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33776ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36082 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 06:45:41] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[204] Max Struct:[+inf]
[2024-05-23 06:45:41] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[204] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2053 ms. (486 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 927 ms. (1077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[206] Max Struct:[+inf]
[2024-05-23 06:45:44] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:44] [INFO ] Invariant cache hit.
[2024-05-23 06:45:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:45:44] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:45:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:45:44] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:45:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:45:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:45:45] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-23 06:45:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:45:45] [INFO ] Deduced a trap composed of 113 places in 199 ms of which 3 ms to minimize.
[2024-05-23 06:45:45] [INFO ] Deduced a trap composed of 109 places in 194 ms of which 3 ms to minimize.
[2024-05-23 06:45:45] [INFO ] Deduced a trap composed of 87 places in 191 ms of which 3 ms to minimize.
[2024-05-23 06:45:46] [INFO ] Deduced a trap composed of 85 places in 187 ms of which 3 ms to minimize.
[2024-05-23 06:45:46] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:45:46] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 3 ms to minimize.
[2024-05-23 06:45:46] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:45:46] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 3 ms to minimize.
[2024-05-23 06:45:47] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
[2024-05-23 06:45:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1969 ms
[2024-05-23 06:45:47] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 59 ms.
[2024-05-23 06:45:47] [INFO ] Added : 12 causal constraints over 4 iterations in 272 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[206] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[206] Max Struct:[+inf]
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 46 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 46 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 40 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 06:45:48] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:48] [INFO ] Invariant cache hit.
[2024-05-23 06:45:49] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-23 06:45:49] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:49] [INFO ] Invariant cache hit.
[2024-05-23 06:45:49] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:45:51] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
[2024-05-23 06:45:51] [INFO ] Redundant transitions in 20 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 06:45:51] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:45:51] [INFO ] Invariant cache hit.
[2024-05-23 06:45:51] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 06:46:05] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34043ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34053ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36448 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 06:46:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[206] Max Struct:[+inf]
[2024-05-23 06:46:25] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:46:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[206] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2140 ms. (467 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 969 ms. (1030 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[220] Max Struct:[+inf]
[2024-05-23 06:46:28] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:46:28] [INFO ] Invariant cache hit.
[2024-05-23 06:46:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:46:28] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-23 06:46:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:46:28] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:46:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:46:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:46:29] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-23 06:46:29] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:46:29] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 3 ms to minimize.
[2024-05-23 06:46:29] [INFO ] Deduced a trap composed of 109 places in 220 ms of which 2 ms to minimize.
[2024-05-23 06:46:29] [INFO ] Deduced a trap composed of 87 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:46:30] [INFO ] Deduced a trap composed of 85 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:46:30] [INFO ] Deduced a trap composed of 76 places in 219 ms of which 2 ms to minimize.
[2024-05-23 06:46:30] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 3 ms to minimize.
[2024-05-23 06:46:30] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 2 ms to minimize.
[2024-05-23 06:46:30] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 3 ms to minimize.
[2024-05-23 06:46:31] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 2 ms to minimize.
[2024-05-23 06:46:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2069 ms
[2024-05-23 06:46:31] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 61 ms.
[2024-05-23 06:46:31] [INFO ] Added : 12 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 284 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[220] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[220] Max Struct:[+inf]
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 41 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 41 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 40 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 06:46:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:46:33] [INFO ] Invariant cache hit.
[2024-05-23 06:46:33] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-23 06:46:33] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:46:33] [INFO ] Invariant cache hit.
[2024-05-23 06:46:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:46:35] [INFO ] Implicit Places using invariants and state equation in 2069 ms returned []
Implicit Place search using SMT with State Equation took 2458 ms to find 0 implicit places.
[2024-05-23 06:46:35] [INFO ] Redundant transitions in 12 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 06:46:35] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:46:35] [INFO ] Invariant cache hit.
[2024-05-23 06:46:35] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 06:46:50] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34487ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34499ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37020 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 06:47:10] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[220] Max Struct:[+inf]
[2024-05-23 06:47:10] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:47:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[220] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2287 ms. (437 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 939 ms. (1063 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[220] Max Struct:[+inf]
[2024-05-23 06:47:13] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:47:13] [INFO ] Invariant cache hit.
[2024-05-23 06:47:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:47:13] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-23 06:47:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:47:13] [INFO ] [Real]Added 75 Read/Feed constraints in 32 ms returned sat
[2024-05-23 06:47:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:47:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:47:14] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-23 06:47:14] [INFO ] [Nat]Added 75 Read/Feed constraints in 24 ms returned sat
[2024-05-23 06:47:14] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:47:14] [INFO ] Deduced a trap composed of 109 places in 194 ms of which 3 ms to minimize.
[2024-05-23 06:47:14] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 2 ms to minimize.
[2024-05-23 06:47:14] [INFO ] Deduced a trap composed of 85 places in 185 ms of which 3 ms to minimize.
[2024-05-23 06:47:15] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 2 ms to minimize.
[2024-05-23 06:47:15] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 2 ms to minimize.
[2024-05-23 06:47:15] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 3 ms to minimize.
[2024-05-23 06:47:15] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 3 ms to minimize.
[2024-05-23 06:47:15] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 3 ms to minimize.
[2024-05-23 06:47:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1894 ms
[2024-05-23 06:47:16] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 355 transitions) in 58 ms.
[2024-05-23 06:47:16] [INFO ] Added : 12 causal constraints over 4 iterations in 287 ms. Result :sat
Minimization took 276 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[220] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[220] Max Struct:[+inf]
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 39 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 39 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 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 06:47:17] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:47:17] [INFO ] Invariant cache hit.
[2024-05-23 06:47:18] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-23 06:47:18] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:47:18] [INFO ] Invariant cache hit.
[2024-05-23 06:47:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:47:20] [INFO ] Implicit Places using invariants and state equation in 1953 ms returned []
Implicit Place search using SMT with State Equation took 2264 ms to find 0 implicit places.
[2024-05-23 06:47:20] [INFO ] Redundant transitions in 16 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 06:47:20] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:47:20] [INFO ] Invariant cache hit.
[2024-05-23 06:47:20] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 06:47:34] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33546ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33557ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35892 ms. Remains : 422/422 places, 1220/1220 transitions.
[2024-05-23 06:47:53] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Found an invariant !
This invariant on transitions {228=1, 320=1, 518=1, 684=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 344=1, 670=1, 688=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[220] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540673 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 540673 steps, saw 331519 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-05-23 06:47:56] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:47:56] [INFO ] Invariant cache hit.
[2024-05-23 06:47:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1183 ms.
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 38 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 38 ms. Remains : 422/422 places, 1220/1220 transitions.
RANDOM walk for 40000 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 546731 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 546731 steps, saw 335233 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-23 06:48:01] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:48:01] [INFO ] Invariant cache hit.
[2024-05-23 06:48:01] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/384 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 600/984 variables, 335/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/984 variables, 73/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1046 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1046 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 65/1111 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 352/377 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/377 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/377 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/384 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 600/984 variables, 335/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/984 variables, 73/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/984 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1046 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1046 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 65/1111 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1184 ms.
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 39 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 39 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 38 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 06:48:03] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:48:03] [INFO ] Invariant cache hit.
[2024-05-23 06:48:03] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-23 06:48:03] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:48:03] [INFO ] Invariant cache hit.
[2024-05-23 06:48:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:48:05] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
[2024-05-23 06:48:05] [INFO ] Redundant transitions in 17 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 06:48:06] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 06:48:06] [INFO ] Invariant cache hit.
[2024-05-23 06:48:06] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 06:48:20] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 34383ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 34401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36794 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 29 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 06:48:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 06:48:40] [INFO ] [Real]Absence check using 3 positive place invariants in 28 ms returned sat
[2024-05-23 06:48:40] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 06:48:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 06:48:40] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:48:40] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:48:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 06:48:40] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 06:48:40] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 06:48:40] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 06:48:40] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 234 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[220] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-10 in 267899 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:48:40] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:48:40] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:48:40] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:48:40] [INFO ] Invariant cache hit.
[2024-05-23 06:48:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:48:40] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:48:40] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:48:40] [INFO ] [Real]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-23 06:48:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:48:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:48:41] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-23 06:48:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-23 06:48:41] [INFO ] Deduced a trap composed of 84 places in 213 ms of which 2 ms to minimize.
[2024-05-23 06:48:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2024-05-23 06:48:41] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 62 ms.
[2024-05-23 06:48:41] [INFO ] Added : 2 causal constraints over 1 iterations in 150 ms. Result :sat
Minimization took 273 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 449 transition count 1281
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 449 transition count 1281
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 449 transition count 1277
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 443 transition count 1263
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 443 transition count 1263
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 438 transition count 1251
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 438 transition count 1251
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 434 transition count 1241
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 434 transition count 1241
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 430 transition count 1233
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 430 transition count 1233
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 426 transition count 1225
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 426 transition count 1225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 422 transition count 1217
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 422 transition count 1217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 419 transition count 1211
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 419 transition count 1211
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 417 transition count 1207
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 416 transition count 1205
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 416 transition count 1205
Applied a total of 82 rules in 102 ms. Remains 416 /455 variables (removed 39) and now considering 1205/1297 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 416/455 places, 1205/1297 transitions.
[2024-05-23 06:48:42] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 06:48:42] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-23 06:48:42] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2068 ms. (483 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 893 ms. (1118 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-23 06:48:45] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:48:45] [INFO ] Invariant cache hit.
[2024-05-23 06:48:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:48:45] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-23 06:48:45] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:48:45] [INFO ] [Real]Added 75 Read/Feed constraints in 18 ms returned sat
[2024-05-23 06:48:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:48:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:48:45] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-23 06:48:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 44 ms returned sat
[2024-05-23 06:48:46] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 3 ms to minimize.
[2024-05-23 06:48:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-23 06:48:46] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 60 ms.
[2024-05-23 06:48:46] [INFO ] Added : 5 causal constraints over 2 iterations in 185 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[32] Max Struct:[+inf]
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 43 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-23 06:48:46] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:48:46] [INFO ] Invariant cache hit.
[2024-05-23 06:48:47] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-23 06:48:47] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:48:47] [INFO ] Invariant cache hit.
[2024-05-23 06:48:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:48:48] [INFO ] Implicit Places using invariants and state equation in 1616 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
[2024-05-23 06:48:48] [INFO ] Redundant transitions in 12 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-23 06:48:48] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:48:48] [INFO ] Invariant cache hit.
[2024-05-23 06:48:48] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-23 06:49:03] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34065ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34075ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36102 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-23 06:49:22] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[32] Max Struct:[+inf]
[2024-05-23 06:49:23] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:49:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[32] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1988 ms. (502 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 902 ms. (1107 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[32] Max Struct:[+inf]
[2024-05-23 06:49:25] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:49:25] [INFO ] Invariant cache hit.
[2024-05-23 06:49:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:49:26] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-23 06:49:26] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:49:26] [INFO ] [Real]Added 75 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:49:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:49:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-23 06:49:26] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-23 06:49:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 44 ms returned sat
[2024-05-23 06:49:26] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 2 ms to minimize.
[2024-05-23 06:49:26] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:49:27] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 2 ms to minimize.
[2024-05-23 06:49:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 653 ms
[2024-05-23 06:49:27] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 59 ms.
[2024-05-23 06:49:27] [INFO ] Added : 6 causal constraints over 2 iterations in 190 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[32] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[32] Max Struct:[+inf]
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 41 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-23 06:49:27] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:49:27] [INFO ] Invariant cache hit.
[2024-05-23 06:49:28] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-23 06:49:28] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:49:28] [INFO ] Invariant cache hit.
[2024-05-23 06:49:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:49:29] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 1940 ms to find 0 implicit places.
[2024-05-23 06:49:29] [INFO ] Redundant transitions in 12 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-23 06:49:29] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:49:29] [INFO ] Invariant cache hit.
[2024-05-23 06:49:29] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-23 06:49:44] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34227ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36247 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-23 06:50:03] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[32] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 521440 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 521440 steps, saw 319738 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-23 06:50:07] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:50:07] [INFO ] Invariant cache hit.
[2024-05-23 06:50:07] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 598/952 variables, 333/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 74/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 718ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 126 ms.
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 37 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 38 ms. Remains : 416/416 places, 1205/1205 transitions.
RANDOM walk for 40005 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 553864 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 553864 steps, saw 339616 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-05-23 06:50:11] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-23 06:50:11] [INFO ] Invariant cache hit.
[2024-05-23 06:50:11] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 340/348 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/354 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 598/952 variables, 333/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/952 variables, 74/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1014 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1082 variables, 66/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1082 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/1090 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1090 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1096 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1096 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 675ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2954 steps, including 7 resets, run visited all 1 properties in 13 ms. (steps per millisecond=227 )
Parikh walk visited 1 properties in 12 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[32] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-11 in 91358 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:50:12] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:50:12] [INFO ] Computed 3 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2024-05-23 06:50:12] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:50:12] [INFO ] Invariant cache hit.
[2024-05-23 06:50:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:50:12] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 06:50:12] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:50:12] [INFO ] [Real]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-23 06:50:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:50:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:50:12] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2024-05-23 06:50:12] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2024-05-23 06:50:12] [INFO ] Deduced a trap composed of 178 places in 197 ms of which 3 ms to minimize.
[2024-05-23 06:50:13] [INFO ] Deduced a trap composed of 172 places in 216 ms of which 3 ms to minimize.
[2024-05-23 06:50:13] [INFO ] Deduced a trap composed of 183 places in 213 ms of which 3 ms to minimize.
[2024-05-23 06:50:13] [INFO ] Deduced a trap composed of 167 places in 226 ms of which 3 ms to minimize.
[2024-05-23 06:50:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 972 ms
[2024-05-23 06:50:13] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 66 ms.
[2024-05-23 06:50:13] [INFO ] Added : 10 causal constraints over 4 iterations in 267 ms. Result :sat
Minimization took 266 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 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 (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 447 transition count 1276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 442 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 438 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 435 transition count 1248
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 432 transition count 1242
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 432 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 429 transition count 1236
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 429 transition count 1236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 426 transition count 1230
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 426 transition count 1230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 424 transition count 1226
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 424 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 423 transition count 1224
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 423 transition count 1224
Applied a total of 66 rules in 97 ms. Remains 423 /455 variables (removed 32) and now considering 1224/1297 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 423/455 places, 1224/1297 transitions.
[2024-05-23 06:50:14] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
[2024-05-23 06:50:14] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
// Phase 1: matrix 691 rows 423 cols
[2024-05-23 06:50:14] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2147 ms. (465 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 976 ms. (1023 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[195] Max Struct:[+inf]
[2024-05-23 06:50:17] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:50:17] [INFO ] Invariant cache hit.
[2024-05-23 06:50:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:50:17] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-23 06:50:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:50:17] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:50:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:50:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:50:18] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-23 06:50:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-23 06:50:18] [INFO ] Deduced a trap composed of 113 places in 194 ms of which 3 ms to minimize.
[2024-05-23 06:50:18] [INFO ] Deduced a trap composed of 94 places in 200 ms of which 3 ms to minimize.
[2024-05-23 06:50:18] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:50:19] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:50:19] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 3 ms to minimize.
[2024-05-23 06:50:19] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 2 ms to minimize.
[2024-05-23 06:50:19] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 2 ms to minimize.
[2024-05-23 06:50:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1532 ms
[2024-05-23 06:50:19] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 70 ms.
[2024-05-23 06:50:19] [INFO ] Added : 24 causal constraints over 6 iterations in 323 ms. Result :sat
Minimization took 239 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[195] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[195] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 39 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 39 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 06:50:21] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:50:21] [INFO ] Invariant cache hit.
[2024-05-23 06:50:21] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 06:50:21] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:50:21] [INFO ] Invariant cache hit.
[2024-05-23 06:50:21] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:50:23] [INFO ] Implicit Places using invariants and state equation in 1377 ms returned []
Implicit Place search using SMT with State Equation took 1709 ms to find 0 implicit places.
[2024-05-23 06:50:23] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 06:50:23] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:50:23] [INFO ] Invariant cache hit.
[2024-05-23 06:50:23] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 06:50:38] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34062ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35854 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 06:50:57] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[195] Max Struct:[+inf]
[2024-05-23 06:50:57] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:50:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[195] Max Struct:[+inf]
RANDOM walk for 1000006 steps (2 resets) in 2079 ms. (480 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 989 ms. (1010 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[195] Max Struct:[+inf]
[2024-05-23 06:51:00] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:00] [INFO ] Invariant cache hit.
[2024-05-23 06:51:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:51:00] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-23 06:51:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:51:00] [INFO ] [Real]Added 75 Read/Feed constraints in 34 ms returned sat
[2024-05-23 06:51:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:51:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:51:01] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-23 06:51:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:51:01] [INFO ] Deduced a trap composed of 113 places in 202 ms of which 3 ms to minimize.
[2024-05-23 06:51:01] [INFO ] Deduced a trap composed of 94 places in 199 ms of which 2 ms to minimize.
[2024-05-23 06:51:01] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 2 ms to minimize.
[2024-05-23 06:51:01] [INFO ] Deduced a trap composed of 78 places in 204 ms of which 3 ms to minimize.
[2024-05-23 06:51:02] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 2 ms to minimize.
[2024-05-23 06:51:02] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 2 ms to minimize.
[2024-05-23 06:51:02] [INFO ] Deduced a trap composed of 78 places in 200 ms of which 2 ms to minimize.
[2024-05-23 06:51:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1551 ms
[2024-05-23 06:51:02] [INFO ] Computed and/alt/rep : 339/1255/332 causal constraints (skipped 357 transitions) in 59 ms.
[2024-05-23 06:51:02] [INFO ] Added : 24 causal constraints over 6 iterations in 322 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[195] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[195] Max Struct:[+inf]
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 49 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 38 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 06:51:04] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:04] [INFO ] Invariant cache hit.
[2024-05-23 06:51:04] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-23 06:51:04] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:04] [INFO ] Invariant cache hit.
[2024-05-23 06:51:04] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:51:06] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
[2024-05-23 06:51:06] [INFO ] Redundant transitions in 12 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 06:51:06] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:06] [INFO ] Invariant cache hit.
[2024-05-23 06:51:06] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 06:51:20] [INFO ] Deduced a trap composed of 131 places in 103 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 33993ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34004ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35839 ms. Remains : 423/423 places, 1224/1224 transitions.
[2024-05-23 06:51:40] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
Found an invariant !
This invariant on transitions {203=1, 297=1, 495=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 346=1, 544=1, 687=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[195] Max Struct:[+inf]
RANDOM walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 511622 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 511622 steps, saw 318264 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-23 06:51:43] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:43] [INFO ] Invariant cache hit.
[2024-05-23 06:51:43] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 658ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 753 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 81 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 423/423 places, 1224/1224 transitions.
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 506953 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 506953 steps, saw 315085 distinct states, run finished after 3002 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 06:51:48] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:48] [INFO ] Invariant cache hit.
[2024-05-23 06:51:48] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/384 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 601/985 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/985 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 62/1047 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1047 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 66/1113 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1113 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/1114 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1114 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1114 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/23 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 351/374 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/384 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/384 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 601/985 variables, 337/360 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/985 variables, 74/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/985 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 62/1047 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1047 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/1113 variables, 66/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1113 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/1114 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1114 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1114 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 423/423 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 648ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 755 ms.
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 51 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 423/423 places, 1224/1224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1224/1224 transitions.
Applied a total of 0 rules in 56 ms. Remains 423 /423 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
[2024-05-23 06:51:49] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:49] [INFO ] Invariant cache hit.
[2024-05-23 06:51:49] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-23 06:51:49] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:49] [INFO ] Invariant cache hit.
[2024-05-23 06:51:50] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:51:51] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1741 ms to find 0 implicit places.
[2024-05-23 06:51:51] [INFO ] Redundant transitions in 16 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-05-23 06:51:51] [INFO ] Flow matrix only has 691 transitions (discarded 533 similar events)
[2024-05-23 06:51:51] [INFO ] Invariant cache hit.
[2024-05-23 06:51:51] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-05-23 06:52:06] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 691/1114 variables, 423/427 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
SMT process timed out in 34330ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 34343ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36169 ms. Remains : 423/423 places, 1224/1224 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 533 transitions
Reduce isomorphic transitions removed 533 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 423 transition count 681
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 553 place count 413 transition count 681
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 553 place count 413 transition count 608
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 699 place count 340 transition count 608
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 955 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1019 place count 148 transition count 352
Iterating global reduction 2 with 64 rules applied. Total rules applied 1083 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1084 place count 148 transition count 351
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1147 place count 85 transition count 225
Iterating global reduction 3 with 63 rules applied. Total rules applied 1210 place count 85 transition count 225
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1273 place count 22 transition count 99
Iterating global reduction 3 with 63 rules applied. Total rules applied 1336 place count 22 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1399 place count 22 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1399 place count 22 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 21 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1403 place count 20 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1405 place count 19 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1408 place count 19 transition count 31
Applied a total of 1408 rules in 25 ms. Remains 19 /423 variables (removed 404) and now considering 31/1224 (removed 1193) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 06:52:25] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 06:52:25] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 06:52:25] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 06:52:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 06:52:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:52:25] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:52:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 06:52:25] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 06:52:25] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 06:52:25] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 06:52:25] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 107 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[195] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-13 in 133812 ms.
Starting property specific reduction for FunctionPointer-PT-c032-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:52:25] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
// Phase 1: matrix 747 rows 455 cols
[2024-05-23 06:52:25] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-23 06:52:25] [INFO ] Flow matrix only has 747 transitions (discarded 550 similar events)
[2024-05-23 06:52:25] [INFO ] Invariant cache hit.
[2024-05-23 06:52:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:52:26] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-23 06:52:26] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 06:52:26] [INFO ] [Real]Added 91 Read/Feed constraints in 31 ms returned sat
[2024-05-23 06:52:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:52:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 06:52:26] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-23 06:52:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 36 ms returned sat
[2024-05-23 06:52:26] [INFO ] Computed and/alt/rep : 97/185/92 causal constraints (skipped 653 transitions) in 76 ms.
[2024-05-23 06:52:26] [INFO ] Added : 8 causal constraints over 3 iterations in 253 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1297/1297 transitions.
Graph (complete) has 2223 edges and 455 vertex of which 452 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 (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 452 transition count 1292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 447 transition count 1278
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 447 transition count 1278
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 20 place count 447 transition count 1274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 442 transition count 1264
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 442 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 438 transition count 1254
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 438 transition count 1254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 435 transition count 1246
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 432 transition count 1240
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 429 transition count 1234
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 429 transition count 1234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 426 transition count 1228
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 424 transition count 1224
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 422 transition count 1220
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 421 transition count 1218
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 421 transition count 1218
Applied a total of 72 rules in 115 ms. Remains 421 /455 variables (removed 34) and now considering 1218/1297 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 421/455 places, 1218/1297 transitions.
[2024-05-23 06:52:27] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-23 06:52:27] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-23 06:52:27] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2091 ms. (478 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1020 ms. (979 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[513] Max Struct:[+inf]
[2024-05-23 06:52:30] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:52:30] [INFO ] Invariant cache hit.
[2024-05-23 06:52:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:52:30] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-23 06:52:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:52:30] [INFO ] [Real]Added 75 Read/Feed constraints in 51 ms returned sat
[2024-05-23 06:52:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:52:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:52:31] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:52:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:52:31] [INFO ] Deduced a trap composed of 113 places in 192 ms of which 3 ms to minimize.
[2024-05-23 06:52:31] [INFO ] Deduced a trap composed of 109 places in 184 ms of which 3 ms to minimize.
[2024-05-23 06:52:31] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 4 ms to minimize.
[2024-05-23 06:52:31] [INFO ] Deduced a trap composed of 85 places in 185 ms of which 3 ms to minimize.
[2024-05-23 06:52:32] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 2 ms to minimize.
[2024-05-23 06:52:32] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 3 ms to minimize.
[2024-05-23 06:52:32] [INFO ] Deduced a trap composed of 71 places in 186 ms of which 3 ms to minimize.
[2024-05-23 06:52:32] [INFO ] Deduced a trap composed of 70 places in 183 ms of which 3 ms to minimize.
[2024-05-23 06:52:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1677 ms
[2024-05-23 06:52:32] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 75 ms.
[2024-05-23 06:52:32] [INFO ] Added : 10 causal constraints over 3 iterations in 258 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[513] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[513] Max Struct:[+inf]
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 44 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-23 06:52:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:52:33] [INFO ] Invariant cache hit.
[2024-05-23 06:52:33] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 06:52:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:52:33] [INFO ] Invariant cache hit.
[2024-05-23 06:52:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:52:34] [INFO ] Implicit Places using invariants and state equation in 1253 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
[2024-05-23 06:52:34] [INFO ] Redundant transitions in 13 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 06:52:34] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:52:34] [INFO ] Invariant cache hit.
[2024-05-23 06:52:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 06:52:52] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34362ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36000 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 06:53:09] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[513] Max Struct:[+inf]
[2024-05-23 06:53:09] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[513] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2138 ms. (467 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 976 ms. (1023 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[520] Max Struct:[+inf]
[2024-05-23 06:53:12] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:12] [INFO ] Invariant cache hit.
[2024-05-23 06:53:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:53:12] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 06:53:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:53:13] [INFO ] [Real]Added 75 Read/Feed constraints in 50 ms returned sat
[2024-05-23 06:53:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:53:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:53:13] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2024-05-23 06:53:13] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-23 06:53:13] [INFO ] Deduced a trap composed of 113 places in 191 ms of which 3 ms to minimize.
[2024-05-23 06:53:13] [INFO ] Deduced a trap composed of 109 places in 191 ms of which 3 ms to minimize.
[2024-05-23 06:53:13] [INFO ] Deduced a trap composed of 87 places in 187 ms of which 2 ms to minimize.
[2024-05-23 06:53:14] [INFO ] Deduced a trap composed of 85 places in 190 ms of which 3 ms to minimize.
[2024-05-23 06:53:14] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 2 ms to minimize.
[2024-05-23 06:53:14] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 3 ms to minimize.
[2024-05-23 06:53:14] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 8 ms to minimize.
[2024-05-23 06:53:14] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 3 ms to minimize.
[2024-05-23 06:53:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1721 ms
[2024-05-23 06:53:15] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 67 ms.
[2024-05-23 06:53:15] [INFO ] Added : 10 causal constraints over 3 iterations in 249 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[520] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[520] Max Struct:[+inf]
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 42 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 42 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 39 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 06:53:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:15] [INFO ] Invariant cache hit.
[2024-05-23 06:53:15] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 06:53:15] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:15] [INFO ] Invariant cache hit.
[2024-05-23 06:53:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:53:17] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
[2024-05-23 06:53:17] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 06:53:17] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:17] [INFO ] Invariant cache hit.
[2024-05-23 06:53:17] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 06:53:34] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34364ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34376ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35988 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 06:53:51] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[520] Max Struct:[+inf]
[2024-05-23 06:53:51] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[520] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2099 ms. (476 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 936 ms. (1067 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[520] Max Struct:[+inf]
[2024-05-23 06:53:54] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:54] [INFO ] Invariant cache hit.
[2024-05-23 06:53:55] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 06:53:55] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-23 06:53:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:53:55] [INFO ] [Real]Added 75 Read/Feed constraints in 51 ms returned sat
[2024-05-23 06:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 06:53:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 06:53:55] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-23 06:53:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-23 06:53:55] [INFO ] Deduced a trap composed of 113 places in 185 ms of which 2 ms to minimize.
[2024-05-23 06:53:55] [INFO ] Deduced a trap composed of 109 places in 186 ms of which 2 ms to minimize.
[2024-05-23 06:53:56] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 3 ms to minimize.
[2024-05-23 06:53:56] [INFO ] Deduced a trap composed of 85 places in 189 ms of which 2 ms to minimize.
[2024-05-23 06:53:56] [INFO ] Deduced a trap composed of 76 places in 186 ms of which 3 ms to minimize.
[2024-05-23 06:53:56] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 3 ms to minimize.
[2024-05-23 06:53:56] [INFO ] Deduced a trap composed of 71 places in 181 ms of which 2 ms to minimize.
[2024-05-23 06:53:57] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-05-23 06:53:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1669 ms
[2024-05-23 06:53:57] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 64 ms.
[2024-05-23 06:53:57] [INFO ] Added : 10 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 282 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[520] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[520] Max Struct:[+inf]
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 39 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 39 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 40 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 06:53:57] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:57] [INFO ] Invariant cache hit.
[2024-05-23 06:53:58] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-23 06:53:58] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:58] [INFO ] Invariant cache hit.
[2024-05-23 06:53:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:53:59] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
[2024-05-23 06:53:59] [INFO ] Redundant transitions in 18 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 06:53:59] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:53:59] [INFO ] Invariant cache hit.
[2024-05-23 06:53:59] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 06:54:16] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 33926ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 33937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35558 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-23 06:54:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {216=1, 307=1, 633=1, 686=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[520] Max Struct:[+inf]
RANDOM walk for 40005 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 547047 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 547047 steps, saw 335428 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-05-23 06:54:36] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:54:36] [INFO ] Invariant cache hit.
[2024-05-23 06:54:36] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 558ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2519 ms.
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 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549189 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 549189 steps, saw 336740 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-23 06:54:42] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:54:42] [INFO ] Invariant cache hit.
[2024-05-23 06:54:42] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2516 ms.
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 39 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 39 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 39 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-23 06:54:45] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:54:45] [INFO ] Invariant cache hit.
[2024-05-23 06:54:46] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-23 06:54:46] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:54:46] [INFO ] Invariant cache hit.
[2024-05-23 06:54:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 06:54:47] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
[2024-05-23 06:54:47] [INFO ] Redundant transitions in 13 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-23 06:54:47] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-23 06:54:47] [INFO ] Invariant cache hit.
[2024-05-23 06:54:47] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-23 06:55:04] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34094ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35731 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 32 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-23 06:55:21] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 06:55:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 06:55:21] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 06:55:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 06:55:21] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:55:21] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 06:55:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 06:55:21] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 06:55:21] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 06:55:21] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 06:55:21] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 108 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[520] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c032-UpperBounds-15 in 175956 ms.
[2024-05-23 06:55:22] [INFO ] Flatten gal took : 126 ms
[2024-05-23 06:55:22] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-23 06:55:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 455 places, 1297 transitions and 5316 arcs took 10 ms.
Total runtime 2284745 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-c032
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 455
TRANSITIONS: 1297
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.030s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 3534
MODEL NAME: /home/mcc/execution/412/model
455 places, 1297 transitions.
Enabling coverability test.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 15 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716447347296
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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-c032"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FunctionPointer-PT-c032, 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 r179-tall-171640601200309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c032.tgz
mv FunctionPointer-PT-c032 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 ;