About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10071.567 | 3600000.00 | 7886272.00 | 4973.60 | 1 ? ? 1 1 1 1 1 1 1 1 1 1 ? 1 1 | 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.r245-tall-171654349100053.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 MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349100053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716578213111
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 19:16:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 19:16:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 19:16:54] [INFO ] Load time of PNML (sax parser for PT used): 432 ms
[2024-05-24 19:16:54] [INFO ] Transformed 6876 places.
[2024-05-24 19:16:54] [INFO ] Transformed 9571 transitions.
[2024-05-24 19:16:54] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 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, +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, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 19:16:55] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2024-05-24 19:16:55] [INFO ] Computed 649 invariants in 672 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[17, 51, 1, 51, 51, 17, 17, 1, 17, 51, 17, 17, 1, 1, 51, 51]
RANDOM walk for 10000 steps (120 resets) in 167 ms. (59 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140008 steps (476 resets) in 639 ms. (218 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1] Max Struct:[17, 51, 1, 51, 51, 17, 17, 17, 51, 17, 17, 1, 51, 51]
[2024-05-24 19:16:56] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
[2024-05-24 19:16:56] [INFO ] Invariant cache hit.
[2024-05-24 19:16:57] [INFO ] [Real]Absence check using 54 positive place invariants in 119 ms returned sat
[2024-05-24 19:16:58] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 183 ms returned unsat
[2024-05-24 19:16:58] [INFO ] [Real]Absence check using 54 positive place invariants in 118 ms returned sat
[2024-05-24 19:16:59] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 249 ms returned sat
[2024-05-24 19:17:03] [INFO ] [Real]Absence check using state equation in 3989 ms returned unknown
[2024-05-24 19:17:03] [INFO ] [Real]Absence check using 54 positive place invariants in 104 ms returned sat
[2024-05-24 19:17:04] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 233 ms returned sat
[2024-05-24 19:17:06] [INFO ] [Real]Absence check using state equation in 2643 ms returned sat
[2024-05-24 19:17:07] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:17:07] [INFO ] [Real]Added 2722 Read/Feed constraints in 190 ms returned sat
[2024-05-24 19:17:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:17:08] [INFO ] [Nat]Absence check using 54 positive place invariants in 109 ms returned sat
[2024-05-24 19:17:08] [INFO ] [Nat]Absence check using 54 positive and 595 generalized place invariants in 240 ms returned sat
[2024-05-24 19:17:11] [INFO ] [Nat]Absence check using state equation in 2710 ms returned sat
[2024-05-24 19:17:11] [INFO ] [Nat]Added 2722 Read/Feed constraints in 271 ms returned sat
[2024-05-24 19:17:21] [INFO ] Deduced a trap composed of 719 places in 9796 ms of which 332 ms to minimize.
[2024-05-24 19:17:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-24 19:17:22] [INFO ] [Real]Absence check using 54 positive place invariants in 123 ms returned sat
[2024-05-24 19:17:22] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 176 ms returned unsat
[2024-05-24 19:17:23] [INFO ] [Real]Absence check using 54 positive place invariants in 105 ms returned sat
[2024-05-24 19:17:23] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 196 ms returned unsat
[2024-05-24 19:17:24] [INFO ] [Real]Absence check using 54 positive place invariants in 104 ms returned sat
[2024-05-24 19:17:24] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 232 ms returned sat
[2024-05-24 19:17:28] [INFO ] [Real]Absence check using state equation in 4018 ms returned unknown
[2024-05-24 19:17:29] [INFO ] [Real]Absence check using 54 positive place invariants in 107 ms returned sat
[2024-05-24 19:17:29] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 178 ms returned unsat
[2024-05-24 19:17:30] [INFO ] [Real]Absence check using 54 positive place invariants in 106 ms returned sat
[2024-05-24 19:17:30] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 172 ms returned unsat
[2024-05-24 19:17:31] [INFO ] [Real]Absence check using 54 positive place invariants in 105 ms returned sat
[2024-05-24 19:17:31] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 237 ms returned sat
[2024-05-24 19:17:35] [INFO ] [Real]Absence check using state equation in 3960 ms returned unknown
[2024-05-24 19:17:36] [INFO ] [Real]Absence check using 54 positive place invariants in 100 ms returned sat
[2024-05-24 19:17:36] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 177 ms returned unsat
[2024-05-24 19:17:37] [INFO ] [Real]Absence check using 54 positive place invariants in 101 ms returned sat
[2024-05-24 19:17:37] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 166 ms returned unsat
[2024-05-24 19:17:38] [INFO ] [Real]Absence check using 54 positive place invariants in 100 ms returned sat
[2024-05-24 19:17:38] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 227 ms returned sat
[2024-05-24 19:17:41] [INFO ] [Real]Absence check using state equation in 2654 ms returned sat
[2024-05-24 19:17:41] [INFO ] [Real]Added 2722 Read/Feed constraints in 191 ms returned sat
[2024-05-24 19:17:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:17:42] [INFO ] [Nat]Absence check using 54 positive place invariants in 101 ms returned sat
[2024-05-24 19:17:43] [INFO ] [Nat]Absence check using 54 positive and 595 generalized place invariants in 221 ms returned sat
[2024-05-24 19:17:45] [INFO ] [Nat]Absence check using state equation in 2529 ms returned sat
[2024-05-24 19:17:45] [INFO ] [Nat]Added 2722 Read/Feed constraints in 228 ms returned sat
[2024-05-24 19:17:55] [INFO ] Deduced a trap composed of 86 places in 9514 ms of which 50 ms to minimize.
[2024-05-24 19:17:55] [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.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-24 19:17:56] [INFO ] [Real]Absence check using 54 positive place invariants in 104 ms returned sat
[2024-05-24 19:17:56] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 244 ms returned sat
[2024-05-24 19:18:00] [INFO ] [Real]Absence check using state equation in 3994 ms returned unknown
[2024-05-24 19:18:01] [INFO ] [Real]Absence check using 54 positive place invariants in 103 ms returned sat
[2024-05-24 19:18:01] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 182 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1] Max Struct:[1, 51, 1, 1, 1, 17, 1, 1, 51, 1, 1, 1, 51, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[51, 1, 17, 51, 1, 51]
Support contains 6 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.26 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2172 transitions
Trivial Post-agglo rules discarded 2172 transitions
Performed 2172 trivial Post agglomeration. Transition count delta: 2172
Iterating post reduction 0 with 2172 rules applied. Total rules applied 2173 place count 6840 transition count 7399
Reduce places removed 2172 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4348 place count 4668 transition count 7396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 7 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1900 places :
Symmetric choice reduction at 3 with 1900 rule applications. Total rules 6795 place count 2493 transition count 5224
Iterating global reduction 3 with 1900 rules applied. Total rules applied 8695 place count 2493 transition count 5224
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 8695 place count 2493 transition count 5212
Deduced a syphon composed of 12 places in 9 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 8719 place count 2481 transition count 5212
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 8953 place count 2247 transition count 3340
Iterating global reduction 3 with 234 rules applied. Total rules applied 9187 place count 2247 transition count 3340
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9221 place count 2230 transition count 3323
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 9384 place count 2230 transition count 4798
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 9547 place count 2067 transition count 4798
Partial Free-agglomeration rule applied 68 times.
Drop transitions (Partial Free agglomeration) removed 68 transitions
Iterating global reduction 4 with 68 rules applied. Total rules applied 9615 place count 2067 transition count 4798
Applied a total of 9615 rules in 2634 ms. Remains 2067 /6876 variables (removed 4809) and now considering 4798/9571 (removed 4773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2647 ms. Remains : 2067/6876 places, 4798/9571 transitions.
[2024-05-24 19:18:04] [INFO ] Flow matrix only has 4401 transitions (discarded 397 similar events)
// Phase 1: matrix 4401 rows 2067 cols
[2024-05-24 19:18:04] [INFO ] Computed 613 invariants in 120 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 1, 2, 1, 2]
RANDOM walk for 1000000 steps (20083 resets) in 20360 ms. (49 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000003 steps (19391 resets) in 23327 ms. (214 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[2, 1, 2, 1, 2]
[2024-05-24 19:18:48] [INFO ] Flow matrix only has 4401 transitions (discarded 397 similar events)
[2024-05-24 19:18:48] [INFO ] Invariant cache hit.
[2024-05-24 19:18:48] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-24 19:18:48] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 108 ms returned sat
[2024-05-24 19:18:49] [INFO ] [Real]Absence check using state equation in 1396 ms returned sat
[2024-05-24 19:18:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:18:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-24 19:18:50] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 118 ms returned sat
[2024-05-24 19:18:51] [INFO ] [Nat]Absence check using state equation in 1362 ms returned sat
[2024-05-24 19:18:51] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:18:52] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1070 ms returned sat
[2024-05-24 19:18:54] [INFO ] Deduced a trap composed of 224 places in 1756 ms of which 16 ms to minimize.
[2024-05-24 19:18:57] [INFO ] Deduced a trap composed of 379 places in 1731 ms of which 14 ms to minimize.
[2024-05-24 19:19:00] [INFO ] Deduced a trap composed of 376 places in 1779 ms of which 14 ms to minimize.
[2024-05-24 19:19:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7541 ms
[2024-05-24 19:19:00] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 484 ms.
[2024-05-24 19:19:02] [INFO ] Added : 17 causal constraints over 4 iterations in 1782 ms. Result :sat
Minimization took 5054 ms.
[2024-05-24 19:19:07] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:19:07] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2024-05-24 19:19:08] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2024-05-24 19:19:09] [INFO ] [Real]Added 2722 Read/Feed constraints in 638 ms returned sat
[2024-05-24 19:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:19:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 49 ms returned sat
[2024-05-24 19:19:10] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 93 ms returned sat
[2024-05-24 19:19:11] [INFO ] [Nat]Absence check using state equation in 1444 ms returned sat
[2024-05-24 19:19:14] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2424 ms returned sat
[2024-05-24 19:19:15] [INFO ] Deduced a trap composed of 380 places in 1826 ms of which 16 ms to minimize.
[2024-05-24 19:19:18] [INFO ] Deduced a trap composed of 225 places in 2014 ms of which 14 ms to minimize.
[2024-05-24 19:19:20] [INFO ] Deduced a trap composed of 250 places in 1932 ms of which 15 ms to minimize.
[2024-05-24 19:19:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6336 ms
[2024-05-24 19:19:21] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 895 ms.
[2024-05-24 19:19:22] [INFO ] Added : 23 causal constraints over 5 iterations in 2327 ms. Result :sat
Minimization took 5607 ms.
[2024-05-24 19:19:28] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:19:28] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 31 ms returned unsat
[2024-05-24 19:19:28] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2024-05-24 19:19:28] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 110 ms returned sat
[2024-05-24 19:19:30] [INFO ] [Real]Absence check using state equation in 1580 ms returned sat
[2024-05-24 19:19:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:19:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-24 19:19:31] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 92 ms returned sat
[2024-05-24 19:19:32] [INFO ] [Nat]Absence check using state equation in 1602 ms returned sat
[2024-05-24 19:19:35] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2548 ms returned sat
[2024-05-24 19:19:37] [INFO ] Deduced a trap composed of 401 places in 1832 ms of which 15 ms to minimize.
[2024-05-24 19:19:40] [INFO ] Deduced a trap composed of 445 places in 1886 ms of which 14 ms to minimize.
[2024-05-24 19:19:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5236 ms
[2024-05-24 19:19:40] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 309 ms.
[2024-05-24 19:19:42] [INFO ] Added : 23 causal constraints over 5 iterations in 1771 ms. Result :sat
Minimization took 5679 ms.
[2024-05-24 19:19:48] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-24 19:19:48] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2024-05-24 19:19:49] [INFO ] [Real]Absence check using state equation in 1366 ms returned sat
[2024-05-24 19:19:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:19:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:19:50] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2024-05-24 19:19:51] [INFO ] [Nat]Absence check using state equation in 1408 ms returned sat
[2024-05-24 19:19:52] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1414 ms returned sat
[2024-05-24 19:19:54] [INFO ] Deduced a trap composed of 295 places in 1819 ms of which 16 ms to minimize.
[2024-05-24 19:19:57] [INFO ] Deduced a trap composed of 298 places in 1817 ms of which 14 ms to minimize.
[2024-05-24 19:19:59] [INFO ] Deduced a trap composed of 353 places in 1704 ms of which 13 ms to minimize.
[2024-05-24 19:20:02] [INFO ] Deduced a trap composed of 387 places in 1718 ms of which 13 ms to minimize.
[2024-05-24 19:20:05] [INFO ] Deduced a trap composed of 362 places in 1772 ms of which 14 ms to minimize.
[2024-05-24 19:20:07] [INFO ] Deduced a trap composed of 276 places in 1681 ms of which 14 ms to minimize.
[2024-05-24 19:20:10] [INFO ] Deduced a trap composed of 307 places in 1741 ms of which 13 ms to minimize.
[2024-05-24 19:20:15] [INFO ] Deduced a trap composed of 274 places in 1831 ms of which 14 ms to minimize.
[2024-05-24 19:20:18] [INFO ] Deduced a trap composed of 260 places in 1699 ms of which 13 ms to minimize.
[2024-05-24 19:20:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 26939 ms
[2024-05-24 19:20:20] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 276 ms.
[2024-05-24 19:20:21] [INFO ] Added : 19 causal constraints over 4 iterations in 1636 ms. Result :sat
Minimization took 5043 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[2, 1, 1, 1, 2]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 1, 2]
Support contains 4 out of 2067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2067/2067 places, 4798/4798 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2067 transition count 4797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2066 transition count 4797
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2066 transition count 4795
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 2064 transition count 4795
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 2062 transition count 4793
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 2062 transition count 4793
Applied a total of 10 rules in 469 ms. Remains 2062 /2067 variables (removed 5) and now considering 4793/4798 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 2062/2067 places, 4793/4798 transitions.
[2024-05-24 19:20:27] [INFO ] Flow matrix only has 4396 transitions (discarded 397 similar events)
// Phase 1: matrix 4396 rows 2062 cols
[2024-05-24 19:20:27] [INFO ] Computed 613 invariants in 66 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[2, 1, 1, 2]
RANDOM walk for 1000000 steps (20079 resets) in 20171 ms. (49 steps per ms)
BEST_FIRST walk for 4000002 steps (15512 resets) in 18679 ms. (214 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[2, 1, 1, 2]
[2024-05-24 19:21:05] [INFO ] Flow matrix only has 4396 transitions (discarded 397 similar events)
[2024-05-24 19:21:05] [INFO ] Invariant cache hit.
[2024-05-24 19:21:06] [INFO ] [Real]Absence check using 33 positive place invariants in 46 ms returned sat
[2024-05-24 19:21:06] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 109 ms returned sat
[2024-05-24 19:21:07] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2024-05-24 19:21:07] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:21:08] [INFO ] [Real]Added 2722 Read/Feed constraints in 573 ms returned sat
[2024-05-24 19:21:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:21:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 41 ms returned sat
[2024-05-24 19:21:08] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2024-05-24 19:21:10] [INFO ] [Nat]Absence check using state equation in 1283 ms returned sat
[2024-05-24 19:21:12] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1968 ms returned sat
[2024-05-24 19:21:14] [INFO ] Deduced a trap composed of 266 places in 1787 ms of which 14 ms to minimize.
[2024-05-24 19:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2922 ms
[2024-05-24 19:21:15] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2699 transitions) in 319 ms.
[2024-05-24 19:21:16] [INFO ] Added : 18 causal constraints over 4 iterations in 1666 ms. Result :sat
Minimization took 5061 ms.
[2024-05-24 19:21:22] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2024-05-24 19:21:22] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 93 ms returned sat
[2024-05-24 19:21:23] [INFO ] [Real]Absence check using state equation in 1152 ms returned sat
[2024-05-24 19:21:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:21:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:21:23] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2024-05-24 19:21:25] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2024-05-24 19:21:27] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2254 ms returned sat
[2024-05-24 19:21:29] [INFO ] Deduced a trap composed of 395 places in 1790 ms of which 14 ms to minimize.
[2024-05-24 19:21:31] [INFO ] Deduced a trap composed of 232 places in 2001 ms of which 17 ms to minimize.
[2024-05-24 19:21:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4218 ms
[2024-05-24 19:21:31] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2699 transitions) in 312 ms.
[2024-05-24 19:21:33] [INFO ] Added : 23 causal constraints over 5 iterations in 2137 ms. Result :sat
Minimization took 5452 ms.
[2024-05-24 19:21:39] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-24 19:21:39] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 104 ms returned sat
[2024-05-24 19:21:40] [INFO ] [Real]Absence check using state equation in 1334 ms returned sat
[2024-05-24 19:21:41] [INFO ] [Real]Added 2722 Read/Feed constraints in 266 ms returned sat
[2024-05-24 19:21:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:21:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-24 19:21:41] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 108 ms returned sat
[2024-05-24 19:21:43] [INFO ] [Nat]Absence check using state equation in 1364 ms returned sat
[2024-05-24 19:21:46] [INFO ] [Nat]Added 2722 Read/Feed constraints in 3792 ms returned sat
[2024-05-24 19:21:48] [INFO ] Deduced a trap composed of 284 places in 1948 ms of which 13 ms to minimize.
[2024-05-24 19:21:50] [INFO ] Deduced a trap composed of 274 places in 1874 ms of which 14 ms to minimize.
[2024-05-24 19:21:52] [INFO ] Deduced a trap composed of 301 places in 1805 ms of which 13 ms to minimize.
[2024-05-24 19:21:54] [INFO ] Deduced a trap composed of 276 places in 1908 ms of which 16 ms to minimize.
[2024-05-24 19:21:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8236 ms
[2024-05-24 19:21:55] [INFO ] Computed and/alt/rep : 1680/4435/1680 causal constraints (skipped 2699 transitions) in 302 ms.
[2024-05-24 19:21:57] [INFO ] Added : 26 causal constraints over 6 iterations in 1964 ms. Result :sat
Minimization took 5479 ms.
[2024-05-24 19:22:02] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 19:22:02] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 26 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[2, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 2062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2062/2062 places, 4793/4793 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2062 transition count 4792
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2061 transition count 4792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 2060 transition count 4791
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 2060 transition count 4791
Applied a total of 4 rules in 430 ms. Remains 2060 /2062 variables (removed 2) and now considering 4791/4793 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 2060/2062 places, 4791/4793 transitions.
[2024-05-24 19:22:03] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
// Phase 1: matrix 4394 rows 2060 cols
[2024-05-24 19:22:03] [INFO ] Computed 613 invariants in 72 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
RANDOM walk for 1000000 steps (20073 resets) in 19760 ms. (50 steps per ms)
BEST_FIRST walk for 3000001 steps (11634 resets) in 13939 ms. (215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
[2024-05-24 19:22:36] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
[2024-05-24 19:22:36] [INFO ] Invariant cache hit.
[2024-05-24 19:22:37] [INFO ] [Real]Absence check using 33 positive place invariants in 44 ms returned sat
[2024-05-24 19:22:37] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 102 ms returned sat
[2024-05-24 19:22:38] [INFO ] [Real]Absence check using state equation in 1335 ms returned sat
[2024-05-24 19:22:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:22:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 41 ms returned sat
[2024-05-24 19:22:39] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2024-05-24 19:22:40] [INFO ] [Nat]Absence check using state equation in 1187 ms returned sat
[2024-05-24 19:22:40] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:22:41] [INFO ] [Nat]Added 2722 Read/Feed constraints in 944 ms returned sat
[2024-05-24 19:22:43] [INFO ] Deduced a trap composed of 222 places in 1712 ms of which 15 ms to minimize.
[2024-05-24 19:22:46] [INFO ] Deduced a trap composed of 369 places in 1752 ms of which 17 ms to minimize.
[2024-05-24 19:22:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5542 ms
[2024-05-24 19:22:47] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 309 ms.
[2024-05-24 19:22:48] [INFO ] Added : 18 causal constraints over 4 iterations in 1708 ms. Result :sat
Minimization took 5131 ms.
[2024-05-24 19:22:53] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-24 19:22:54] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 113 ms returned sat
[2024-05-24 19:22:55] [INFO ] [Real]Absence check using state equation in 1325 ms returned sat
[2024-05-24 19:22:56] [INFO ] [Real]Added 2722 Read/Feed constraints in 589 ms returned sat
[2024-05-24 19:22:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:22:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 46 ms returned sat
[2024-05-24 19:22:56] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 101 ms returned sat
[2024-05-24 19:22:57] [INFO ] [Nat]Absence check using state equation in 1211 ms returned sat
[2024-05-24 19:22:59] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1612 ms returned sat
[2024-05-24 19:23:01] [INFO ] Deduced a trap composed of 392 places in 1731 ms of which 14 ms to minimize.
[2024-05-24 19:23:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1994 ms
[2024-05-24 19:23:01] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 294 ms.
[2024-05-24 19:23:03] [INFO ] Added : 23 causal constraints over 5 iterations in 1823 ms. Result :sat
Minimization took 5133 ms.
[2024-05-24 19:23:08] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-24 19:23:08] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 124 ms returned sat
[2024-05-24 19:23:10] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2024-05-24 19:23:10] [INFO ] [Real]Added 2722 Read/Feed constraints in 292 ms returned sat
[2024-05-24 19:23:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:23:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 40 ms returned sat
[2024-05-24 19:23:10] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 98 ms returned sat
[2024-05-24 19:23:12] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2024-05-24 19:23:14] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2730 ms returned sat
[2024-05-24 19:23:16] [INFO ] Deduced a trap composed of 238 places in 1752 ms of which 13 ms to minimize.
[2024-05-24 19:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2022 ms
[2024-05-24 19:23:17] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 288 ms.
[2024-05-24 19:23:18] [INFO ] Added : 19 causal constraints over 4 iterations in 1462 ms. Result :sat
Minimization took 5128 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 2060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2060/2060 places, 4791/4791 transitions.
Applied a total of 0 rules in 175 ms. Remains 2060 /2060 variables (removed 0) and now considering 4791/4791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 2060/2060 places, 4791/4791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2060/2060 places, 4791/4791 transitions.
Applied a total of 0 rules in 167 ms. Remains 2060 /2060 variables (removed 0) and now considering 4791/4791 (removed 0) transitions.
[2024-05-24 19:23:23] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
[2024-05-24 19:23:23] [INFO ] Invariant cache hit.
[2024-05-24 19:23:29] [INFO ] Implicit Places using invariants in 5640 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 327, 330, 332, 336, 342, 350, 360, 371, 381, 382, 383, 384, 385, 386, 387, 388, 389, 397, 403, 407, 409, 411, 413, 432, 438, 440, 441, 442, 443, 444, 445, 446, 447, 448, 450, 452, 454, 458, 464, 472, 481, 489, 490, 491, 492, 493, 494, 495, 496, 497, 503, 507, 509, 511, 513, 515, 534, 540, 542, 543, 544, 545, 546, 547, 548, 549, 550, 552, 554, 556, 558, 562, 568, 575, 581, 582, 583, 584, 585, 586, 587, 588, 589, 593, 595, 597, 599, 601, 603, 622, 628, 630, 631, 632, 633, 634, 635, 636, 637, 638, 640, 642, 644, 646, 648, 652, 657, 661, 662, 663, 664, 665, 666, 667, 668, 669, 671, 673, 675, 677, 679, 681, 700, 706, 708, 709, 710, 711, 712, 713, 714, 715, 716, 718, 720, 722, 724, 726, 728, 731, 733, 734, 735, 736, 737, 738, 739, 740, 741, 743, 745, 747, 749, 751, 753, 772, 778, 780, 781, 782, 783, 784, 785, 786, 787, 788, 790, 792, 794, 796, 798, 800, 802, 804, 805, 806, 807, 808, 809, 810, 811, 812, 814, 816, 818, 820, 822, 824, 843, 845, 848, 850, 851, 852, 853, 854, 855, 856, 857, 858, 860, 862, 864, 866, 868, 870, 872, 874, 875, 876, 877, 878, 879, 880, 881, 882, 884, 886, 888, 890, 892, 894, 913, 919, 921, 922, 923, 924, 925, 926, 927, 928, 929, 931, 933, 935, 937, 939, 941, 943, 945, 946, 947, 948, 949, 950, 951, 952, 953, 955, 957, 959, 961, 963, 965, 984, 990, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1002, 1004, 1006, 1008, 1010, 1012, 1014, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1035, 1037, 1056, 1062, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1074, 1076, 1078, 1080, 1082, 1084, 1088, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1105, 1107, 1109, 1111, 1113, 1115, 1134, 1140, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1152, 1154, 1156, 1158, 1160, 1164, 1170, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1191, 1195, 1197, 1199, 1201, 1203, 1222, 1228, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1240, 1242, 1244, 1246, 1250, 1256, 1264, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1289, 1295, 1299, 1302, 1304, 1306, 1325, 1331, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1343, 1345, 1347, 1351, 1357, 1365, 1375, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1404, 1412, 1418, 1422, 1424, 1426, 1445, 1451, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1463, 1465, 1469, 1475, 1483, 1493, 1505, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1538, 1548, 1556, 1562, 1566, 1568, 1587, 1589, 1592, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1604, 1608, 1614, 1622, 1632, 1644, 1658, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1695, 1707, 1717, 1725, 1731, 1735, 1754]
[2024-05-24 19:23:29] [INFO ] Actually due to overlaps returned [169, 311, 432, 534, 622, 700, 772, 843, 913, 984, 1056, 1134, 1222, 1325, 1445, 1587, 1754, 4, 9, 10, 11, 12, 13, 14, 15, 16, 100, 101, 102, 103, 104, 105, 106, 107, 177, 178, 179, 180, 181, 182, 183, 184, 252, 253, 254, 255, 256, 257, 258, 259, 319, 320, 321, 322, 323, 324, 325, 381, 382, 383, 384, 385, 386, 387, 388, 440, 441, 442, 443, 444, 445, 446, 447, 489, 490, 491, 492, 493, 494, 495, 496, 542, 543, 544, 545, 546, 547, 548, 549, 581, 582, 583, 584, 585, 586, 587, 588, 630, 631, 632, 633, 634, 635, 636, 637, 661, 662, 663, 664, 665, 666, 667, 668, 708, 709, 710, 711, 712, 713, 714, 715, 733, 734, 735, 736, 737, 738, 739, 740, 780, 781, 782, 783, 784, 785, 786, 787, 804, 805, 806, 807, 808, 809, 810, 811, 845, 850, 851, 852, 853, 854, 855, 856, 857, 874, 875, 876, 877, 878, 879, 880, 881, 921, 922, 923, 924, 925, 926, 927, 928, 945, 946, 947, 948, 949, 950, 951, 952, 992, 993, 994, 995, 996, 997, 998, 999, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1589, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680]
Discarding 291 places :
Implicit Place search using SMT only with invariants took 5666 ms to find 291 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1769/2060 places, 4791/4791 transitions.
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 255 place count 1514 transition count 4536
Iterating global reduction 0 with 255 rules applied. Total rules applied 510 place count 1514 transition count 4536
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 765 place count 1259 transition count 4281
Iterating global reduction 0 with 255 rules applied. Total rules applied 1020 place count 1259 transition count 4281
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1023 place count 1259 transition count 4278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1026 place count 1256 transition count 4278
Applied a total of 1026 rules in 362 ms. Remains 1256 /1769 variables (removed 513) and now considering 4278/4791 (removed 513) transitions.
[2024-05-24 19:23:29] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 1256 cols
[2024-05-24 19:23:29] [INFO ] Computed 322 invariants in 39 ms
[2024-05-24 19:23:32] [INFO ] Implicit Places using invariants in 2839 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 156, 158, 160, 164, 170, 178, 188, 200, 213, 225, 235, 243, 249, 253, 255, 257, 265, 268, 271, 273, 277, 283, 291, 301, 312, 322, 330, 336, 340, 342, 344, 346, 355, 357, 359, 361, 363, 367, 373, 381, 390, 398, 404, 408, 410, 412, 414, 416, 424, 426, 428, 430, 432, 434, 438, 444, 451, 457, 461, 463, 465, 467, 469, 471, 479, 481, 483, 485, 487, 489, 491, 495, 500, 504, 506, 508, 510, 512, 514, 516, 524, 526, 528, 530, 532, 534, 536, 538, 541, 543, 545, 547, 549, 551, 553, 555, 563, 565, 567, 569, 571, 573, 575, 577, 579, 581, 583, 585, 587, 589, 591, 593, 599, 601, 603, 605, 607, 609, 611, 613, 615, 617, 619, 621, 623, 625, 627, 629, 636, 638, 640, 642, 644, 646, 648, 650, 652, 654, 656, 658, 660, 662, 664, 666, 674, 676, 678, 680, 682, 684, 686, 688, 690, 693, 695, 697, 699, 701, 703, 705, 713, 715, 717, 719, 721, 723, 725, 727, 731, 736, 740, 742, 744, 746, 748, 750, 758, 760, 762, 764, 766, 768, 770, 774, 780, 787, 793, 797, 799, 801, 803, 805, 813, 815, 817, 819, 821, 823, 827, 833, 841, 850, 858, 864, 868, 871, 873, 875, 883, 885, 887, 889, 891, 895, 901, 909, 919, 930, 940, 948, 954, 958, 960, 962, 970, 972, 974, 976, 980, 986, 994, 1004, 1016, 1029, 1041, 1051, 1059, 1065, 1069, 1071, 1077, 1079, 1081, 1085, 1091, 1099, 1109, 1121, 1135, 1150, 1164, 1176, 1186, 1194, 1200, 1204]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2858 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 984/2060 places, 4278/4791 transitions.
Applied a total of 0 rules in 121 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9179 ms. Remains : 984/2060 places, 4278/4791 transitions.
[2024-05-24 19:23:32] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-24 19:23:32] [INFO ] Computed 50 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
RANDOM walk for 1000000 steps (21026 resets) in 18725 ms. (53 steps per ms)
BEST_FIRST walk for 3000001 steps (9064 resets) in 10317 ms. (290 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
[2024-05-24 19:24:01] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:24:01] [INFO ] Invariant cache hit.
[2024-05-24 19:24:02] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:24:02] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:24:02] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2024-05-24 19:24:03] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:24:03] [INFO ] [Real]Added 2722 Read/Feed constraints in 266 ms returned sat
[2024-05-24 19:24:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:24:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:24:03] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:24:04] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2024-05-24 19:24:05] [INFO ] [Nat]Added 2722 Read/Feed constraints in 652 ms returned sat
[2024-05-24 19:24:05] [INFO ] Deduced a trap composed of 171 places in 528 ms of which 6 ms to minimize.
[2024-05-24 19:24:06] [INFO ] Deduced a trap composed of 174 places in 530 ms of which 6 ms to minimize.
[2024-05-24 19:24:07] [INFO ] Deduced a trap composed of 185 places in 545 ms of which 6 ms to minimize.
[2024-05-24 19:24:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2624 ms
[2024-05-24 19:24:07] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 228 ms.
[2024-05-24 19:24:08] [INFO ] Added : 15 causal constraints over 3 iterations in 826 ms. Result :sat
Minimization took 5385 ms.
[2024-05-24 19:24:14] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2024-05-24 19:24:14] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-24 19:24:14] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2024-05-24 19:24:15] [INFO ] [Real]Added 2722 Read/Feed constraints in 280 ms returned sat
[2024-05-24 19:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:24:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:24:15] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2024-05-24 19:24:16] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2024-05-24 19:24:17] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1314 ms returned sat
[2024-05-24 19:24:17] [INFO ] Deduced a trap composed of 197 places in 522 ms of which 6 ms to minimize.
[2024-05-24 19:24:18] [INFO ] Deduced a trap composed of 69 places in 622 ms of which 8 ms to minimize.
[2024-05-24 19:24:19] [INFO ] Deduced a trap composed of 80 places in 631 ms of which 6 ms to minimize.
[2024-05-24 19:24:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2139 ms
[2024-05-24 19:24:19] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 231 ms.
[2024-05-24 19:24:20] [INFO ] Added : 21 causal constraints over 5 iterations in 1077 ms. Result :sat
Minimization took 5414 ms.
[2024-05-24 19:24:26] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2024-05-24 19:24:26] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-24 19:24:26] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2024-05-24 19:24:27] [INFO ] [Real]Added 2722 Read/Feed constraints in 232 ms returned sat
[2024-05-24 19:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:24:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:24:27] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:24:28] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2024-05-24 19:24:29] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1163 ms returned sat
[2024-05-24 19:24:30] [INFO ] Deduced a trap composed of 164 places in 533 ms of which 5 ms to minimize.
[2024-05-24 19:24:30] [INFO ] Deduced a trap composed of 83 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:24:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1399 ms
[2024-05-24 19:24:31] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 332 ms.
[2024-05-24 19:24:32] [INFO ] Added : 13 causal constraints over 4 iterations in 1110 ms. Result :sat
Minimization took 5387 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 134 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 984/984 places, 4278/4278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 128 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
[2024-05-24 19:24:37] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:24:37] [INFO ] Invariant cache hit.
[2024-05-24 19:24:39] [INFO ] Implicit Places using invariants in 1273 ms returned []
[2024-05-24 19:24:39] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:24:39] [INFO ] Invariant cache hit.
[2024-05-24 19:24:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:25:10] [INFO ] Performed 659/984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:25:22] [INFO ] Implicit Places using invariants and state equation in 43372 ms returned []
Implicit Place search using SMT with State Equation took 44661 ms to find 0 implicit places.
[2024-05-24 19:25:22] [INFO ] Redundant transitions in 279 ms returned []
Running 4216 sub problems to find dead transitions.
[2024-05-24 19:25:22] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:25:22] [INFO ] Invariant cache hit.
[2024-05-24 19:25:22] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/982 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4216 unsolved
SMT process timed out in 62025ms, After SMT, problems are : Problem set: 0 solved, 4216 unsolved
Search for dead transitions found 0 dead transitions in 62083ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107189 ms. Remains : 984/984 places, 4278/4278 transitions.
RANDOM walk for 40000 steps (840 resets) in 1300 ms. (30 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (119 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (120 resets) in 413 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (118 resets) in 372 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (121 resets) in 520 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (118 resets) in 338 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (121 resets) in 331 ms. (120 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 54339 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 6
Probabilistic random walk after 54339 steps, saw 22956 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 19:26:28] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:26:28] [INFO ] Invariant cache hit.
[2024-05-24 19:26:28] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 19:26:29] [INFO ] Deduced a trap composed of 100 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:26:30] [INFO ] Deduced a trap composed of 90 places in 599 ms of which 6 ms to minimize.
[2024-05-24 19:26:31] [INFO ] Deduced a trap composed of 232 places in 591 ms of which 5 ms to minimize.
[2024-05-24 19:26:31] [INFO ] Deduced a trap composed of 83 places in 610 ms of which 5 ms to minimize.
[2024-05-24 19:26:32] [INFO ] Deduced a trap composed of 221 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:26:33] [INFO ] Deduced a trap composed of 132 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:26:33] [INFO ] Deduced a trap composed of 83 places in 553 ms of which 6 ms to minimize.
[2024-05-24 19:26:34] [INFO ] Deduced a trap composed of 84 places in 588 ms of which 6 ms to minimize.
SMT process timed out in 5471ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 131 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 984/984 places, 4278/4278 transitions.
RANDOM walk for 40000 steps (840 resets) in 2273 ms. (17 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (119 resets) in 538 ms. (74 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (118 resets) in 434 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (118 resets) in 386 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (120 resets) in 439 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (118 resets) in 405 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (116 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 51752 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 6
Probabilistic random walk after 51752 steps, saw 21870 distinct states, run finished after 3007 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-24 19:26:38] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:26:38] [INFO ] Invariant cache hit.
[2024-05-24 19:26:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 19:26:39] [INFO ] Deduced a trap composed of 100 places in 546 ms of which 6 ms to minimize.
[2024-05-24 19:26:40] [INFO ] Deduced a trap composed of 90 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:26:41] [INFO ] Deduced a trap composed of 232 places in 543 ms of which 6 ms to minimize.
[2024-05-24 19:26:41] [INFO ] Deduced a trap composed of 83 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:26:42] [INFO ] Deduced a trap composed of 221 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:26:43] [INFO ] Deduced a trap composed of 132 places in 581 ms of which 6 ms to minimize.
[2024-05-24 19:26:43] [INFO ] Deduced a trap composed of 83 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:26:44] [INFO ] Deduced a trap composed of 84 places in 557 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 35/940 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 28/968 variables, 28/42 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 16/984 variables, 16/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3881/4865 variables, 984/1042 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4865 variables, 2722/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4865/4865 variables, and 3764 constraints, problems are : Problem set: 1 solved, 5 unsolved in 7952 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 984/984 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 19:26:47] [INFO ] Deduced a trap composed of 257 places in 606 ms of which 5 ms to minimize.
[2024-05-24 19:26:48] [INFO ] Deduced a trap composed of 90 places in 607 ms of which 6 ms to minimize.
[2024-05-24 19:26:49] [INFO ] Deduced a trap composed of 115 places in 608 ms of which 7 ms to minimize.
[2024-05-24 19:26:49] [INFO ] Deduced a trap composed of 84 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:26:50] [INFO ] Deduced a trap composed of 224 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:26:51] [INFO ] Deduced a trap composed of 83 places in 601 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 6/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 35/940 variables, 3/20 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 19:26:51] [INFO ] Deduced a trap composed of 5 places in 653 ms of which 7 ms to minimize.
[2024-05-24 19:26:52] [INFO ] Deduced a trap composed of 74 places in 664 ms of which 6 ms to minimize.
[2024-05-24 19:26:53] [INFO ] Deduced a trap composed of 68 places in 668 ms of which 6 ms to minimize.
[2024-05-24 19:26:53] [INFO ] Deduced a trap composed of 62 places in 629 ms of which 6 ms to minimize.
[2024-05-24 19:26:54] [INFO ] Deduced a trap composed of 64 places in 636 ms of which 5 ms to minimize.
[2024-05-24 19:26:55] [INFO ] Deduced a trap composed of 67 places in 651 ms of which 6 ms to minimize.
[2024-05-24 19:26:55] [INFO ] Deduced a trap composed of 93 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:26:56] [INFO ] Deduced a trap composed of 60 places in 652 ms of which 7 ms to minimize.
[2024-05-24 19:26:57] [INFO ] Deduced a trap composed of 57 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:26:57] [INFO ] Deduced a trap composed of 61 places in 625 ms of which 6 ms to minimize.
[2024-05-24 19:26:58] [INFO ] Deduced a trap composed of 76 places in 646 ms of which 6 ms to minimize.
[2024-05-24 19:26:59] [INFO ] Deduced a trap composed of 61 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:26:59] [INFO ] Deduced a trap composed of 73 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:27:00] [INFO ] Deduced a trap composed of 70 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:27:01] [INFO ] Deduced a trap composed of 78 places in 655 ms of which 6 ms to minimize.
[2024-05-24 19:27:01] [INFO ] Deduced a trap composed of 76 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:27:02] [INFO ] Deduced a trap composed of 153 places in 636 ms of which 6 ms to minimize.
[2024-05-24 19:27:03] [INFO ] Deduced a trap composed of 65 places in 650 ms of which 6 ms to minimize.
[2024-05-24 19:27:03] [INFO ] Deduced a trap composed of 59 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:27:04] [INFO ] Deduced a trap composed of 27 places in 636 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 19:27:05] [INFO ] Deduced a trap composed of 60 places in 664 ms of which 6 ms to minimize.
[2024-05-24 19:27:05] [INFO ] Deduced a trap composed of 81 places in 665 ms of which 6 ms to minimize.
[2024-05-24 19:27:06] [INFO ] Deduced a trap composed of 74 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:27:07] [INFO ] Deduced a trap composed of 77 places in 651 ms of which 6 ms to minimize.
[2024-05-24 19:27:07] [INFO ] Deduced a trap composed of 62 places in 662 ms of which 6 ms to minimize.
[2024-05-24 19:27:08] [INFO ] Deduced a trap composed of 61 places in 665 ms of which 6 ms to minimize.
[2024-05-24 19:27:09] [INFO ] Deduced a trap composed of 65 places in 684 ms of which 7 ms to minimize.
[2024-05-24 19:27:09] [INFO ] Deduced a trap composed of 59 places in 684 ms of which 6 ms to minimize.
[2024-05-24 19:27:10] [INFO ] Deduced a trap composed of 53 places in 676 ms of which 6 ms to minimize.
[2024-05-24 19:27:11] [INFO ] Deduced a trap composed of 57 places in 678 ms of which 8 ms to minimize.
[2024-05-24 19:27:11] [INFO ] Deduced a trap composed of 59 places in 660 ms of which 6 ms to minimize.
[2024-05-24 19:27:12] [INFO ] Deduced a trap composed of 59 places in 671 ms of which 6 ms to minimize.
[2024-05-24 19:27:13] [INFO ] Deduced a trap composed of 64 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:27:13] [INFO ] Deduced a trap composed of 59 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:27:14] [INFO ] Deduced a trap composed of 69 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:27:15] [INFO ] Deduced a trap composed of 83 places in 631 ms of which 6 ms to minimize.
[2024-05-24 19:27:15] [INFO ] Deduced a trap composed of 56 places in 579 ms of which 5 ms to minimize.
[2024-05-24 19:27:16] [INFO ] Deduced a trap composed of 59 places in 626 ms of which 6 ms to minimize.
[2024-05-24 19:27:17] [INFO ] Deduced a trap composed of 67 places in 655 ms of which 7 ms to minimize.
[2024-05-24 19:27:17] [INFO ] Deduced a trap composed of 56 places in 665 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 20/60 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 19:27:18] [INFO ] Deduced a trap composed of 159 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:27:19] [INFO ] Deduced a trap composed of 67 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:27:19] [INFO ] Deduced a trap composed of 64 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:27:20] [INFO ] Deduced a trap composed of 58 places in 629 ms of which 5 ms to minimize.
[2024-05-24 19:27:21] [INFO ] Deduced a trap composed of 78 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:27:21] [INFO ] Deduced a trap composed of 84 places in 646 ms of which 6 ms to minimize.
[2024-05-24 19:27:22] [INFO ] Deduced a trap composed of 92 places in 630 ms of which 5 ms to minimize.
[2024-05-24 19:27:23] [INFO ] Deduced a trap composed of 59 places in 636 ms of which 6 ms to minimize.
[2024-05-24 19:27:23] [INFO ] Deduced a trap composed of 59 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:27:24] [INFO ] Deduced a trap composed of 58 places in 635 ms of which 16 ms to minimize.
[2024-05-24 19:27:24] [INFO ] Deduced a trap composed of 70 places in 635 ms of which 5 ms to minimize.
[2024-05-24 19:27:25] [INFO ] Deduced a trap composed of 75 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:27:26] [INFO ] Deduced a trap composed of 135 places in 629 ms of which 6 ms to minimize.
[2024-05-24 19:27:26] [INFO ] Deduced a trap composed of 27 places in 519 ms of which 6 ms to minimize.
[2024-05-24 19:27:27] [INFO ] Deduced a trap composed of 136 places in 522 ms of which 5 ms to minimize.
[2024-05-24 19:27:27] [INFO ] Deduced a trap composed of 46 places in 621 ms of which 5 ms to minimize.
[2024-05-24 19:27:28] [INFO ] Deduced a trap composed of 129 places in 523 ms of which 5 ms to minimize.
[2024-05-24 19:27:29] [INFO ] Deduced a trap composed of 128 places in 542 ms of which 6 ms to minimize.
[2024-05-24 19:27:29] [INFO ] Deduced a trap composed of 46 places in 531 ms of which 6 ms to minimize.
[2024-05-24 19:27:30] [INFO ] Deduced a trap composed of 63 places in 514 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 20/80 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-24 19:27:30] [INFO ] Deduced a trap composed of 74 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:27:31] [INFO ] Deduced a trap composed of 69 places in 629 ms of which 6 ms to minimize.
[2024-05-24 19:27:32] [INFO ] Deduced a trap composed of 91 places in 649 ms of which 5 ms to minimize.
SMT process timed out in 53141ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 129 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 984/984 places, 4278/4278 transitions.
RANDOM walk for 40000 steps (840 resets) in 2082 ms. (19 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (119 resets) in 342 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (119 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (116 resets) in 387 ms. (103 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (118 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (117 resets) in 356 ms. (112 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 54722 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 5
Probabilistic random walk after 54722 steps, saw 23117 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 19:27:36] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:27:36] [INFO ] Invariant cache hit.
[2024-05-24 19:27:36] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/940 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:27:37] [INFO ] Deduced a trap composed of 78 places in 655 ms of which 6 ms to minimize.
[2024-05-24 19:27:38] [INFO ] Deduced a trap composed of 80 places in 665 ms of which 6 ms to minimize.
[2024-05-24 19:27:38] [INFO ] Deduced a trap composed of 76 places in 654 ms of which 6 ms to minimize.
[2024-05-24 19:27:39] [INFO ] Deduced a trap composed of 82 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:27:40] [INFO ] Deduced a trap composed of 82 places in 658 ms of which 6 ms to minimize.
[2024-05-24 19:27:40] [INFO ] Deduced a trap composed of 5 places in 639 ms of which 6 ms to minimize.
[2024-05-24 19:27:41] [INFO ] Deduced a trap composed of 46 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:27:41] [INFO ] Deduced a trap composed of 46 places in 584 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/940 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 28/968 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 16/984 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3881/4865 variables, 984/1042 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4865 variables, 2722/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/4865 variables, 0/3764 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4865/4865 variables, and 3764 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8161 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 984/984 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 884/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:27:45] [INFO ] Deduced a trap composed of 257 places in 585 ms of which 5 ms to minimize.
[2024-05-24 19:27:46] [INFO ] Deduced a trap composed of 132 places in 618 ms of which 5 ms to minimize.
[2024-05-24 19:27:46] [INFO ] Deduced a trap composed of 83 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:27:47] [INFO ] Deduced a trap composed of 224 places in 608 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 35/940 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:27:48] [INFO ] Deduced a trap composed of 64 places in 612 ms of which 7 ms to minimize.
[2024-05-24 19:27:48] [INFO ] Deduced a trap composed of 83 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:27:49] [INFO ] Deduced a trap composed of 76 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:27:50] [INFO ] Deduced a trap composed of 74 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:27:50] [INFO ] Deduced a trap composed of 27 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:27:51] [INFO ] Deduced a trap composed of 71 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:27:52] [INFO ] Deduced a trap composed of 79 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:27:52] [INFO ] Deduced a trap composed of 76 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:27:53] [INFO ] Deduced a trap composed of 72 places in 634 ms of which 5 ms to minimize.
[2024-05-24 19:27:54] [INFO ] Deduced a trap composed of 82 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:27:54] [INFO ] Deduced a trap composed of 95 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:27:55] [INFO ] Deduced a trap composed of 46 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:27:56] [INFO ] Deduced a trap composed of 73 places in 607 ms of which 6 ms to minimize.
[2024-05-24 19:27:56] [INFO ] Deduced a trap composed of 89 places in 655 ms of which 6 ms to minimize.
[2024-05-24 19:27:57] [INFO ] Deduced a trap composed of 84 places in 657 ms of which 6 ms to minimize.
[2024-05-24 19:27:58] [INFO ] Deduced a trap composed of 88 places in 636 ms of which 6 ms to minimize.
[2024-05-24 19:27:58] [INFO ] Deduced a trap composed of 86 places in 595 ms of which 5 ms to minimize.
[2024-05-24 19:27:59] [INFO ] Deduced a trap composed of 86 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:27:59] [INFO ] Deduced a trap composed of 75 places in 646 ms of which 6 ms to minimize.
[2024-05-24 19:28:00] [INFO ] Deduced a trap composed of 78 places in 592 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:28:01] [INFO ] Deduced a trap composed of 173 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:28:01] [INFO ] Deduced a trap composed of 63 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:28:02] [INFO ] Deduced a trap composed of 76 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:28:03] [INFO ] Deduced a trap composed of 79 places in 572 ms of which 6 ms to minimize.
[2024-05-24 19:28:03] [INFO ] Deduced a trap composed of 76 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:28:04] [INFO ] Deduced a trap composed of 87 places in 655 ms of which 6 ms to minimize.
[2024-05-24 19:28:05] [INFO ] Deduced a trap composed of 84 places in 668 ms of which 6 ms to minimize.
[2024-05-24 19:28:05] [INFO ] Deduced a trap composed of 143 places in 665 ms of which 6 ms to minimize.
[2024-05-24 19:28:06] [INFO ] Deduced a trap composed of 137 places in 618 ms of which 8 ms to minimize.
[2024-05-24 19:28:07] [INFO ] Deduced a trap composed of 163 places in 652 ms of which 6 ms to minimize.
[2024-05-24 19:28:07] [INFO ] Deduced a trap composed of 84 places in 667 ms of which 7 ms to minimize.
[2024-05-24 19:28:08] [INFO ] Deduced a trap composed of 82 places in 695 ms of which 6 ms to minimize.
[2024-05-24 19:28:09] [INFO ] Deduced a trap composed of 88 places in 663 ms of which 6 ms to minimize.
[2024-05-24 19:28:09] [INFO ] Deduced a trap composed of 65 places in 578 ms of which 5 ms to minimize.
[2024-05-24 19:28:10] [INFO ] Deduced a trap composed of 78 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:28:10] [INFO ] Deduced a trap composed of 63 places in 589 ms of which 6 ms to minimize.
[2024-05-24 19:28:11] [INFO ] Deduced a trap composed of 76 places in 644 ms of which 7 ms to minimize.
[2024-05-24 19:28:12] [INFO ] Deduced a trap composed of 76 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:28:12] [INFO ] Deduced a trap composed of 83 places in 646 ms of which 6 ms to minimize.
[2024-05-24 19:28:13] [INFO ] Deduced a trap composed of 75 places in 658 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:28:14] [INFO ] Deduced a trap composed of 64 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:28:14] [INFO ] Deduced a trap composed of 72 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:28:15] [INFO ] Deduced a trap composed of 114 places in 572 ms of which 6 ms to minimize.
[2024-05-24 19:28:16] [INFO ] Deduced a trap composed of 80 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:28:16] [INFO ] Deduced a trap composed of 76 places in 560 ms of which 6 ms to minimize.
[2024-05-24 19:28:17] [INFO ] Deduced a trap composed of 60 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:28:18] [INFO ] Deduced a trap composed of 73 places in 651 ms of which 6 ms to minimize.
[2024-05-24 19:28:18] [INFO ] Deduced a trap composed of 69 places in 645 ms of which 6 ms to minimize.
[2024-05-24 19:28:19] [INFO ] Deduced a trap composed of 90 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:28:20] [INFO ] Deduced a trap composed of 73 places in 658 ms of which 7 ms to minimize.
[2024-05-24 19:28:20] [INFO ] Deduced a trap composed of 27 places in 634 ms of which 7 ms to minimize.
[2024-05-24 19:28:21] [INFO ] Deduced a trap composed of 70 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:28:21] [INFO ] Deduced a trap composed of 89 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:28:22] [INFO ] Deduced a trap composed of 96 places in 621 ms of which 7 ms to minimize.
[2024-05-24 19:28:23] [INFO ] Deduced a trap composed of 72 places in 640 ms of which 6 ms to minimize.
[2024-05-24 19:28:23] [INFO ] Deduced a trap composed of 63 places in 643 ms of which 6 ms to minimize.
[2024-05-24 19:28:24] [INFO ] Deduced a trap composed of 86 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:28:25] [INFO ] Deduced a trap composed of 77 places in 606 ms of which 6 ms to minimize.
[2024-05-24 19:28:25] [INFO ] Deduced a trap composed of 57 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:28:26] [INFO ] Deduced a trap composed of 86 places in 629 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:28:27] [INFO ] Deduced a trap composed of 109 places in 538 ms of which 6 ms to minimize.
[2024-05-24 19:28:27] [INFO ] Deduced a trap composed of 88 places in 677 ms of which 6 ms to minimize.
[2024-05-24 19:28:28] [INFO ] Deduced a trap composed of 120 places in 623 ms of which 7 ms to minimize.
[2024-05-24 19:28:29] [INFO ] Deduced a trap composed of 118 places in 656 ms of which 5 ms to minimize.
[2024-05-24 19:28:29] [INFO ] Deduced a trap composed of 70 places in 627 ms of which 5 ms to minimize.
[2024-05-24 19:28:30] [INFO ] Deduced a trap composed of 82 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:28:31] [INFO ] Deduced a trap composed of 93 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:28:31] [INFO ] Deduced a trap composed of 120 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:28:32] [INFO ] Deduced a trap composed of 74 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:28:33] [INFO ] Deduced a trap composed of 63 places in 673 ms of which 6 ms to minimize.
[2024-05-24 19:28:33] [INFO ] Deduced a trap composed of 92 places in 682 ms of which 6 ms to minimize.
[2024-05-24 19:28:34] [INFO ] Deduced a trap composed of 84 places in 663 ms of which 6 ms to minimize.
[2024-05-24 19:28:35] [INFO ] Deduced a trap composed of 113 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:28:35] [INFO ] Deduced a trap composed of 78 places in 607 ms of which 6 ms to minimize.
[2024-05-24 19:28:36] [INFO ] Deduced a trap composed of 75 places in 670 ms of which 6 ms to minimize.
[2024-05-24 19:28:37] [INFO ] Deduced a trap composed of 88 places in 668 ms of which 6 ms to minimize.
[2024-05-24 19:28:37] [INFO ] Deduced a trap composed of 95 places in 638 ms of which 6 ms to minimize.
[2024-05-24 19:28:38] [INFO ] Deduced a trap composed of 181 places in 541 ms of which 7 ms to minimize.
[2024-05-24 19:28:38] [INFO ] Deduced a trap composed of 127 places in 532 ms of which 7 ms to minimize.
[2024-05-24 19:28:39] [INFO ] Deduced a trap composed of 115 places in 623 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/940 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:28:40] [INFO ] Deduced a trap composed of 104 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:28:41] [INFO ] Deduced a trap composed of 85 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:28:41] [INFO ] Deduced a trap composed of 86 places in 640 ms of which 6 ms to minimize.
[2024-05-24 19:28:42] [INFO ] Deduced a trap composed of 76 places in 663 ms of which 6 ms to minimize.
[2024-05-24 19:28:43] [INFO ] Deduced a trap composed of 83 places in 647 ms of which 6 ms to minimize.
[2024-05-24 19:28:43] [INFO ] Deduced a trap composed of 194 places in 523 ms of which 6 ms to minimize.
[2024-05-24 19:28:44] [INFO ] Deduced a trap composed of 82 places in 616 ms of which 6 ms to minimize.
[2024-05-24 19:28:44] [INFO ] Deduced a trap composed of 115 places in 588 ms of which 6 ms to minimize.
[2024-05-24 19:28:45] [INFO ] Deduced a trap composed of 71 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:28:46] [INFO ] Deduced a trap composed of 153 places in 523 ms of which 5 ms to minimize.
[2024-05-24 19:28:46] [INFO ] Deduced a trap composed of 84 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:28:47] [INFO ] Deduced a trap composed of 156 places in 631 ms of which 6 ms to minimize.
[2024-05-24 19:28:47] [INFO ] Deduced a trap composed of 93 places in 593 ms of which 5 ms to minimize.
[2024-05-24 19:28:48] [INFO ] Deduced a trap composed of 221 places in 544 ms of which 6 ms to minimize.
[2024-05-24 19:28:49] [INFO ] Deduced a trap composed of 68 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:28:49] [INFO ] Deduced a trap composed of 67 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:28:50] [INFO ] Deduced a trap composed of 73 places in 624 ms of which 9 ms to minimize.
[2024-05-24 19:28:51] [INFO ] Deduced a trap composed of 95 places in 604 ms of which 5 ms to minimize.
[2024-05-24 19:28:51] [INFO ] Deduced a trap composed of 95 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:28:52] [INFO ] Deduced a trap composed of 95 places in 595 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/940 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 19:28:52] [INFO ] Deduced a trap composed of 80 places in 616 ms of which 8 ms to minimize.
[2024-05-24 19:28:53] [INFO ] Deduced a trap composed of 88 places in 610 ms of which 5 ms to minimize.
[2024-05-24 19:28:54] [INFO ] Deduced a trap composed of 85 places in 606 ms of which 6 ms to minimize.
[2024-05-24 19:28:54] [INFO ] Deduced a trap composed of 93 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:28:55] [INFO ] Deduced a trap composed of 89 places in 604 ms of which 5 ms to minimize.
[2024-05-24 19:28:56] [INFO ] Deduced a trap composed of 95 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:28:56] [INFO ] Deduced a trap composed of 102 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:28:57] [INFO ] Deduced a trap composed of 109 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:28:58] [INFO ] Deduced a trap composed of 101 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:28:58] [INFO ] Deduced a trap composed of 95 places in 606 ms of which 6 ms to minimize.
[2024-05-24 19:28:59] [INFO ] Deduced a trap composed of 71 places in 637 ms of which 5 ms to minimize.
[2024-05-24 19:29:00] [INFO ] Deduced a trap composed of 65 places in 622 ms of which 6 ms to minimize.
SMT process timed out in 83547ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 126 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 984/984 places, 4278/4278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 126 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
[2024-05-24 19:29:00] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:29:00] [INFO ] Invariant cache hit.
[2024-05-24 19:29:01] [INFO ] Implicit Places using invariants in 1299 ms returned []
[2024-05-24 19:29:01] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:29:01] [INFO ] Invariant cache hit.
[2024-05-24 19:29:02] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:29:32] [INFO ] Performed 654/984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:29:45] [INFO ] Implicit Places using invariants and state equation in 43790 ms returned []
Implicit Place search using SMT with State Equation took 45114 ms to find 0 implicit places.
[2024-05-24 19:29:45] [INFO ] Redundant transitions in 244 ms returned []
Running 4216 sub problems to find dead transitions.
[2024-05-24 19:29:45] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:29:45] [INFO ] Invariant cache hit.
[2024-05-24 19:29:45] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.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 1.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 1.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 1.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 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.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 1.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 1.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 1.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 1.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 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.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 1.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 1.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 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 1.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 0.0)
(s603 0.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 1.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 1.0)
(s649 0.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 1.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 1.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 0.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 1.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 1.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 1.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 1.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 1.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 1.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 1.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 timeout
0.0)
(s806 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/982 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4216 unsolved
SMT process timed out in 60266ms, After SMT, problems are : Problem set: 0 solved, 4216 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105825 ms. Remains : 984/984 places, 4278/4278 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[2, 1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-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:[2]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2]
[2024-05-24 19:30:45] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:30:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 10000 steps (210 resets) in 190 ms. (52 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 36 ms. (270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-24 19:30:46] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:30:46] [INFO ] Invariant cache hit.
[2024-05-24 19:30:46] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:30:46] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-24 19:30:47] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2024-05-24 19:30:47] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:30:47] [INFO ] [Real]Added 2722 Read/Feed constraints in 293 ms returned sat
[2024-05-24 19:30:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:30:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 19:30:47] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-24 19:30:48] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2024-05-24 19:30:49] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 19:30:49] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1046 ms returned sat
[2024-05-24 19:30:50] [INFO ] Deduced a trap composed of 171 places in 547 ms of which 6 ms to minimize.
[2024-05-24 19:30:51] [INFO ] Deduced a trap composed of 201 places in 541 ms of which 9 ms to minimize.
[2024-05-24 19:30:52] [INFO ] Deduced a trap composed of 174 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:30:53] [INFO ] Deduced a trap composed of 185 places in 553 ms of which 6 ms to minimize.
[2024-05-24 19:30: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:929)
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] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 983 transition count 4277
Applied a total of 2 rules in 271 ms. Remains 983 /984 variables (removed 1) and now considering 4277/4278 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 983/984 places, 4277/4278 transitions.
[2024-05-24 19:30:53] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2024-05-24 19:30:53] [INFO ] Computed 50 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2]
RANDOM walk for 1000000 steps (21027 resets) in 19218 ms. (52 steps per ms)
BEST_FIRST walk for 1000000 steps (3017 resets) in 3364 ms. (297 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2]
[2024-05-24 19:31:16] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:31:16] [INFO ] Invariant cache hit.
[2024-05-24 19:31:16] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:31:16] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-24 19:31:17] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2024-05-24 19:31:17] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:31:17] [INFO ] [Real]Added 2722 Read/Feed constraints in 274 ms returned sat
[2024-05-24 19:31:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:31:17] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:31:17] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-24 19:31:18] [INFO ] [Nat]Absence check using state equation in 1029 ms returned sat
[2024-05-24 19:31:19] [INFO ] [Nat]Added 2722 Read/Feed constraints in 672 ms returned sat
[2024-05-24 19:31:19] [INFO ] Deduced a trap composed of 135 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:31:20] [INFO ] Deduced a trap composed of 168 places in 482 ms of which 5 ms to minimize.
[2024-05-24 19:31:21] [INFO ] Deduced a trap composed of 201 places in 467 ms of which 6 ms to minimize.
[2024-05-24 19:31:22] [INFO ] Deduced a trap composed of 173 places in 526 ms of which 6 ms to minimize.
[2024-05-24 19:31:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3422 ms
[2024-05-24 19:31:23] [INFO ] Computed and/alt/rep : 1342/1949/1342 causal constraints (skipped 2475 transitions) in 275 ms.
[2024-05-24 19:31:23] [INFO ] Added : 14 causal constraints over 3 iterations in 941 ms. Result :sat
Minimization took 5552 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2]
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 113 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 116 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2024-05-24 19:31:29] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:31:29] [INFO ] Invariant cache hit.
[2024-05-24 19:31:30] [INFO ] Implicit Places using invariants in 1281 ms returned []
[2024-05-24 19:31:30] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:31:30] [INFO ] Invariant cache hit.
[2024-05-24 19:31:31] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:32:02] [INFO ] Performed 715/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:32:13] [INFO ] Implicit Places using invariants and state equation in 42874 ms returned []
Implicit Place search using SMT with State Equation took 44156 ms to find 0 implicit places.
[2024-05-24 19:32:13] [INFO ] Redundant transitions in 202 ms returned []
Running 4215 sub problems to find dead transitions.
[2024-05-24 19:32:13] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:32:13] [INFO ] Invariant cache hit.
[2024-05-24 19:32:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 61439ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 61481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105977 ms. Remains : 983/983 places, 4277/4277 transitions.
RANDOM walk for 40000 steps (840 resets) in 822 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (119 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (120 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 59056 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 59056 steps, saw 24922 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 19:33:18] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:33:18] [INFO ] Invariant cache hit.
[2024-05-24 19:33:18] [INFO ] State equation strengthened by 2722 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) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 884/888 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 19:33:19] [INFO ] Deduced a trap composed of 77 places in 651 ms of which 7 ms to minimize.
[2024-05-24 19:33:20] [INFO ] Deduced a trap composed of 65 places in 662 ms of which 6 ms to minimize.
[2024-05-24 19:33:20] [INFO ] Deduced a trap composed of 58 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:33:21] [INFO ] Deduced a trap composed of 73 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:33:22] [INFO ] Deduced a trap composed of 63 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:33:22] [INFO ] Deduced a trap composed of 56 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:33:23] [INFO ] Deduced a trap composed of 57 places in 619 ms of which 6 ms to minimize.
[2024-05-24 19:33:24] [INFO ] Deduced a trap composed of 65 places in 630 ms of which 6 ms to minimize.
SMT process timed out in 5359ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 125 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 983/983 places, 4277/4277 transitions.
RANDOM walk for 40000 steps (840 resets) in 1566 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (119 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 65299 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 1
Probabilistic random walk after 65299 steps, saw 27533 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 19:33:27] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:33:27] [INFO ] Invariant cache hit.
[2024-05-24 19:33:27] [INFO ] State equation strengthened by 2722 read => feed constraints.
All remaining problems are real, not stopping.
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) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/967 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/967 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/983 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3879/4862 variables, 983/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4862 variables, 2722/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4862 variables, 0/3755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4862/4862 variables, and 3755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 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) 884/888 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/905 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:33:30] [INFO ] Deduced a trap composed of 5 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:33:30] [INFO ] Deduced a trap composed of 27 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:33:31] [INFO ] Deduced a trap composed of 63 places in 623 ms of which 5 ms to minimize.
[2024-05-24 19:33:31] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/967 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/967 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 16/983 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3879/4862 variables, 983/1037 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4862 variables, 2722/3759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4862 variables, 1/3760 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:33:33] [INFO ] Deduced a trap composed of 201 places in 505 ms of which 6 ms to minimize.
[2024-05-24 19:33:34] [INFO ] Deduced a trap composed of 173 places in 539 ms of which 6 ms to minimize.
[2024-05-24 19:33:35] [INFO ] Deduced a trap composed of 184 places in 569 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4862 variables, 3/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4862 variables, 0/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4862 variables, 0/3763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4862/4862 variables, and 3763 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7165 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 983/983 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 8680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 118 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 122 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2024-05-24 19:33:36] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:33:36] [INFO ] Invariant cache hit.
[2024-05-24 19:33:38] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2024-05-24 19:33:38] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:33:38] [INFO ] Invariant cache hit.
[2024-05-24 19:33:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:34:09] [INFO ] Performed 660/983 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:34:23] [INFO ] Implicit Places using invariants and state equation in 45776 ms returned []
Implicit Place search using SMT with State Equation took 47094 ms to find 0 implicit places.
[2024-05-24 19:34:24] [INFO ] Redundant transitions in 202 ms returned []
Running 4215 sub problems to find dead transitions.
[2024-05-24 19:34:24] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-24 19:34:24] [INFO ] Invariant cache hit.
[2024-05-24 19:34:24] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/981 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4215 unsolved
SMT process timed out in 59592ms, After SMT, problems are : Problem set: 0 solved, 4215 unsolved
Search for dead transitions found 0 dead transitions in 59646ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107090 ms. Remains : 983/983 places, 4277/4277 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 in 277764 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:35:23] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-24 19:35:23] [INFO ] Computed 50 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (210 resets) in 191 ms. (52 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 36 ms. (270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:35:24] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:35:24] [INFO ] Invariant cache hit.
[2024-05-24 19:35:24] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 19:35:24] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:35:24] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-24 19:35:25] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:35:25] [INFO ] [Real]Added 2722 Read/Feed constraints in 282 ms returned sat
[2024-05-24 19:35:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:35:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:35:25] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-24 19:35:26] [INFO ] [Nat]Absence check using state equation in 751 ms returned sat
[2024-05-24 19:35:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 19:35:27] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1131 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 984 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 983 transition count 4274
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 983 transition count 4272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 981 transition count 4272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 980 transition count 4271
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 980 transition count 4271
Applied a total of 7 rules in 284 ms. Remains 980 /984 variables (removed 4) and now considering 4271/4276 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 980/984 places, 4271/4276 transitions.
[2024-05-24 19:35:27] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
// Phase 1: matrix 3873 rows 980 cols
[2024-05-24 19:35:27] [INFO ] Computed 50 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21028 resets) in 18181 ms. (54 steps per ms)
BEST_FIRST walk for 1000001 steps (3017 resets) in 3335 ms. (299 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:35:49] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
[2024-05-24 19:35:49] [INFO ] Invariant cache hit.
[2024-05-24 19:35:49] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:35:49] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:35:50] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2024-05-24 19:35:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:35:50] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2024-05-24 19:35:50] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:35:51] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2024-05-24 19:35:51] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:35:52] [INFO ] [Nat]Added 2720 Read/Feed constraints in 1598 ms returned sat
[2024-05-24 19:35:52] [INFO ] Computed and/alt/rep : 1335/1930/1335 causal constraints (skipped 2476 transitions) in 232 ms.
[2024-05-24 19:35:53] [INFO ] Added : 22 causal constraints over 5 iterations in 1121 ms. Result :sat
Minimization took 5456 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 980 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4271/4271 transitions.
Applied a total of 0 rules in 136 ms. Remains 980 /980 variables (removed 0) and now considering 4271/4271 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 980/980 places, 4271/4271 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 980/980 places, 4271/4271 transitions.
Applied a total of 0 rules in 122 ms. Remains 980 /980 variables (removed 0) and now considering 4271/4271 (removed 0) transitions.
[2024-05-24 19:35:59] [INFO ] Flow matrix only has 3873 transitions (discarded 398 similar events)
[2024-05-24 19:35:59] [INFO ] Invariant cache hit.
[2024-05-24 19:36:00] [INFO ] Implicit Places using invariants in 1236 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1249 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/980 places, 4271/4271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 4270
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 4270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 977 transition count 4269
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 977 transition count 4269
Applied a total of 4 rules in 187 ms. Remains 977 /979 variables (removed 2) and now considering 4269/4271 (removed 2) transitions.
[2024-05-24 19:36:01] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
// Phase 1: matrix 3871 rows 977 cols
[2024-05-24 19:36:01] [INFO ] Computed 49 invariants in 34 ms
[2024-05-24 19:36:02] [INFO ] Implicit Places using invariants in 1529 ms returned []
[2024-05-24 19:36:02] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:36:02] [INFO ] Invariant cache hit.
[2024-05-24 19:36:03] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:36:33] [INFO ] Performed 551/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:36:56] [INFO ] Implicit Places using invariants and state equation in 54117 ms returned []
Implicit Place search using SMT with State Equation took 55658 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/980 places, 4269/4271 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57216 ms. Remains : 977/980 places, 4269/4271 transitions.
[2024-05-24 19:36:56] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:36:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21032 resets) in 18572 ms. (53 steps per ms)
BEST_FIRST walk for 1000001 steps (3022 resets) in 3398 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:37:18] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:37:18] [INFO ] Invariant cache hit.
[2024-05-24 19:37:18] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:37:18] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-24 19:37:19] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2024-05-24 19:37:19] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:37:20] [INFO ] [Real]Added 2720 Read/Feed constraints in 414 ms returned sat
[2024-05-24 19:37:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:37:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:37:20] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-24 19:37:21] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2024-05-24 19:37:22] [INFO ] [Nat]Added 2720 Read/Feed constraints in 1457 ms returned sat
[2024-05-24 19:37:23] [INFO ] Deduced a trap composed of 235 places in 529 ms of which 6 ms to minimize.
[2024-05-24 19:37:24] [INFO ] Deduced a trap composed of 90 places in 616 ms of which 5 ms to minimize.
[2024-05-24 19:37:24] [INFO ] Deduced a trap composed of 94 places in 623 ms of which 5 ms to minimize.
[2024-05-24 19:37:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2148 ms
[2024-05-24 19:37:25] [INFO ] Computed and/alt/rep : 1334/1922/1334 causal constraints (skipped 2475 transitions) in 239 ms.
[2024-05-24 19:37:25] [INFO ] Added : 19 causal constraints over 4 iterations in 984 ms. Result :sat
Minimization took 5663 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 119 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 977/977 places, 4269/4269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 120 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
[2024-05-24 19:37:31] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:37:31] [INFO ] Invariant cache hit.
[2024-05-24 19:37:33] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2024-05-24 19:37:33] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:37:33] [INFO ] Invariant cache hit.
[2024-05-24 19:37:34] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:38:04] [INFO ] Performed 540/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:38:27] [INFO ] Implicit Places using invariants and state equation in 54696 ms returned []
Implicit Place search using SMT with State Equation took 56018 ms to find 0 implicit places.
[2024-05-24 19:38:28] [INFO ] Redundant transitions in 201 ms returned []
Running 4207 sub problems to find dead transitions.
[2024-05-24 19:38:28] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:38:28] [INFO ] Invariant cache hit.
[2024-05-24 19:38:28] [INFO ] State equation strengthened by 2720 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.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 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4207 unsolved
SMT process timed out in 57693ms, After SMT, problems are : Problem set: 0 solved, 4207 unsolved
Search for dead transitions found 0 dead transitions in 57727ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114084 ms. Remains : 977/977 places, 4269/4269 transitions.
RANDOM walk for 40000 steps (840 resets) in 1503 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (118 resets) in 295 ms. (135 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (117 resets) in 403 ms. (99 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 60551 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 60551 steps, saw 25554 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:39:29] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:39:29] [INFO ] Invariant cache hit.
[2024-05-24 19:39:29] [INFO ] State equation strengthened by 2720 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) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:39:30] [INFO ] Deduced a trap composed of 80 places in 861 ms of which 5 ms to minimize.
[2024-05-24 19:39:31] [INFO ] Deduced a trap composed of 98 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:39:31] [INFO ] Deduced a trap composed of 157 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:39:32] [INFO ] Deduced a trap composed of 227 places in 576 ms of which 5 ms to minimize.
[2024-05-24 19:39:32] [INFO ] Deduced a trap composed of 111 places in 562 ms of which 5 ms to minimize.
[2024-05-24 19:39:33] [INFO ] Deduced a trap composed of 122 places in 576 ms of which 5 ms to minimize.
[2024-05-24 19:39:34] [INFO ] Deduced a trap composed of 224 places in 549 ms of which 5 ms to minimize.
[2024-05-24 19:39:34] [INFO ] Deduced a trap composed of 133 places in 564 ms of which 5 ms to minimize.
SMT process timed out in 5287ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 118 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 977/977 places, 4269/4269 transitions.
RANDOM walk for 40000 steps (840 resets) in 2585 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (118 resets) in 288 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (116 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 60784 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 60784 steps, saw 25654 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:39:38] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:39:38] [INFO ] Invariant cache hit.
[2024-05-24 19:39:38] [INFO ] State equation strengthened by 2720 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) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:39:39] [INFO ] Deduced a trap composed of 80 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:39:40] [INFO ] Deduced a trap composed of 98 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:39:40] [INFO ] Deduced a trap composed of 157 places in 592 ms of which 5 ms to minimize.
[2024-05-24 19:39:41] [INFO ] Deduced a trap composed of 227 places in 552 ms of which 5 ms to minimize.
[2024-05-24 19:39:41] [INFO ] Deduced a trap composed of 111 places in 566 ms of which 6 ms to minimize.
[2024-05-24 19:39:42] [INFO ] Deduced a trap composed of 122 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:39:43] [INFO ] Deduced a trap composed of 224 places in 569 ms of which 5 ms to minimize.
[2024-05-24 19:39:43] [INFO ] Deduced a trap composed of 133 places in 597 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/933 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/961 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/977 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3871/4848 variables, 977/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4848 variables, 2720/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4848 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4848 variables, 0/3754 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4848/4848 variables, and 3754 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6433 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 977/977 constraints, ReadFeed: 2720/2720 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 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) 880/881 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/881 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:39:45] [INFO ] Deduced a trap composed of 300 places in 560 ms of which 5 ms to minimize.
[2024-05-24 19:39:46] [INFO ] Deduced a trap composed of 81 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:39:47] [INFO ] Deduced a trap composed of 144 places in 557 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/899 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/899 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 34/933 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:39:47] [INFO ] Deduced a trap composed of 5 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:39:48] [INFO ] Deduced a trap composed of 140 places in 517 ms of which 6 ms to minimize.
[2024-05-24 19:39:48] [INFO ] Deduced a trap composed of 46 places in 516 ms of which 6 ms to minimize.
[2024-05-24 19:39:49] [INFO ] Deduced a trap composed of 27 places in 503 ms of which 5 ms to minimize.
[2024-05-24 19:39:49] [INFO ] Deduced a trap composed of 57 places in 518 ms of which 5 ms to minimize.
[2024-05-24 19:39:50] [INFO ] Deduced a trap composed of 139 places in 520 ms of which 6 ms to minimize.
[2024-05-24 19:39:50] [INFO ] Deduced a trap composed of 141 places in 504 ms of which 5 ms to minimize.
[2024-05-24 19:39:51] [INFO ] Deduced a trap composed of 46 places in 543 ms of which 6 ms to minimize.
[2024-05-24 19:39:52] [INFO ] Deduced a trap composed of 161 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:39:52] [INFO ] Deduced a trap composed of 77 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:39:53] [INFO ] Deduced a trap composed of 82 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:39:53] [INFO ] Deduced a trap composed of 70 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:39:54] [INFO ] Deduced a trap composed of 75 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:39:55] [INFO ] Deduced a trap composed of 85 places in 516 ms of which 5 ms to minimize.
[2024-05-24 19:39:55] [INFO ] Deduced a trap composed of 46 places in 489 ms of which 5 ms to minimize.
[2024-05-24 19:39:56] [INFO ] Deduced a trap composed of 176 places in 517 ms of which 5 ms to minimize.
[2024-05-24 19:39:56] [INFO ] Deduced a trap composed of 71 places in 493 ms of which 6 ms to minimize.
[2024-05-24 19:39:57] [INFO ] Deduced a trap composed of 88 places in 484 ms of which 6 ms to minimize.
[2024-05-24 19:39:57] [INFO ] Deduced a trap composed of 62 places in 509 ms of which 6 ms to minimize.
[2024-05-24 19:39:58] [INFO ] Deduced a trap composed of 75 places in 516 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:39:58] [INFO ] Deduced a trap composed of 187 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:39:59] [INFO ] Deduced a trap composed of 187 places in 531 ms of which 6 ms to minimize.
[2024-05-24 19:39:59] [INFO ] Deduced a trap composed of 92 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:40:00] [INFO ] Deduced a trap composed of 118 places in 525 ms of which 5 ms to minimize.
[2024-05-24 19:40:01] [INFO ] Deduced a trap composed of 66 places in 625 ms of which 5 ms to minimize.
[2024-05-24 19:40:01] [INFO ] Deduced a trap composed of 71 places in 652 ms of which 5 ms to minimize.
[2024-05-24 19:40:02] [INFO ] Deduced a trap composed of 63 places in 577 ms of which 6 ms to minimize.
[2024-05-24 19:40:02] [INFO ] Deduced a trap composed of 74 places in 605 ms of which 6 ms to minimize.
[2024-05-24 19:40:03] [INFO ] Deduced a trap composed of 64 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:40:04] [INFO ] Deduced a trap composed of 76 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:40:04] [INFO ] Deduced a trap composed of 92 places in 511 ms of which 6 ms to minimize.
[2024-05-24 19:40:05] [INFO ] Deduced a trap composed of 97 places in 589 ms of which 5 ms to minimize.
[2024-05-24 19:40:05] [INFO ] Deduced a trap composed of 69 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:40:06] [INFO ] Deduced a trap composed of 106 places in 593 ms of which 5 ms to minimize.
[2024-05-24 19:40:07] [INFO ] Deduced a trap composed of 85 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:40:07] [INFO ] Deduced a trap composed of 83 places in 615 ms of which 5 ms to minimize.
[2024-05-24 19:40:08] [INFO ] Deduced a trap composed of 97 places in 610 ms of which 5 ms to minimize.
[2024-05-24 19:40:08] [INFO ] Deduced a trap composed of 154 places in 524 ms of which 6 ms to minimize.
[2024-05-24 19:40:09] [INFO ] Deduced a trap composed of 85 places in 551 ms of which 6 ms to minimize.
[2024-05-24 19:40:10] [INFO ] Deduced a trap composed of 95 places in 602 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/933 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:40:10] [INFO ] Deduced a trap composed of 81 places in 608 ms of which 6 ms to minimize.
[2024-05-24 19:40:11] [INFO ] Deduced a trap composed of 85 places in 589 ms of which 6 ms to minimize.
[2024-05-24 19:40:12] [INFO ] Deduced a trap composed of 72 places in 638 ms of which 6 ms to minimize.
[2024-05-24 19:40:12] [INFO ] Deduced a trap composed of 82 places in 663 ms of which 6 ms to minimize.
[2024-05-24 19:40:13] [INFO ] Deduced a trap composed of 74 places in 592 ms of which 15 ms to minimize.
[2024-05-24 19:40:13] [INFO ] Deduced a trap composed of 73 places in 631 ms of which 6 ms to minimize.
[2024-05-24 19:40:14] [INFO ] Deduced a trap composed of 85 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:40:15] [INFO ] Deduced a trap composed of 86 places in 625 ms of which 5 ms to minimize.
[2024-05-24 19:40:15] [INFO ] Deduced a trap composed of 103 places in 500 ms of which 6 ms to minimize.
[2024-05-24 19:40:16] [INFO ] Deduced a trap composed of 70 places in 613 ms of which 6 ms to minimize.
[2024-05-24 19:40:17] [INFO ] Deduced a trap composed of 77 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:40:17] [INFO ] Deduced a trap composed of 72 places in 649 ms of which 5 ms to minimize.
[2024-05-24 19:40:18] [INFO ] Deduced a trap composed of 219 places in 540 ms of which 5 ms to minimize.
[2024-05-24 19:40:18] [INFO ] Deduced a trap composed of 204 places in 530 ms of which 5 ms to minimize.
[2024-05-24 19:40:19] [INFO ] Deduced a trap composed of 213 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:40:20] [INFO ] Deduced a trap composed of 76 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:40:20] [INFO ] Deduced a trap composed of 246 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:40:21] [INFO ] Deduced a trap composed of 209 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:40:21] [INFO ] Deduced a trap composed of 113 places in 514 ms of which 5 ms to minimize.
[2024-05-24 19:40:22] [INFO ] Deduced a trap composed of 84 places in 605 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/933 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:40:22] [INFO ] Deduced a trap composed of 64 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:40:23] [INFO ] Deduced a trap composed of 80 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:40:24] [INFO ] Deduced a trap composed of 62 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:40:24] [INFO ] Deduced a trap composed of 111 places in 598 ms of which 5 ms to minimize.
[2024-05-24 19:40:25] [INFO ] Deduced a trap composed of 70 places in 638 ms of which 6 ms to minimize.
[2024-05-24 19:40:25] [INFO ] Deduced a trap composed of 157 places in 532 ms of which 6 ms to minimize.
[2024-05-24 19:40:26] [INFO ] Deduced a trap composed of 145 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:40:27] [INFO ] Deduced a trap composed of 80 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:40:27] [INFO ] Deduced a trap composed of 70 places in 606 ms of which 6 ms to minimize.
[2024-05-24 19:40:28] [INFO ] Deduced a trap composed of 72 places in 627 ms of which 5 ms to minimize.
[2024-05-24 19:40:29] [INFO ] Deduced a trap composed of 88 places in 588 ms of which 6 ms to minimize.
[2024-05-24 19:40:29] [INFO ] Deduced a trap composed of 71 places in 593 ms of which 5 ms to minimize.
[2024-05-24 19:40:30] [INFO ] Deduced a trap composed of 72 places in 648 ms of which 10 ms to minimize.
SMT process timed out in 51553ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 120 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 977/977 places, 4269/4269 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 4269/4269 transitions.
Applied a total of 0 rules in 118 ms. Remains 977 /977 variables (removed 0) and now considering 4269/4269 (removed 0) transitions.
[2024-05-24 19:40:30] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:40:30] [INFO ] Invariant cache hit.
[2024-05-24 19:40:31] [INFO ] Implicit Places using invariants in 1291 ms returned []
[2024-05-24 19:40:31] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:40:31] [INFO ] Invariant cache hit.
[2024-05-24 19:40:32] [INFO ] State equation strengthened by 2720 read => feed constraints.
[2024-05-24 19:41:03] [INFO ] Performed 537/977 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:41:26] [INFO ] Implicit Places using invariants and state equation in 54911 ms returned []
Implicit Place search using SMT with State Equation took 56225 ms to find 0 implicit places.
[2024-05-24 19:41:26] [INFO ] Redundant transitions in 199 ms returned []
Running 4207 sub problems to find dead transitions.
[2024-05-24 19:41:27] [INFO ] Flow matrix only has 3871 transitions (discarded 398 similar events)
[2024-05-24 19:41:27] [INFO ] Invariant cache hit.
[2024-05-24 19:41:27] [INFO ] State equation strengthened by 2720 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4207 unsolved
SMT process timed out in 57505ms, After SMT, problems are : Problem set: 0 solved, 4207 unsolved
Search for dead transitions found 0 dead transitions in 57541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114105 ms. Remains : 977/977 places, 4269/4269 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 in 420774 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:42:24] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-24 19:42:24] [INFO ] Computed 50 invariants in 23 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (210 resets) in 191 ms. (52 steps per ms)
BEST_FIRST walk for 10001 steps (30 resets) in 35 ms. (277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:42:24] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-24 19:42:24] [INFO ] Invariant cache hit.
[2024-05-24 19:42:24] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:42:24] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-24 19:42:25] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2024-05-24 19:42:25] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:42:26] [INFO ] [Real]Added 2722 Read/Feed constraints in 238 ms returned sat
[2024-05-24 19:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:42:26] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:42:26] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-24 19:42:27] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2024-05-24 19:42:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 19:42:28] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1028 ms returned sat
[2024-05-24 19:42:28] [INFO ] Deduced a trap composed of 215 places in 544 ms of which 6 ms to minimize.
[2024-05-24 19:42:29] [INFO ] Deduced a trap composed of 96 places in 611 ms of which 5 ms to minimize.
[2024-05-24 19:42:30] [INFO ] Deduced a trap composed of 90 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:42:30] [INFO ] Deduced a trap composed of 98 places in 631 ms of which 5 ms to minimize.
[2024-05-24 19:42:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2871 ms
[2024-05-24 19:42:31] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 229 ms.
[2024-05-24 19:42:31] [INFO ] Added : 0 causal constraints over 0 iterations in 230 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 984 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node13ThinksNode4ShouldBeNodeMasterToReplaceNode12) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4276/4276 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 983 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 982 transition count 4274
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 982 transition count 4274
Applied a total of 4 rules in 276 ms. Remains 982 /984 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 982/984 places, 4274/4276 transitions.
[2024-05-24 19:42:31] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 982 cols
[2024-05-24 19:42:31] [INFO ] Computed 50 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21026 resets) in 18306 ms. (54 steps per ms)
BEST_FIRST walk for 1000001 steps (3018 resets) in 3344 ms. (298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:42:53] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-24 19:42:53] [INFO ] Invariant cache hit.
[2024-05-24 19:42:53] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2024-05-24 19:42:53] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-24 19:42:54] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2024-05-24 19:42:54] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:42:54] [INFO ] [Real]Added 2721 Read/Feed constraints in 321 ms returned sat
[2024-05-24 19:42:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:42:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 19:42:54] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-24 19:42:55] [INFO ] [Nat]Absence check using state equation in 959 ms returned sat
[2024-05-24 19:42:57] [INFO ] [Nat]Added 2721 Read/Feed constraints in 1320 ms returned sat
[2024-05-24 19:42:57] [INFO ] Deduced a trap composed of 228 places in 520 ms of which 5 ms to minimize.
[2024-05-24 19:42:58] [INFO ] Deduced a trap composed of 92 places in 619 ms of which 6 ms to minimize.
[2024-05-24 19:42:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1416 ms
[2024-05-24 19:42:58] [INFO ] Computed and/alt/rep : 1339/1936/1339 causal constraints (skipped 2476 transitions) in 221 ms.
[2024-05-24 19:43:00] [INFO ] Deduced a trap composed of 84 places in 625 ms of which 6 ms to minimize.
[2024-05-24 19:43:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 842 ms
[2024-05-24 19:43:01] [INFO ] Added : 23 causal constraints over 7 iterations in 2487 ms. Result :sat
Minimization took 5511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4274/4274 transitions.
Applied a total of 0 rules in 126 ms. Remains 982 /982 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 982/982 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4274/4274 transitions.
Applied a total of 0 rules in 123 ms. Remains 982 /982 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2024-05-24 19:43:06] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-24 19:43:06] [INFO ] Invariant cache hit.
[2024-05-24 19:43:08] [INFO ] Implicit Places using invariants in 1289 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1307 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 981/982 places, 4274/4274 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 980 transition count 4273
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 980 transition count 4273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4272
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4272
Applied a total of 4 rules in 194 ms. Remains 979 /981 variables (removed 2) and now considering 4272/4274 (removed 2) transitions.
[2024-05-24 19:43:08] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
// Phase 1: matrix 3875 rows 979 cols
[2024-05-24 19:43:08] [INFO ] Computed 49 invariants in 26 ms
[2024-05-24 19:43:09] [INFO ] Implicit Places using invariants in 1316 ms returned []
[2024-05-24 19:43:09] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:43:09] [INFO ] Invariant cache hit.
[2024-05-24 19:43:10] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:43:40] [INFO ] Performed 797/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:43:52] [INFO ] Implicit Places using invariants and state equation in 42458 ms returned []
Implicit Place search using SMT with State Equation took 43784 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/982 places, 4272/4274 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45408 ms. Remains : 979/982 places, 4272/4274 transitions.
[2024-05-24 19:43:52] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:43:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21028 resets) in 17808 ms. (56 steps per ms)
BEST_FIRST walk for 1000001 steps (3009 resets) in 3264 ms. (306 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 19:44:13] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:44:13] [INFO ] Invariant cache hit.
[2024-05-24 19:44:13] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 19:44:13] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-24 19:44:14] [INFO ] [Real]Absence check using state equation in 872 ms returned sat
[2024-05-24 19:44:14] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:44:14] [INFO ] [Real]Added 2721 Read/Feed constraints in 194 ms returned sat
[2024-05-24 19:44:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 19:44:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 21 ms returned sat
[2024-05-24 19:44:14] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-24 19:44:15] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2024-05-24 19:44:16] [INFO ] [Nat]Added 2721 Read/Feed constraints in 1229 ms returned sat
[2024-05-24 19:44:17] [INFO ] Deduced a trap composed of 221 places in 499 ms of which 6 ms to minimize.
[2024-05-24 19:44:18] [INFO ] Deduced a trap composed of 84 places in 572 ms of which 6 ms to minimize.
[2024-05-24 19:44:18] [INFO ] Deduced a trap composed of 85 places in 582 ms of which 5 ms to minimize.
[2024-05-24 19:44:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2070 ms
[2024-05-24 19:44:19] [INFO ] Computed and/alt/rep : 1338/1928/1338 causal constraints (skipped 2475 transitions) in 221 ms.
[2024-05-24 19:44:19] [INFO ] Added : 18 causal constraints over 4 iterations in 959 ms. Result :sat
Minimization took 6103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 115 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 979/979 places, 4272/4272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 115 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
[2024-05-24 19:44:26] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:44:26] [INFO ] Invariant cache hit.
[2024-05-24 19:44:27] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2024-05-24 19:44:27] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:44:27] [INFO ] Invariant cache hit.
[2024-05-24 19:44:28] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:44:58] [INFO ] Performed 768/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:45:11] [INFO ] Implicit Places using invariants and state equation in 44007 ms returned []
Implicit Place search using SMT with State Equation took 45243 ms to find 0 implicit places.
[2024-05-24 19:45:11] [INFO ] Redundant transitions in 206 ms returned []
Running 4210 sub problems to find dead transitions.
[2024-05-24 19:45:11] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:45:11] [INFO ] Invariant cache hit.
[2024-05-24 19:45:11] [INFO ] State equation strengthened by 2721 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4210 unsolved
SMT process timed out in 56971ms, After SMT, problems are : Problem set: 0 solved, 4210 unsolved
Search for dead transitions found 0 dead transitions in 57007ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102586 ms. Remains : 979/979 places, 4272/4272 transitions.
RANDOM walk for 40000 steps (838 resets) in 1499 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (121 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (120 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 58544 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 2
Probabilistic random walk after 58544 steps, saw 24715 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 19:46:12] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:46:12] [INFO ] Invariant cache hit.
[2024-05-24 19:46:12] [INFO ] State equation strengthened by 2721 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) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:46:13] [INFO ] Deduced a trap composed of 177 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:46:13] [INFO ] Deduced a trap composed of 247 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:46:14] [INFO ] Deduced a trap composed of 137 places in 585 ms of which 5 ms to minimize.
[2024-05-24 19:46:14] [INFO ] Deduced a trap composed of 182 places in 585 ms of which 5 ms to minimize.
[2024-05-24 19:46:15] [INFO ] Deduced a trap composed of 92 places in 570 ms of which 6 ms to minimize.
[2024-05-24 19:46:16] [INFO ] Deduced a trap composed of 129 places in 577 ms of which 5 ms to minimize.
[2024-05-24 19:46:16] [INFO ] Deduced a trap composed of 87 places in 581 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/963 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/979 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4854/4854 variables, and 1035 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 0/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 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) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:46:17] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 6 ms to minimize.
[2024-05-24 19:46:18] [INFO ] Deduced a trap composed of 46 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:46:18] [INFO ] Deduced a trap composed of 160 places in 500 ms of which 5 ms to minimize.
[2024-05-24 19:46:19] [INFO ] Deduced a trap composed of 151 places in 492 ms of which 5 ms to minimize.
[2024-05-24 19:46:19] [INFO ] Deduced a trap composed of 189 places in 485 ms of which 6 ms to minimize.
[2024-05-24 19:46:20] [INFO ] Deduced a trap composed of 153 places in 504 ms of which 5 ms to minimize.
[2024-05-24 19:46:21] [INFO ] Deduced a trap composed of 151 places in 483 ms of which 6 ms to minimize.
[2024-05-24 19:46:21] [INFO ] Deduced a trap composed of 152 places in 458 ms of which 6 ms to minimize.
[2024-05-24 19:46:21] [INFO ] Deduced a trap composed of 157 places in 494 ms of which 5 ms to minimize.
[2024-05-24 19:46:22] [INFO ] Deduced a trap composed of 140 places in 479 ms of which 6 ms to minimize.
SMT process timed out in 10278ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 116 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 979/979 places, 4272/4272 transitions.
RANDOM walk for 40000 steps (840 resets) in 1801 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (119 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (117 resets) in 345 ms. (115 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 62654 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 62654 steps, saw 26441 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 19:46:26] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:46:26] [INFO ] Invariant cache hit.
[2024-05-24 19:46:26] [INFO ] State equation strengthened by 2721 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) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:46:27] [INFO ] Deduced a trap composed of 177 places in 543 ms of which 6 ms to minimize.
[2024-05-24 19:46:27] [INFO ] Deduced a trap composed of 247 places in 557 ms of which 5 ms to minimize.
[2024-05-24 19:46:28] [INFO ] Deduced a trap composed of 137 places in 548 ms of which 5 ms to minimize.
[2024-05-24 19:46:28] [INFO ] Deduced a trap composed of 182 places in 557 ms of which 6 ms to minimize.
[2024-05-24 19:46:29] [INFO ] Deduced a trap composed of 92 places in 564 ms of which 5 ms to minimize.
[2024-05-24 19:46:29] [INFO ] Deduced a trap composed of 129 places in 550 ms of which 5 ms to minimize.
[2024-05-24 19:46:30] [INFO ] Deduced a trap composed of 87 places in 543 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/963 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/963 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/979 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4854 variables, 979/1035 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4854 variables, 2721/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4854 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/4854 variables, 0/3756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4854/4854 variables, and 3756 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5739 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2721/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 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) 882/883 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/883 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/901 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/935 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:46:32] [INFO ] Deduced a trap composed of 5 places in 464 ms of which 5 ms to minimize.
[2024-05-24 19:46:33] [INFO ] Deduced a trap composed of 46 places in 501 ms of which 5 ms to minimize.
[2024-05-24 19:46:33] [INFO ] Deduced a trap composed of 160 places in 518 ms of which 5 ms to minimize.
[2024-05-24 19:46:34] [INFO ] Deduced a trap composed of 151 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:46:34] [INFO ] Deduced a trap composed of 189 places in 495 ms of which 5 ms to minimize.
[2024-05-24 19:46:35] [INFO ] Deduced a trap composed of 153 places in 460 ms of which 5 ms to minimize.
[2024-05-24 19:46:35] [INFO ] Deduced a trap composed of 151 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:46:36] [INFO ] Deduced a trap composed of 152 places in 453 ms of which 5 ms to minimize.
[2024-05-24 19:46:36] [INFO ] Deduced a trap composed of 157 places in 477 ms of which 6 ms to minimize.
[2024-05-24 19:46:37] [INFO ] Deduced a trap composed of 140 places in 458 ms of which 6 ms to minimize.
[2024-05-24 19:46:37] [INFO ] Deduced a trap composed of 141 places in 498 ms of which 5 ms to minimize.
[2024-05-24 19:46:38] [INFO ] Deduced a trap composed of 140 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:46:38] [INFO ] Deduced a trap composed of 150 places in 465 ms of which 5 ms to minimize.
[2024-05-24 19:46:39] [INFO ] Deduced a trap composed of 140 places in 457 ms of which 5 ms to minimize.
[2024-05-24 19:46:39] [INFO ] Deduced a trap composed of 139 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:46:40] [INFO ] Deduced a trap composed of 159 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:46:40] [INFO ] Deduced a trap composed of 173 places in 469 ms of which 6 ms to minimize.
[2024-05-24 19:46:41] [INFO ] Deduced a trap composed of 161 places in 460 ms of which 5 ms to minimize.
[2024-05-24 19:46:41] [INFO ] Deduced a trap composed of 197 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:46:42] [INFO ] Deduced a trap composed of 157 places in 487 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/935 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:46:42] [INFO ] Deduced a trap composed of 160 places in 473 ms of which 6 ms to minimize.
[2024-05-24 19:46:43] [INFO ] Deduced a trap composed of 148 places in 470 ms of which 6 ms to minimize.
[2024-05-24 19:46:43] [INFO ] Deduced a trap composed of 160 places in 453 ms of which 5 ms to minimize.
[2024-05-24 19:46:44] [INFO ] Deduced a trap composed of 46 places in 461 ms of which 5 ms to minimize.
[2024-05-24 19:46:44] [INFO ] Deduced a trap composed of 88 places in 459 ms of which 5 ms to minimize.
[2024-05-24 19:46:45] [INFO ] Deduced a trap composed of 71 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:46:45] [INFO ] Deduced a trap composed of 144 places in 477 ms of which 5 ms to minimize.
[2024-05-24 19:46:46] [INFO ] Deduced a trap composed of 205 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:46:46] [INFO ] Deduced a trap composed of 223 places in 483 ms of which 6 ms to minimize.
[2024-05-24 19:46:47] [INFO ] Deduced a trap composed of 208 places in 450 ms of which 5 ms to minimize.
[2024-05-24 19:46:47] [INFO ] Deduced a trap composed of 177 places in 482 ms of which 6 ms to minimize.
[2024-05-24 19:46:48] [INFO ] Deduced a trap composed of 182 places in 466 ms of which 7 ms to minimize.
[2024-05-24 19:46:48] [INFO ] Deduced a trap composed of 149 places in 492 ms of which 8 ms to minimize.
[2024-05-24 19:46:49] [INFO ] Deduced a trap composed of 155 places in 467 ms of which 5 ms to minimize.
[2024-05-24 19:46:49] [INFO ] Deduced a trap composed of 149 places in 483 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/935 variables, 15/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 28/963 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:46:50] [INFO ] Deduced a trap composed of 183 places in 486 ms of which 5 ms to minimize.
[2024-05-24 19:46:50] [INFO ] Deduced a trap composed of 72 places in 594 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/963 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/963 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 16/979 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/979 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3875/4854 variables, 979/1072 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4854 variables, 2721/3793 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4854 variables, 2/3795 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 19:46:54] [INFO ] Deduced a trap composed of 420 places in 489 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4854 variables, 1/3796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4854 variables, 0/3796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/4854 variables, 0/3796 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4854/4854 variables, and 3796 constraints, problems are : Problem set: 0 solved, 2 unsolved in 22880 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 979/979 constraints, ReadFeed: 2721/2721 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 45/45 constraints]
After SMT, in 28660ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 113 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 979/979 places, 4272/4272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4272/4272 transitions.
Applied a total of 0 rules in 115 ms. Remains 979 /979 variables (removed 0) and now considering 4272/4272 (removed 0) transitions.
[2024-05-24 19:46:55] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:46:55] [INFO ] Invariant cache hit.
[2024-05-24 19:46:56] [INFO ] Implicit Places using invariants in 1280 ms returned []
[2024-05-24 19:46:56] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:46:56] [INFO ] Invariant cache hit.
[2024-05-24 19:46:57] [INFO ] State equation strengthened by 2721 read => feed constraints.
[2024-05-24 19:47:27] [INFO ] Performed 741/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:47:40] [INFO ] Implicit Places using invariants and state equation in 44002 ms returned []
Implicit Place search using SMT with State Equation took 45292 ms to find 0 implicit places.
[2024-05-24 19:47:40] [INFO ] Redundant transitions in 201 ms returned []
Running 4210 sub problems to find dead transitions.
[2024-05-24 19:47:40] [INFO ] Flow matrix only has 3875 transitions (discarded 397 similar events)
[2024-05-24 19:47:40] [INFO ] Invariant cache hit.
[2024-05-24 19:47:40] [INFO ] State equation strengthened by 2721 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.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 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 4210 unsolved
SMT process timed out in 57786ms, After SMT, problems are : Problem set: 0 solved, 4210 unsolved
Search for dead transitions found 0 dead transitions in 57821ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103448 ms. Remains : 979/979 places, 4272/4272 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 374191 ms.
[2024-05-24 19:48:39] [INFO ] Flatten gal took : 348 ms
[2024-05-24 19:48:39] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-24 19:48:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 984 places, 4278 transitions and 21331 arcs took 33 ms.
Total runtime 1905043 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiCrashLeafsetExtension-PT-S16C08
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: 984
TRANSITIONS: 4278
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.109s, Sys 0.006s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.015s, 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: 2326
MODEL NAME: /home/mcc/execution/412/model
984 places, 4278 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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
MEDDLY ERROR: Insufficient memory
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="MultiCrashLeafsetExtension-PT-S16C08"
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 MultiCrashLeafsetExtension-PT-S16C08, 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 r245-tall-171654349100053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 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 ;