About the Execution of 2025-gold for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6183.180 | 1800000.00 | 3668928.00 | 3647.30 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r144-smll-177955812600188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is FireWire-PT-20, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-smll-177955812600188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 247K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1779634334154
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202505121319
[2026-05-24 14:52:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-24 14:52:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 14:52:16] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2026-05-24 14:52:16] [INFO ] Transformed 626 places.
[2026-05-24 14:52:16] [INFO ] Transformed 1031 transitions.
[2026-05-24 14:52:16] [INFO ] Found NUPN structural information;
[2026-05-24 14:52:16] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 509 ms.
Graph (trivial) has 458 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Structural test allowed to assert that 93 places are NOT stable. Took 35 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (454 resets) in 4085 ms. (9 steps per ms) remains 393/533 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 42 ms. (9 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 37 ms. (10 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 40 ms. (9 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 27 ms. (14 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 41 ms. (9 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 29 ms. (13 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 43 ms. (9 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 393/393 properties
[2026-05-24 14:52:18] [INFO ] Flatten gal took : 392 ms
BEST_FIRST walk for 404 steps (8 resets) in 24 ms. (16 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 393/393 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 393/393 properties
[2026-05-24 14:52:18] [INFO ] Flatten gal took : 253 ms
[2026-05-24 14:52:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9981854353940863999.gal : 71 ms
[2026-05-24 14:52:18] [INFO ] Flow matrix only has 1019 transitions (discarded 2 similar events)
[2026-05-24 14:52:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7092236453012592350.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9981854353940863999.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7092236453012592350.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 1019 rows 617 cols
[2026-05-24 14:52:19] [INFO ] Computed 13 invariants in 60 ms
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
[2026-05-24 14:52:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Loading property file /tmp/ReachabilityCardinality7092236453012592350.prop.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,393 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,393 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,393 properties remain. new max is 16
SDD size :3 after 14
SDD proceeding with computation,393 properties remain. new max is 32
SDD size :14 after 60
SDD proceeding with computation,393 properties remain. new max is 64
SDD size :60 after 178
SDD proceeding with computation,393 properties remain. new max is 128
SDD size :178 after 349
SDD proceeding with computation,393 properties remain. new max is 256
SDD size :349 after 737
SDD proceeding with computation,393 properties remain. new max is 512
SDD size :737 after 4955
Invariant property smplace_225 does not hold.
Invariant property smplace_224 does not hold.
SDD proceeding with computation,391 properties remain. new max is 512
SDD size :4955 after 12609
Invariant property smplace_223 does not hold.
Invariant property smplace_222 does not hold.
Invariant property smplace_221 does not hold.
Invariant property smplace_220 does not hold.
Invariant property smplace_219 does not hold.
Invariant property smplace_218 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_62 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_59 does not hold.
SDD proceeding with computation,380 properties remain. new max is 512
SDD size :12609 after 17194
Invariant property smplace_217 does not hold.
SDD proceeding with computation,379 properties remain. new max is 512
SDD size :17194 after 28401
SDD proceeding with computation,379 properties remain. new max is 1024
SDD size :28401 after 31913
Invariant property smplace_60 does not hold.
Invariant property smplace_58 does not hold.
SDD proceeding with computation,377 properties remain. new max is 1024
SDD size :31913 after 41697
SDD proceeding with computation,377 properties remain. new max is 2048
SDD size :41697 after 46965
Invariant property smplace_57 does not hold.
SDD proceeding with computation,376 properties remain. new max is 2048
SDD size :46965 after 56021
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 393/393 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1636 variables, and 393 constraints, problems are : Problem set: 17 solved, 376 unsolved in 5173 ms.
Refiners :[Domain max(s): 393/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 376 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,376 properties remain. new max is 4096
SDD size :56021 after 59925
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 376/376 constraints. Problems are: Problem set: 17 solved, 376 unsolved
Invariant property smplace_216 does not hold.
Invariant property smplace_215 does not hold.
Invariant property smplace_214 does not hold.
Invariant property smplace_213 does not hold.
Invariant property smplace_212 does not hold.
Invariant property smplace_211 does not hold.
Invariant property smplace_210 does not hold.
Invariant property smplace_209 does not hold.
Invariant property smplace_208 does not hold.
Invariant property smplace_207 does not hold.
Invariant property smplace_206 does not hold.
Invariant property smplace_205 does not hold.
Invariant property smplace_204 does not hold.
Invariant property smplace_203 does not hold.
Invariant property smplace_202 does not hold.
Invariant property smplace_201 does not hold.
Invariant property smplace_197 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_186 does not hold.
Invariant property smplace_185 does not hold.
Invariant property smplace_184 does not hold.
Invariant property smplace_93 does not hold.
SDD proceeding with computation,354 properties remain. new max is 4096
SDD size :59925 after 177849
Invariant property smplace_196 does not hold.
Invariant property smplace_195 does not hold.
Invariant property smplace_194 does not hold.
Invariant property smplace_193 does not hold.
Invariant property smplace_192 does not hold.
Invariant property smplace_191 does not hold.
Invariant property smplace_190 does not hold.
Invariant property smplace_189 does not hold.
Invariant property smplace_188 does not hold.
Invariant property smplace_176 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_174 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_172 does not hold.
Invariant property smplace_171 does not hold.
Invariant property smplace_170 does not hold.
Invariant property smplace_169 does not hold.
Invariant property smplace_168 does not hold.
Invariant property smplace_167 does not hold.
Invariant property smplace_166 does not hold.
Invariant property smplace_111 does not hold.
Invariant property smplace_110 does not hold.
Invariant property smplace_109 does not hold.
Invariant property smplace_108 does not hold.
Invariant property smplace_107 does not hold.
Invariant property smplace_106 does not hold.
Invariant property smplace_94 does not hold.
SDD proceeding with computation,327 properties remain. new max is 4096
SDD size :177849 after 248033
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/1636 variables, and 376 constraints, problems are : Problem set: 66 solved, 327 unsolved in 5054 ms.
Refiners :[Domain max(s): 376/617 constraints, Positive P Invariants (semi-flows): 0/13 constraints, State Equation: 0/617 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/393 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10667ms problems are : Problem set: 66 solved, 327 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 327 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 1021/1021 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 608 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 608 transition count 947
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 72 rules applied. Total rules applied 147 place count 538 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 537 transition count 945
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 148 place count 537 transition count 935
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 168 place count 527 transition count 935
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 197 place count 498 transition count 904
Iterating global reduction 3 with 29 rules applied. Total rules applied 226 place count 498 transition count 904
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 229 place count 498 transition count 901
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 229 place count 498 transition count 900
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 497 transition count 900
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 238 place count 490 transition count 806
Iterating global reduction 4 with 7 rules applied. Total rules applied 245 place count 490 transition count 806
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 247 place count 490 transition count 804
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 248 place count 489 transition count 802
Iterating global reduction 5 with 1 rules applied. Total rules applied 249 place count 489 transition count 802
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 309 place count 459 transition count 772
Performed 20 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 349 place count 439 transition count 810
Invariant property smplace_165 does not hold.
Invariant property smplace_164 does not hold.
Invariant property smplace_163 does not hold.
Invariant property smplace_162 does not hold.
Invariant property smplace_161 does not hold.
Invariant property smplace_160 does not hold.
Invariant property smplace_159 does not hold.
Invariant property smplace_158 does not hold.
Invariant property smplace_157 does not hold.
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 368 place count 439 transition count 791
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 392 place count 420 transition count 786
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 394 place count 418 transition count 784
Iterating global reduction 6 with 2 rules applied. Total rules applied 396 place count 418 transition count 784
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 399 place count 418 transition count 781
Invariant property smplace_121 does not hold.
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Invariant property smplace_120 does not hold.
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 408 place count 418 transition count 772
Invariant property smplace_118 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_116 does not hold.
Invariant property smplace_115 does not hold.
Invariant property smplace_114 does not hold.
Invariant property smplace_113 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_101 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_88 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
Applied a total of 408 rules in 576 ms. Remains 418 /617 variables (removed 199) and now considering 772/1021 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 418/617 places, 772/1021 transitions.
SDD proceeding with computation,301 properties remain. new max is 4096
SDD size :248033 after 392319
SDD proceeding with computation,301 properties remain. new max is 8192
SDD size :392319 after 562841
SDD proceeding with computation,301 properties remain. new max is 16384
SDD size :562841 after 868407
Invariant property smplace_200 does not hold.
Invariant property smplace_199 does not hold.
Invariant property smplace_198 does not hold.
Invariant property smplace_156 does not hold.
Invariant property smplace_155 does not hold.
Invariant property smplace_154 does not hold.
Invariant property smplace_153 does not hold.
Invariant property smplace_152 does not hold.
Invariant property smplace_151 does not hold.
Invariant property smplace_150 does not hold.
Invariant property smplace_149 does not hold.
Invariant property smplace_148 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_146 does not hold.
Invariant property smplace_145 does not hold.
Invariant property smplace_144 does not hold.
Invariant property smplace_143 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_141 does not hold.
Invariant property smplace_140 does not hold.
Invariant property smplace_139 does not hold.
Invariant property smplace_138 does not hold.
Invariant property smplace_137 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_135 does not hold.
Invariant property smplace_134 does not hold.
Invariant property smplace_133 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_131 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_128 does not hold.
Invariant property smplace_127 does not hold.
Invariant property smplace_126 does not hold.
Invariant property smplace_125 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_29 does not hold.
Invariant property smplace_16 does not hold.
Invariant property smplace_15 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_9 does not hold.
Invariant property smplace_8 does not hold.
Invariant property smplace_7 does not hold.
Invariant property smplace_4 does not hold.
SDD proceeding with computation,251 properties remain. new max is 16384
SDD size :868407 after 2.45197e+06
SDD proceeding with computation,251 properties remain. new max is 32768
SDD size :2.45197e+06 after 2.92249e+06
RANDOM walk for 4000000 steps (182583 resets) in 95732 ms. (41 steps per ms) remains 155/301 properties
BEST_FIRST walk for 40004 steps (330 resets) in 206 ms. (193 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (330 resets) in 195 ms. (204 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (340 resets) in 177 ms. (224 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (329 resets) in 160 ms. (248 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40002 steps (332 resets) in 196 ms. (203 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (338 resets) in 157 ms. (253 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (324 resets) in 171 ms. (232 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (319 resets) in 230 ms. (173 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (325 resets) in 185 ms. (215 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (339 resets) in 188 ms. (211 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (339 resets) in 151 ms. (263 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (325 resets) in 219 ms. (181 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (331 resets) in 211 ms. (188 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40003 steps (337 resets) in 173 ms. (229 steps per ms) remains 155/155 properties
BEST_FIRST walk for 40004 steps (326 resets) in 207 ms. (192 steps per ms) remains 154/155 properties
BEST_FIRST walk for 40001 steps (329 resets) in 204 ms. (195 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (350 resets) in 186 ms. (213 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (341 resets) in 181 ms. (219 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (322 resets) in 188 ms. (211 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (336 resets) in 149 ms. (266 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (338 resets) in 189 ms. (210 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (326 resets) in 165 ms. (240 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (347 resets) in 165 ms. (240 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (330 resets) in 144 ms. (275 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (336 resets) in 158 ms. (251 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (326 resets) in 209 ms. (190 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (339 resets) in 181 ms. (219 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (335 resets) in 158 ms. (251 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (347 resets) in 161 ms. (246 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (330 resets) in 152 ms. (261 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (336 resets) in 231 ms. (172 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (335 resets) in 194 ms. (205 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (345 resets) in 251 ms. (158 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (337 resets) in 238 ms. (167 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (335 resets) in 197 ms. (202 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (336 resets) in 212 ms. (187 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (331 resets) in 188 ms. (211 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (334 resets) in 269 ms. (148 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (327 resets) in 272 ms. (146 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (329 resets) in 239 ms. (166 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (324 resets) in 197 ms. (202 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (329 resets) in 211 ms. (188 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (337 resets) in 197 ms. (202 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (333 resets) in 196 ms. (203 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (319 resets) in 219 ms. (181 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (334 resets) in 195 ms. (204 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (334 resets) in 205 ms. (194 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (333 resets) in 239 ms. (166 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (331 resets) in 219 ms. (181 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (336 resets) in 219 ms. (181 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (344 resets) in 201 ms. (198 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (320 resets) in 253 ms. (157 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (333 resets) in 198 ms. (201 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (337 resets) in 235 ms. (169 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (327 resets) in 201 ms. (198 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40002 steps (331 resets) in 206 ms. (193 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (333 resets) in 228 ms. (174 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (328 resets) in 183 ms. (217 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (338 resets) in 161 ms. (246 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (338 resets) in 285 ms. (139 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (342 resets) in 219 ms. (181 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (337 resets) in 191 ms. (208 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40003 steps (329 resets) in 208 ms. (191 steps per ms) remains 154/154 properties
BEST_FIRST walk for 40004 steps (335 resets) in 214 ms. (186 steps per ms) remains 154/154 properties
[2026-05-24 14:52:59] [INFO ] Flow matrix only has 768 transitions (discarded 4 similar events)
// Phase 1: matrix 768 rows 418 cols
[2026-05-24 14:52:59] [INFO ] Computed 10 invariants in 6 ms
[2026-05-24 14:52:59] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 161/287 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
SDD proceeding with computation,251 properties remain. new max is 65536
SDD size :2.92249e+06 after 4.02943e+06
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 118/405 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 766/1171 variables, 405/415 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1171 variables, 45/460 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1171 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 15/1186 variables, 13/473 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1186 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (OVERLAPS) 0/1186 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 473 constraints, problems are : Problem set: 0 solved, 126 unsolved in 14890 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 161/287 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:16] [INFO ] Deduced a trap composed of 102 places in 456 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:17] [INFO ] Deduced a trap composed of 93 places in 830 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:17] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:17] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:17] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:19] [INFO ] Deduced a trap composed of 101 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:19] [INFO ] Deduced a trap composed of 94 places in 201 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:19] [INFO ] Deduced a trap composed of 89 places in 185 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:19] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:20] [INFO ] Deduced a trap composed of 102 places in 388 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:20] [INFO ] Deduced a trap composed of 90 places in 198 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:20] [INFO ] Deduced a trap composed of 93 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property smplace_413 does not hold.
Invariant property smplace_412 does not hold.
Invariant property smplace_411 does not hold.
Invariant property smplace_410 does not hold.
Invariant property smplace_409 does not hold.
Invariant property smplace_408 does not hold.
Invariant property smplace_405 does not hold.
[2026-05-24 14:53:21] [INFO ] Deduced a trap composed of 104 places in 232 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,244 properties remain. new max is 65536
SDD size :4.02943e+06 after 6.16926e+07
[2026-05-24 14:53:21] [INFO ] Deduced a trap composed of 102 places in 404 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:22] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:22] [INFO ] Deduced a trap composed of 120 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:22] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:23] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:23] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:24] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:24] [INFO ] Deduced a trap composed of 107 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:24] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 118/405 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 766/1171 variables, 405/437 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1171 variables, 45/482 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1171 variables, 126/608 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:33] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:34] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:34] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:34] [INFO ] Deduced a trap composed of 52 places in 293 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:53:35] [INFO ] Deduced a trap composed of 79 places in 408 ms of which 63 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1171 variables, 5/613 constraints. Problems are: Problem set: 0 solved, 126 unsolved
SDD proceeding with computation,244 properties remain. new max is 131072
SDD size :6.16926e+07 after 8.1301e+07
At refinement iteration 12 (INCLUDED_ONLY) 0/1171 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 1)
(t2 4)
(t3 4)
(t4 0)
(t5 0)
(t6 5)
(t7 5)
(t8 2)
(t9 1)
(t10 1)
(t11 1)
(t12 1)
(t13 6)
(t14 6)
(t15 0)
(t16 0)
(t17 0)
(t18 3)
(t19 3)
(t20 1)
(t21 1)
(t22 2)
(t23 0)
(t24 0)
(t25 1)
(t26 1)
(t27 0)
(t28 0)
(t29 0)
(t30 0)
(t31 0)
(t32 0)
(t33 0)
(t34 0)
(t35 7)
(t36 7)
(t37 7)
(t38 7)
(t39 4)
(t40 3)
(t41 3)
(t42 3)
(t43 3)
(t44 3)
(t45 1)
(t46 1)
(t47 2)
(t48 2)
(t49 0)
(t50 2)
(t51 1)
(t52 1)
(t53 1)
(t54 1)
(t55 2)
(t56 0)
(t57 0)
(t58 1)
(t59 1)
(t60 1)
(t61 1)
(t62 0)
(t63 0)
(t64 3)
(t65 3)
(t66 0)
(t67 0)
(t68 0)
(t69 0)
(t70 7)
(t71 7)
(t72 0)
(t73 0)
(t74 0)
(t75 0)
(t76 2)
(t77 1)
(t78 3)
(t79 3)
(t80 3)
(t81 3)
(t82 0)
(t83 0)
(t84 1)
(t85 1)
(t86 0)
(t87 0)
(t88 0)
(t89 0)
(t90 0)
(t91 0)
(t92 0)
(t93 3)
(t94 3)
(t95 0)
(t96 0)
(t97 4)
(t98 4)
(t99 0)
(t100 0)
(t101 0)
(t102 0)
(t103 0)
(t104 0)
(t105 0)
(t106 0)
(t107 36)
(t108 3)
(t109 3)
(t110 1)
(t111 1)
(t112 2)
(t113 1)
(t114 1)
(t115 1)
(t116 1)
(t117 0)
(t118 0)
(t119 0)
(t120 0)
(t121 3)
(t122 0)
(t123 0)
(t124 3)
(t125 3)
(t126 3)
(t127 3)
(t128 3)
(t129 3)
(t130 3)
(t131 0)
(t132 0)
(t133 3)
(t134 1)
(t135 1)
(t136 2)
(t137 2)
(t138 0)
(t139 2)
(t140 1)
(t141 1)
(t142 1)
(t143 1)
(t144 2)
(t145 3)
(t146 3)
(t147 0)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 0)
(t153 0)
(t154 0)
(t155 0)
(t156 0)
(t157 0)
(t158 0)
(t159 3)
(t160 3)
(t161 0)
(t162 0)
(t163 18)
(t164 18)
(t165 18)
(t166 0)
(t167 0)
(t168 1)
(t169 1)
(t170 1)
(t171 0)
(t172 0)
(t173 0)
(t174 0)
(t175 0)
(t176 3)
(t177 3)
(t178 0)
(t179 2)
(t180 1)
(t183 0)
(t184 1)
(t185 1)
(t186 1)
(t187 1)
(t188 1)
(t189 0)
(t190 0)
(t191 1)
(t192 0)
(t193 0)
(t194 0)
(t195 0)
(t196 0)
(t197 0)
(t198 0)
(t199 0)
(t200 0)
(t201 0)
(t202 0)
(t203 1)
(t204 1)
(t205 0)
(t206 0)
(t207 0)
(t208 0)
(t209 0)
(t210 0)
(t211 0)
(t212 0)
(t213 0)
(t214 0)
(t215 0)
(t216 0)
(t217 0)
(t218 0)
(t219 0)
(t220 1)
(t221 1)
(t222 0)
(t223 1)
(t224 0)
(t225 0)
(t226 116)
(t227 7)
(t228 0)
(t229 0)
(t230 28)
(t231 28)
(t232 0)
(t233 0)
(t234 2)
(t235 1)
(t236 1)
(t237 1)
(t238 1)
(t239 1)
(t240 1)
(t241 1)
(t242 1)
(t243 1)
(t244 1)
(t245 1)
(t246 1)
(t247 1)
(t248 0)
(t249 2)
(t250 2)
(t251 0)
(t252 0)
(t253 0)
(t254 0)
(t255 1)
(t256 0)
(t257 0)
(t258 3)
(t259 1)
(t260 1)
(t261 1)
(t262 3)
(t263 3)
(t264 2)
(t265 0)
(t266 0)
(t267 0)
(t268 0)
(t269 0)
(t270 5)
(t271 0)
(t272 0)
(t273 0)
(t274 5)
(t275 0)
(t276 0)
(t277 4)
(t278 0)
(t279 0)
(t280 0)
(t281 0)
(t282 0)
(t283 0)
(t284 0)
(t285 0)
(t286 0)
(t287 0)
(t288 0)
(t289 0)
(t290 0)
(t291 0)
(t292 0)
(t293 0)
(t294 0)
(t295 0)
(t296 0)
(t297 0)
(t298 0)
(t299 0)
(t300 0)
(t301 0)
(t302 0)
(t303 0)
(t304 0)
(t305 0)
(t306 0)
(t307 0)
(t308 0)
(t309 0)
(t310 0)
(t311 0)
(t312 0)
(t313 0)
(t314 0)
(t315 0)
(t316 0)
(t317 0)
(t318 0)
(t319 0)
(t320 0)
(t321 0)
(t322 0)
(t323 0)
(t324 0)
(t325 0)
(t326 0)
(t327 0)
(t328 0)
(t329 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t335 0)
(t336 0)
(t337 3)
(t338 0)
(t339 0)
(t340 0)
(t341 0)
(t342 0)
(t343 0)
(t344 0)
(t345 0)
(t346 3)
(t347 0)
(t348 0)
(t349 0)
(t350 0)
(t351 0)
(t352 0)
(t353 0)
(t354 0)
(t355 3)
(t356 0)
(t357 2)
(t358 1)
(t359 1)
(t360 3)
(t361 0)
(t362 0)
(t363 2)
(t364 0)
(t365 0)
(t366 2)
(t367 1)
(t368 0)
(t369 1)
(t370 1)
(t371 1)
(t372 1)
(t373 1)
(t374 1)
(t375 0)
(t376 2)
(t377 1)
(t378 0)
(t379 1)
(t380 1)
(t381 0)
(t382 1)
(t383 1)
(t384 2)
(t385 0)
(t386 1)
(t387 0)
(t388 2)
(t389 0)
(t390 0)
(t391 3)
(t392 3)
(t393 0)
(t394 0)
(t395 1)
(t396 0)
(t397 1)
(t398 1)
(t399 0)
(t400 0)
(t401 0)
(t402 1)
(t403 0)
(t404 1)
(t405 0)
(t406 0)
(t407 0)
(t408 1)
(t409 1)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 3)
(t416 2)
(t417 3)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 1)
(t423 6)
(t424 0)
(t425 0)
(t426 0)
(t427 7)
(t428 1)
(t429 2)
(t430 1)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 0)
(t436 4)
(t437 0)
(t438 0)
(t439 1)
(t440 0)
(t441 0)
(t442 3)
(t443 0)
(t444 0)
(t445 5)
(t446 0)
(t447 1)
(t448 0)
(t449 0)
(t450 1)
(t451 0)
(t452 1)
(t453 0)
(t454 3)
(t455 0)
(t456 3)
(t457 0)
(t458 7)
(t459 0)
(t460 0)
(t461 0)
(t462 0)
(t463 0)
(t464 0)
(t465 2)
(t466 0)
(t467 1)
(t468 1)
(t469 1)
(t470 0)
(t471 0)
(t472 7)
(t473 0)
(t474 1)
(t475 0)
(t476 6)
(t477 0)
(t478 5)
(t479 5)
(t480 5)
(t481 0)
(t482 1)
(t483 5)
(t484 5)
(t485 0)
(t486 0)
(t487 0)
(t488 0)
(t489 0)
(t490 0)
(t491 1)
(t492 1)
(t493 0)
(t494 0)
(t495 0)
(t496 0)
(t497 0)
(t498 0)
(t499 0)
(t500 0)
(t501 0)
(t502 0)
(t503 0)
(t504 0)
(t505 3)
(t506 3)
(t507 3)
(t508 3)
(t509 3)
(t510 3)
(t511 4)
(t512 0)
(t513 0)
(t514 36)
(t515 0)
(t516 21)
(t517 3)
(t518 3)
(t519 3)
(t520 3)
(t521 1)
(t522 1)
(t523 0)
(t524 0)
(t525 1)
(t526 0)
(t527 0)
(t528 0)
(t529 1)
(t530 1)
(t531 0)
(t532 0)
(t533 0)
(t534 0)
(t535 0)
(t536 0)
(t537 0)
(t538 0)
(t539 0)
(t540 5)
(t541 0)
(t542 0)
(t543 0)
(t544 14)
(t545 0)
(t546 14)
(t547 0)
(t548 28)
(t549 29)
(t550 0)
(t551 0)
(t552 0)
(t553 0)
(t554 0)
(t555 0)
(t556 0)
(t557 0)
(t558 1)
(t559 0)
(t560 0)
(t561 0)
(t562 0)
(t563 0)
(t564 1)
(t565 0)
(t566 0)
(t567 0)
(t568 0)
(t569 0)
(t570 0)
(t571 0)
(t572 0)
(t573 0)
(t574 0)
(t575 0)
(t576 0)
(t577 0)
(t578 0)
(t579 0)
(t580 0)
(t581 0)
(t582 0)
(t583 0)
(t584 0)
(t585 37)
(t586 1)
(t587 0)
(t588 0)
(t589 0)
(t590 0)
(t591 0)
(t592 0)
(t593 0)
(t594 7)
(t595 0)
(t596 0)
(t597 0)
(t598 7)
(t599 0)
(t600 0)
(t601 0)
(t602 1)
(t603 0)
(t604 0)
(t605 0)
(t606 0)
(t607 0)
(t608 0)
(t609 1)
(t610 0)
(t611 0)
(t612 0)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 0)
(t627 0)
(t628 0)
(t629 0)
(t630 0)
(t631 0)
(t632 0)
(t633 0)
(t634 0)
(t635 0)
(t636 0)
(t637 0)
(t638 0)
(t639 0)
(t640 7)
(t641 0)
(t642 7)
(t643 1)
(t644 0)
(t645 5)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 3)
(t651 0)
(t652 3)
(t653 0)
(t654 0)
(t655 0)
(t656 0)
(t657 0)
(t658 0)
(t659 0)
(t660 0)
(t661 1)
(t662 0)
(t663 0)
(t664 0)
(t665 0)
(t666 0)
(t667 1)
(t668 0)
(t669 0)
(t670 0)
(t671 0)
(t672 0)
(t673 0)
(t674 0)
(t675 0)
(t676 21)
(t677 0)
(t678 34)
(t679 18)
(t680 0)
(t681 0)
(t682 0)
(t683 7)
(t684 0)
(t685 1)
(t686 1)
(t687 1)
(t688 1)
(t689 1)
(t690 0)
(t691 2)
(t692 0)
(t693 0)
(t694 2)
(t695 0)
(t696 0)
(t697 0)
(t698 5)
(t699 5)
(t700 5)
(t701 5)
(t702 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t707 0)
(t708 1)
(t709 0)
(t710 0)
(t711 0)
(t712 0)
(t713 0)
(t714 0)
(t715 0)
(t716 0)
(t717 0)
(t718 0)
(t719 3)
(t720 0)
(t721 3)
(t722 3)
(t723 0)
(t724 36)
(t725 0)
(t726 1)
(t727 0)
(t728 0)
(t729 0)
(t730 2)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 59985ms, After SMT, problems are : Problem set: 0 solved, 126 unsolved
Fused 126 Parikh solutions to 110 different solutions.
Parikh walk visited 0 properties in 19432 ms.
Support contains 126 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 772/772 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 418 transition count 726
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 372 transition count 726
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 92 place count 372 transition count 722
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 368 transition count 722
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 117 place count 351 transition count 702
Iterating global reduction 2 with 17 rules applied. Total rules applied 134 place count 351 transition count 702
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 134 place count 351 transition count 700
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 349 transition count 700
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 343 transition count 688
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 343 transition count 688
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 153 place count 340 transition count 685
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 340 transition count 685
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 162 place count 340 transition count 679
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 165 place count 337 transition count 679
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 213 place count 313 transition count 655
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 214 place count 312 transition count 654
Iterating global reduction 4 with 1 rules applied. Total rules applied 215 place count 312 transition count 654
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 253 place count 293 transition count 698
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 256 place count 293 transition count 695
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 257 place count 292 transition count 689
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 292 transition count 689
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 259 place count 291 transition count 687
Iterating global reduction 5 with 1 rules applied. Total rules applied 260 place count 291 transition count 687
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 261 place count 290 transition count 684
Iterating global reduction 5 with 1 rules applied. Total rules applied 262 place count 290 transition count 684
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 263 place count 289 transition count 682
Iterating global reduction 5 with 1 rules applied. Total rules applied 264 place count 289 transition count 682
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 265 place count 288 transition count 679
Iterating global reduction 5 with 1 rules applied. Total rules applied 266 place count 288 transition count 679
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 267 place count 287 transition count 677
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 287 transition count 677
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 269 place count 286 transition count 674
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 286 transition count 674
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 271 place count 285 transition count 672
Iterating global reduction 5 with 1 rules applied. Total rules applied 272 place count 285 transition count 672
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 273 place count 284 transition count 669
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 284 transition count 669
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 275 place count 283 transition count 667
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 283 transition count 667
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 277 place count 282 transition count 665
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 282 transition count 665
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 279 place count 281 transition count 663
Iterating global reduction 5 with 1 rules applied. Total rules applied 280 place count 281 transition count 663
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 301 place count 281 transition count 642
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 303 place count 281 transition count 640
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 305 place count 279 transition count 640
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 308 place count 279 transition count 817
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 311 place count 276 transition count 817
Applied a total of 311 rules in 213 ms. Remains 276 /418 variables (removed 142) and now considering 817/772 (removed -45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 276/418 places, 817/772 transitions.
Invariant property smplace_407 does not hold.
Invariant property smplace_404 does not hold.
Invariant property smplace_403 does not hold.
Invariant property smplace_402 does not hold.
Invariant property smplace_401 does not hold.
Invariant property smplace_400 does not hold.
Invariant property smplace_399 does not hold.
Invariant property smplace_385 does not hold.
Invariant property smplace_384 does not hold.
Invariant property smplace_383 does not hold.
Invariant property smplace_361 does not hold.
Invariant property smplace_360 does not hold.
Invariant property smplace_359 does not hold.
Invariant property smplace_358 does not hold.
Invariant property smplace_357 does not hold.
Invariant property smplace_356 does not hold.
Invariant property smplace_355 does not hold.
Invariant property smplace_354 does not hold.
Invariant property smplace_353 does not hold.
Invariant property smplace_352 does not hold.
Invariant property smplace_351 does not hold.
Invariant property smplace_350 does not hold.
Invariant property smplace_300 does not hold.
Invariant property smplace_299 does not hold.
Invariant property smplace_298 does not hold.
Invariant property smplace_297 does not hold.
SDD proceeding with computation,218 properties remain. new max is 131072
SDD size :8.1301e+07 after 3.28123e+08
RANDOM walk for 4000000 steps (86750 resets) in 70624 ms. (56 steps per ms) remains 46/126 properties
BEST_FIRST walk for 400002 steps (1794 resets) in 1334 ms. (299 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (1812 resets) in 1323 ms. (302 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (1786 resets) in 1280 ms. (312 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1809 resets) in 1406 ms. (284 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (1821 resets) in 1388 ms. (287 steps per ms) remains 44/46 properties
BEST_FIRST walk for 400003 steps (1825 resets) in 1340 ms. (298 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1846 resets) in 1267 ms. (315 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1815 resets) in 1507 ms. (265 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (1850 resets) in 1535 ms. (260 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (1806 resets) in 1314 ms. (304 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1844 resets) in 1631 ms. (245 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (1809 resets) in 1293 ms. (309 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (1814 resets) in 1499 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1813 resets) in 1405 ms. (284 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (1814 resets) in 1389 ms. (287 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (1840 resets) in 1651 ms. (242 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (1847 resets) in 1429 ms. (279 steps per ms) remains 42/44 properties
BEST_FIRST walk for 400003 steps (1836 resets) in 1834 ms. (217 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (1830 resets) in 1459 ms. (273 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1851 resets) in 1264 ms. (316 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1808 resets) in 1434 ms. (278 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1811 resets) in 1321 ms. (302 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1810 resets) in 1351 ms. (295 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (1820 resets) in 1146 ms. (348 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (1788 resets) in 1698 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1819 resets) in 1269 ms. (314 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1853 resets) in 1318 ms. (303 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1825 resets) in 1665 ms. (240 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1814 resets) in 1284 ms. (311 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (1817 resets) in 1422 ms. (281 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (1806 resets) in 1538 ms. (259 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400003 steps (1837 resets) in 1552 ms. (257 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (1848 resets) in 983 ms. (406 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (1805 resets) in 1034 ms. (386 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (1828 resets) in 1173 ms. (340 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (1822 resets) in 972 ms. (411 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (1807 resets) in 1127 ms. (354 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (1818 resets) in 1038 ms. (384 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (1802 resets) in 1112 ms. (359 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (1805 resets) in 1095 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (1805 resets) in 1251 ms. (319 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (1813 resets) in 1330 ms. (300 steps per ms) remains 41/41 properties
[2026-05-24 14:54:57] [INFO ] Flow matrix only has 808 transitions (discarded 9 similar events)
// Phase 1: matrix 808 rows 276 cols
[2026-05-24 14:54:57] [INFO ] Computed 10 invariants in 5 ms
[2026-05-24 14:54:57] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 138/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 81/260 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 804/1064 variables, 260/270 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 98/368 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 18/1082 variables, 14/382 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1082 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 2/1084 variables, 2/384 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1084 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Invariant property smplace_601 does not hold.
Invariant property smplace_600 does not hold.
Invariant property smplace_599 does not hold.
Invariant property smplace_598 does not hold.
Invariant property smplace_597 does not hold.
Invariant property smplace_596 does not hold.
Invariant property smplace_593 does not hold.
At refinement iteration 12 (OVERLAPS) 0/1084 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Invariant property smplace_398 does not hold.
Invariant property smplace_397 does not hold.
Invariant property smplace_395 does not hold.
Invariant property smplace_391 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_386 does not hold.
Invariant property smplace_382 does not hold.
Invariant property smplace_380 does not hold.
Invariant property smplace_379 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_375 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_349 does not hold.
Invariant property smplace_348 does not hold.
Invariant property smplace_347 does not hold.
Invariant property smplace_346 does not hold.
Invariant property smplace_309 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_296 does not hold.
Invariant property smplace_295 does not hold.
Invariant property smplace_294 does not hold.
SDD proceeding with computation,189 properties remain. new max is 131072
SDD size :3.28123e+08 after 1.62605e+09
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 384 constraints, problems are : Problem set: 0 solved, 41 unsolved in 6772 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 276/276 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 138/179 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 81/260 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:06] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:06] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:06] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:06] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:06] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:07] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:07] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 804/1064 variables, 260/277 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1064 variables, 98/375 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1064 variables, 41/416 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:09] [INFO ] Deduced a trap composed of 17 places in 372 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:09] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1064 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:55:13] [INFO ] Deduced a trap composed of 63 places in 382 ms of which 58 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1064 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1064 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 18/1082 variables, 14/433 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1082 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 14 (OVERLAPS) 2/1084 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Invariant property smplace_595 does not hold.
Invariant property smplace_592 does not hold.
Invariant property smplace_591 does not hold.
SDD proceeding with computation,186 properties remain. new max is 131072
SDD size :1.62605e+09 after 1.70943e+09
At refinement iteration 15 (INCLUDED_ONLY) 0/1084 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Invariant property smplace_590 does not hold.
Invariant property smplace_589 does not hold.
Invariant property smplace_588 does not hold.
Invariant property smplace_587 does not hold.
Invariant property smplace_580 does not hold.
Invariant property smplace_579 does not hold.
Invariant property smplace_578 does not hold.
Invariant property smplace_576 does not hold.
Invariant property smplace_575 does not hold.
Invariant property smplace_574 does not hold.
Invariant property smplace_573 does not hold.
Invariant property smplace_572 does not hold.
Invariant property smplace_571 does not hold.
Invariant property smplace_553 does not hold.
Invariant property smplace_546 does not hold.
Invariant property smplace_545 does not hold.
Invariant property smplace_544 does not hold.
Invariant property smplace_543 does not hold.
Invariant property smplace_542 does not hold.
Invariant property smplace_541 does not hold.
Invariant property smplace_540 does not hold.
Invariant property smplace_539 does not hold.
Invariant property smplace_538 does not hold.
Invariant property smplace_489 does not hold.
Invariant property smplace_488 does not hold.
Invariant property smplace_487 does not hold.
Invariant property smplace_486 does not hold.
Invariant property smplace_482 does not hold.
SDD proceeding with computation,158 properties remain. new max is 131072
SDD size :1.70943e+09 after 2.61934e+09
At refinement iteration 16 (OVERLAPS) 0/1084 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 435 constraints, problems are : Problem set: 0 solved, 41 unsolved in 75013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 276/276 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 81852ms problems are : Problem set: 0 solved, 41 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 817/817 transitions.
Graph (complete) has 1282 edges and 276 vertex of which 274 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 274 transition count 812
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 271 transition count 812
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 271 transition count 811
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 270 transition count 811
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 29 place count 252 transition count 793
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 252 transition count 793
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 47 place count 252 transition count 792
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 251 transition count 792
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 62 place count 238 transition count 776
Iterating global reduction 2 with 13 rules applied. Total rules applied 75 place count 238 transition count 776
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 77 place count 236 transition count 772
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 236 transition count 772
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 105 place count 223 transition count 759
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 220 transition count 744
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 220 transition count 744
Performed 9 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 129 place count 211 transition count 755
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 211 transition count 754
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 137 place count 211 transition count 747
Applied a total of 137 rules in 116 ms. Remains 211 /276 variables (removed 65) and now considering 747/817 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 211/276 places, 747/817 transitions.
RANDOM walk for 4000000 steps (86898 resets) in 39253 ms. (101 steps per ms) remains 34/41 properties
BEST_FIRST walk for 400003 steps (1849 resets) in 1050 ms. (380 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1829 resets) in 963 ms. (414 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1843 resets) in 1010 ms. (395 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1782 resets) in 1115 ms. (358 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (1784 resets) in 1264 ms. (316 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1808 resets) in 995 ms. (401 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1850 resets) in 1059 ms. (377 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (1831 resets) in 1231 ms. (324 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1827 resets) in 1042 ms. (383 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1848 resets) in 1261 ms. (316 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1842 resets) in 1159 ms. (344 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1815 resets) in 1090 ms. (366 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (1793 resets) in 948 ms. (421 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1784 resets) in 917 ms. (435 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (1816 resets) in 1087 ms. (367 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1832 resets) in 951 ms. (420 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1808 resets) in 1200 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (1810 resets) in 1206 ms. (331 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1809 resets) in 1048 ms. (381 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (1839 resets) in 969 ms. (412 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (1780 resets) in 1279 ms. (312 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (1817 resets) in 1084 ms. (368 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (1819 resets) in 1189 ms. (336 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (1821 resets) in 1079 ms. (370 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400003 steps (1843 resets) in 990 ms. (403 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1837 resets) in 1082 ms. (369 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 941 ms. (424 steps per ms) remains 33/33 properties
SDD proceeding with computation,158 properties remain. new max is 262144
SDD size :2.61934e+09 after 4.03562e+09
BEST_FIRST walk for 400003 steps (1841 resets) in 1184 ms. (337 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1823 resets) in 980 ms. (407 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1803 resets) in 1066 ms. (374 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1776 resets) in 1126 ms. (354 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1825 resets) in 902 ms. (442 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (1810 resets) in 1151 ms. (347 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1821 resets) in 1407 ms. (284 steps per ms) remains 33/33 properties
[2026-05-24 14:56:44] [INFO ] Flow matrix only has 737 transitions (discarded 10 similar events)
// Phase 1: matrix 737 rows 211 cols
[2026-05-24 14:56:44] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 14:56:44] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 88/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 76/197 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 737/934 variables, 197/207 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/934 variables, 98/305 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/934 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 14/948 variables, 14/319 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/948 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/948 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 948/948 variables, and 319 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2515 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 211/211 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 88/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 76/197 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:56:47] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:56:47] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:56:48] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 737/934 variables, 197/210 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/934 variables, 98/308 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/934 variables, 33/341 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:56:49] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/934 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/934 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 14/948 variables, 14/356 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/948 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 0/948 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 948/948 variables, and 356 constraints, problems are : Problem set: 0 solved, 33 unsolved in 14933 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 211/211 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17473ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 0 properties in 2278 ms.
Support contains 33 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 747/747 transitions.
Graph (complete) has 1156 edges and 211 vertex of which 210 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 210 transition count 746
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 209 transition count 746
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 208 transition count 745
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 208 transition count 745
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 207 transition count 744
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 206 transition count 743
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 206 transition count 743
Applied a total of 9 rules in 56 ms. Remains 206 /211 variables (removed 5) and now considering 743/747 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 206/211 places, 743/747 transitions.
RANDOM walk for 4000000 steps (86892 resets) in 38678 ms. (103 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (1824 resets) in 1155 ms. (346 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1823 resets) in 961 ms. (415 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1833 resets) in 1175 ms. (340 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (1826 resets) in 1000 ms. (399 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (1821 resets) in 1049 ms. (380 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1818 resets) in 938 ms. (425 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1813 resets) in 1005 ms. (397 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1788 resets) in 917 ms. (435 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1828 resets) in 1191 ms. (335 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1840 resets) in 974 ms. (410 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1824 resets) in 886 ms. (450 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1836 resets) in 1182 ms. (338 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1804 resets) in 976 ms. (409 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1829 resets) in 1025 ms. (389 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1783 resets) in 965 ms. (414 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1797 resets) in 980 ms. (407 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (1837 resets) in 1091 ms. (366 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1818 resets) in 985 ms. (405 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1836 resets) in 824 ms. (484 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1800 resets) in 1172 ms. (341 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (1816 resets) in 1097 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1854 resets) in 1096 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1833 resets) in 944 ms. (423 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1839 resets) in 1013 ms. (394 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1849 resets) in 856 ms. (466 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1837 resets) in 1040 ms. (384 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1837 resets) in 1029 ms. (388 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (1803 resets) in 1041 ms. (383 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1837 resets) in 1054 ms. (379 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1826 resets) in 1065 ms. (375 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (1829 resets) in 989 ms. (404 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1835 resets) in 1255 ms. (318 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (1822 resets) in 1044 ms. (382 steps per ms) remains 33/33 properties
SDD proceeding with computation,158 properties remain. new max is 524288
SDD size :4.03562e+09 after 4.20094e+09
Interrupted probabilistic random walk after 5100532 steps, run timeout after 66001 ms. (steps per millisecond=77 ) properties seen :3 out of 33
Probabilistic random walk after 5100532 steps, saw 1481296 distinct states, run finished after 66016 ms. (steps per millisecond=77 ) properties seen :3
[2026-05-24 14:58:32] [INFO ] Flow matrix only has 733 transitions (discarded 10 similar events)
// Phase 1: matrix 733 rows 206 cols
[2026-05-24 14:58:32] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 14:58:32] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 87/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/191 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 733/924 variables, 191/201 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/924 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/924 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 15/939 variables, 15/314 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/939 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 939/939 variables, and 314 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 87/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/191 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:58:36] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:58:36] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:58:37] [INFO ] Deduced a trap composed of 111 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 14:58:37] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 733/924 variables, 191/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/924 variables, 98/303 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/924 variables, 30/333 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/924 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 15/939 variables, 15/348 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/939 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/939 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 939/939 variables, and 348 constraints, problems are : Problem set: 0 solved, 30 unsolved in 13460 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16767ms problems are : Problem set: 0 solved, 30 unsolved
Fused 30 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 3985 ms.
Support contains 30 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 743/743 transitions.
Graph (complete) has 1148 edges and 206 vertex of which 204 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 203 transition count 742
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 203 transition count 742
Applied a total of 3 rules in 24 ms. Remains 203 /206 variables (removed 3) and now considering 742/743 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 203/206 places, 742/743 transitions.
RANDOM walk for 4000000 steps (86945 resets) in 35894 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1847 resets) in 1142 ms. (349 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 909 ms. (439 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1802 resets) in 1118 ms. (357 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1818 resets) in 896 ms. (445 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1808 resets) in 914 ms. (437 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1835 resets) in 868 ms. (460 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1852 resets) in 864 ms. (462 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1822 resets) in 1123 ms. (355 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1810 resets) in 899 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1788 resets) in 902 ms. (442 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1847 resets) in 820 ms. (487 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1823 resets) in 1062 ms. (376 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1840 resets) in 1175 ms. (340 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1819 resets) in 1048 ms. (381 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1809 resets) in 1187 ms. (336 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1793 resets) in 982 ms. (406 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1842 resets) in 1135 ms. (352 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1844 resets) in 1137 ms. (351 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1820 resets) in 982 ms. (406 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1798 resets) in 904 ms. (441 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1792 resets) in 1142 ms. (349 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1811 resets) in 913 ms. (437 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1838 resets) in 1155 ms. (346 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1807 resets) in 900 ms. (443 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1799 resets) in 1029 ms. (388 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1802 resets) in 961 ms. (415 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1852 resets) in 1035 ms. (386 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1875 resets) in 1088 ms. (367 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1823 resets) in 1112 ms. (359 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1849 resets) in 994 ms. (402 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 4602081 steps, run timeout after 60001 ms. (steps per millisecond=76 ) properties seen :0 out of 30
Probabilistic random walk after 4602081 steps, saw 1334344 distinct states, run finished after 60002 ms. (steps per millisecond=76 ) properties seen :0
[2026-05-24 15:00:14] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:00:14] [INFO ] Computed 10 invariants in 4 ms
[2026-05-24 15:00:14] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 87/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/191 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 732/923 variables, 191/201 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 12/935 variables, 12/311 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 87/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/191 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:17] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:17] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:17] [INFO ] Deduced a trap composed of 111 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:18] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 732/923 variables, 191/205 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 98/303 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/923 variables, 30/333 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:19] [INFO ] Deduced a trap composed of 36 places in 270 ms of which 39 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/923 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 12/935 variables, 12/346 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/935 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 346 constraints, problems are : Problem set: 0 solved, 30 unsolved in 14683 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17333ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 0 properties in 6008 ms.
Support contains 30 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Applied a total of 0 rules in 13 ms. Remains 203 /203 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 203/203 places, 742/742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Applied a total of 0 rules in 15 ms. Remains 203 /203 variables (removed 0) and now considering 742/742 (removed 0) transitions.
[2026-05-24 15:00:37] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:00:37] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-24 15:00:37] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:00:38] [INFO ] State equation strengthened by 98 read => feed constraints.
[2026-05-24 15:00:38] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:00:38] [INFO ] Redundant transitions in 53 ms returned []
Running 734 sub problems to find dead transitions.
[2026-05-24 15:00:38] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:00:38] [INFO ] Invariant cache hit.
[2026-05-24 15:00:38] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:50] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:50] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:51] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:51] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:51] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:51] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:52] [INFO ] Deduced a trap composed of 109 places in 238 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:52] [INFO ] Deduced a trap composed of 111 places in 196 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:52] [INFO ] Deduced a trap composed of 111 places in 193 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:52] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:53] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:54] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:55] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:00:56] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 29 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 734 unsolved
SDD proceeding with computation,158 properties remain. new max is 1048576
SDD size :4.20094e+09 after 7.25682e+09
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.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 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 1.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 0.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 0.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 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)timeout
(s150 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 734 unsolved
SMT process timed out in 30981ms, After SMT, problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 30989ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32190 ms. Remains : 203/203 places, 742/742 transitions.
RANDOM walk for 400000 steps (8647 resets) in 7018 ms. (56 steps per ms) remains 30/30 properties
Running SMT prover for 30 properties.
[2026-05-24 15:01:11] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:01:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:01:11] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 15:01:12] [INFO ] After 317ms SMT Verify possible using state equation in real domain returned unsat :0 sat :30
[2026-05-24 15:01:12] [INFO ] State equation strengthened by 98 read => feed constraints.
[2026-05-24 15:01:12] [INFO ] After 233ms SMT Verify possible using 98 Read/Feed constraints in real domain returned unsat :0 sat :30
TRAPS : Iteration 0
[2026-05-24 15:01:13] [INFO ] After 1661ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:30
[2026-05-24 15:01:13] [INFO ] After 2103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:01:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 15:01:14] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2026-05-24 15:01:14] [INFO ] After 308ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :30
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:01:15] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 3 ms to minimize.
[2026-05-24 15:01:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:01:16] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 31 ms to minimize.
[2026-05-24 15:01:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 295 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:01:16] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 20 ms to minimize.
[2026-05-24 15:01:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:01:18] [INFO ] Deduced a trap composed of 58 places in 245 ms of which 28 ms to minimize.
[2026-05-24 15:01:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:01:19] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 18 ms to minimize.
[2026-05-24 15:01:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:01:19] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 4 ms to minimize.
[2026-05-24 15:01:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
TRAPS : Iteration 3
[2026-05-24 15:01:21] [INFO ] After 6798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
[2026-05-24 15:01:21] [INFO ] After 7436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
RANDOM walk for 4000000 steps (86788 resets) in 36452 ms. (109 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1848 resets) in 924 ms. (432 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1771 resets) in 1200 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1814 resets) in 893 ms. (447 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1796 resets) in 1087 ms. (367 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1820 resets) in 912 ms. (438 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1812 resets) in 1080 ms. (370 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1791 resets) in 894 ms. (446 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1803 resets) in 943 ms. (423 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1787 resets) in 918 ms. (435 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1833 resets) in 1121 ms. (356 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1846 resets) in 1109 ms. (360 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1811 resets) in 1321 ms. (302 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1829 resets) in 991 ms. (403 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1809 resets) in 1127 ms. (354 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1802 resets) in 914 ms. (437 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1852 resets) in 1118 ms. (357 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1845 resets) in 942 ms. (424 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1809 resets) in 1135 ms. (352 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1809 resets) in 922 ms. (433 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1822 resets) in 1127 ms. (354 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1827 resets) in 945 ms. (422 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1832 resets) in 1134 ms. (352 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1836 resets) in 946 ms. (422 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400001 steps (1791 resets) in 972 ms. (411 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1808 resets) in 944 ms. (423 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1817 resets) in 1145 ms. (349 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1823 resets) in 1180 ms. (338 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400002 steps (1824 resets) in 925 ms. (431 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400003 steps (1809 resets) in 1087 ms. (367 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (1847 resets) in 1186 ms. (336 steps per ms) remains 30/30 properties
Detected timeout of ITS tools.
[2026-05-24 15:02:19] [INFO ] Flatten gal took : 67 ms
[2026-05-24 15:02:19] [INFO ] Applying decomposition
[2026-05-24 15:02:19] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3782108012447665074.txt' '-o' '/tmp/graph3782108012447665074.bin' '-w' '/tmp/graph3782108012447665074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3782108012447665074.bin' '-l' '-1' '-v' '-w' '/tmp/graph3782108012447665074.weights' '-q' '0' '-e' '0.001'
[2026-05-24 15:02:20] [INFO ] Decomposing Gal with order
[2026-05-24 15:02:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 15:02:20] [INFO ] Removed a total of 1000 redundant transitions.
[2026-05-24 15:02:20] [INFO ] Flatten gal took : 421 ms
[2026-05-24 15:02:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 104 ms.
[2026-05-24 15:02:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15484669265744344516.gal : 49 ms
[2026-05-24 15:02:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12074595683670656890.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15484669265744344516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12074595683670656890.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12074595683670656890.prop.
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :1 after 4
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :10 after 207178
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :207178 after 314434
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :314434 after 732090
SDD proceeding with computation,30 properties remain. new max is 2048
SDD size :732090 after 6.31398e+09
Interrupted probabilistic random walk after 5152939 steps, run timeout after 66001 ms. (steps per millisecond=78 ) properties seen :0 out of 30
Probabilistic random walk after 5152939 steps, saw 1495791 distinct states, run finished after 66001 ms. (steps per millisecond=78 ) properties seen :0
[2026-05-24 15:02:49] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:02:49] [INFO ] Invariant cache hit.
[2026-05-24 15:02:49] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 87/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/191 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 732/923 variables, 191/201 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/923 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 12/935 variables, 12/311 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2170 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 135.0 s and query timeout 13500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 87/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 74/191 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:02:52] [INFO ] Deduced a trap composed of 16 places in 217 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:02:52] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:02:52] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:02:52] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:02:52] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 732/923 variables, 191/206 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/923 variables, 98/304 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/923 variables, 30/334 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:02:53] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/923 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/923 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 12/935 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 0/935 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 347 constraints, problems are : Problem set: 0 solved, 30 unsolved in 9222 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11427ms problems are : Problem set: 0 solved, 30 unsolved
Parikh walk visited 0 properties in 5703 ms.
Support contains 30 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Applied a total of 0 rules in 14 ms. Remains 203 /203 variables (removed 0) and now considering 742/742 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 203/203 places, 742/742 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Applied a total of 0 rules in 11 ms. Remains 203 /203 variables (removed 0) and now considering 742/742 (removed 0) transitions.
[2026-05-24 15:03:06] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:03:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:03:06] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-24 15:03:06] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:03:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:03:07] [INFO ] State equation strengthened by 98 read => feed constraints.
[2026-05-24 15:03:07] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:03:07] [INFO ] Redundant transitions in 11 ms returned []
Running 734 sub problems to find dead transitions.
[2026-05-24 15:03:07] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:03:07] [INFO ] Invariant cache hit.
[2026-05-24 15:03:07] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:21] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:22] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:22] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:22] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:22] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:23] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:23] [INFO ] Deduced a trap composed of 109 places in 228 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:23] [INFO ] Deduced a trap composed of 111 places in 237 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:24] [INFO ] Deduced a trap composed of 111 places in 231 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:24] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:24] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:26] [INFO ] Deduced a trap composed of 58 places in 274 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:28] [INFO ] Deduced a trap composed of 53 places in 240 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:03:29] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/935 variables, and 24 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/203 constraints, ReadFeed: 0/98 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 732/934 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/934 variables, 98/324 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/934 variables, 726/1050 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 934/935 variables, and 1050 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 202/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 726/734 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60628ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60631ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61825 ms. Remains : 203/203 places, 742/742 transitions.
RANDOM walk for 400000 steps (8626 resets) in 3973 ms. (100 steps per ms) remains 30/30 properties
Running SMT prover for 30 properties.
[2026-05-24 15:04:09] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:04:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:04:09] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 15:04:10] [INFO ] After 368ms SMT Verify possible using state equation in real domain returned unsat :0 sat :30
[2026-05-24 15:04:10] [INFO ] State equation strengthened by 98 read => feed constraints.
[2026-05-24 15:04:10] [INFO ] After 245ms SMT Verify possible using 98 Read/Feed constraints in real domain returned unsat :0 sat :30
TRAPS : Iteration 0
[2026-05-24 15:04:12] [INFO ] After 2408ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:30
[2026-05-24 15:04:12] [INFO ] After 2911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:04:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 15:04:13] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2026-05-24 15:04:13] [INFO ] After 314ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :30
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:14] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 5 ms to minimize.
[2026-05-24 15:04:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:15] [INFO ] Deduced a trap composed of 36 places in 297 ms of which 28 ms to minimize.
[2026-05-24 15:04:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:16] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 17 ms to minimize.
[2026-05-24 15:04:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:18] [INFO ] Deduced a trap composed of 58 places in 351 ms of which 46 ms to minimize.
[2026-05-24 15:04:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:18] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 29 ms to minimize.
[2026-05-24 15:04:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 369 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:19] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 6 ms to minimize.
[2026-05-24 15:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
TRAPS : Iteration 3
[2026-05-24 15:04:21] [INFO ] After 8024ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
[2026-05-24 15:04:21] [INFO ] After 8661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
RANDOM walk for 40000 steps (870 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (181 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502739 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502739 steps, saw 145906 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2026-05-24 15:04:24] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
[2026-05-24 15:04:24] [INFO ] Invariant cache hit.
[2026-05-24 15:04:24] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:25] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:25] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:25] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:26] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 31 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/935 variables, 14/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/935 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1891ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 202 transition count 741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 201 transition count 741
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 200 transition count 740
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 200 transition count 740
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 197 transition count 737
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 194 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 194 transition count 731
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 193 transition count 736
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 192 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 192 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 191 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 191 transition count 720
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 190 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 190 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 189 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 189 transition count 711
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 188 transition count 704
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 188 transition count 704
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 187 transition count 702
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 187 transition count 702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 695
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 678
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 181 transition count 678
Applied a total of 44 rules in 165 ms. Remains 181 /203 variables (removed 22) and now considering 678/742 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 181/203 places, 678/742 transitions.
RANDOM walk for 40000 steps (867 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (178 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 677507 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 677507 steps, saw 152055 distinct states, run finished after 3001 ms. (steps per millisecond=225 ) properties seen :0
[2026-05-24 15:04:29] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
// Phase 1: matrix 668 rows 181 cols
[2026-05-24 15:04:29] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:04:29] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 668/837 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 93/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/849 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/849 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:30] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:30] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 668/837 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/849 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1077ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 678/678 transitions.
Applied a total of 0 rules in 17 ms. Remains 181 /181 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 181/181 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 678/678 transitions.
Applied a total of 0 rules in 17 ms. Remains 181 /181 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2026-05-24 15:04:30] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:04:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:04:31] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-24 15:04:31] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:04:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:04:31] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 15:04:31] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:04:31] [INFO ] Redundant transitions in 10 ms returned []
Running 670 sub problems to find dead transitions.
[2026-05-24 15:04:31] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:04:31] [INFO ] Invariant cache hit.
[2026-05-24 15:04:31] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:43] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:43] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:43] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:44] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:44] [INFO ] Deduced a trap composed of 98 places in 290 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:44] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:46] [INFO ] Deduced a trap composed of 51 places in 188 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:47] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:47] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:48] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:04:48] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
SMT process timed out in 30535ms, After SMT, problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 30538ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31643 ms. Remains : 181/181 places, 678/678 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 181 vertex of which 29 / 181 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 153 transition count 506
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 153 transition count 506
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 153 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 152 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 152 transition count 459
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 152 transition count 453
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 146 transition count 451
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 146 transition count 449
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 144 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 144 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 441
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 143 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 142 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 142 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 141 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 140 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 140 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 115 place count 140 transition count 373
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 140 transition count 370
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 137 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 137 transition count 364
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 137 transition count 361
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 134 transition count 361
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 138 place count 134 transition count 361
Applied a total of 138 rules in 108 ms. Remains 134 /181 variables (removed 47) and now considering 361/678 (removed 317) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:05:02] [INFO ] Flow matrix only has 357 transitions (discarded 4 similar events)
// Phase 1: matrix 357 rows 134 cols
[2026-05-24 15:05:02] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:05:02] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:05:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 15:05:02] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:05:02] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:05:02] [INFO ] After 26ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:02] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 7 ms to minimize.
[2026-05-24 15:05:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
TRAPS : Iteration 1
[2026-05-24 15:05:02] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:05:02] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 534 ms.
RANDOM walk for 40000 steps (863 resets) in 291 ms. (136 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (179 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 552908 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 552908 steps, saw 160044 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2026-05-24 15:05:06] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:05:06] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:05:06] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:06] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:06] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1041ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 197 transition count 737
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 195 transition count 732
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 195 transition count 732
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 193 transition count 742
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 192 transition count 728
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 192 transition count 728
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 191 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 191 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 190 transition count 719
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 190 transition count 719
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 189 transition count 717
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 189 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 188 transition count 710
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 188 transition count 710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 187 transition count 708
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 187 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 699
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 684
Applied a total of 43 rules in 57 ms. Remains 181 /203 variables (removed 22) and now considering 684/742 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 181/203 places, 684/742 transitions.
RANDOM walk for 40000 steps (895 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 717580 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 1
Probabilistic random walk after 717580 steps, saw 163558 distinct states, run finished after 3005 ms. (steps per millisecond=238 ) properties seen :0
[2026-05-24 15:05:10] [INFO ] Flow matrix only has 674 transitions (discarded 10 similar events)
// Phase 1: matrix 674 rows 181 cols
[2026-05-24 15:05:10] [INFO ] Computed 10 invariants in 4 ms
[2026-05-24 15:05:10] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 674/843 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 94/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/855 variables, 12/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/855 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:10] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 674/843 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 94/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/855 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/855 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/855 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1005ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 684/684 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 181/181 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 684/684 transitions.
Applied a total of 0 rules in 8 ms. Remains 181 /181 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2026-05-24 15:05:11] [INFO ] Flow matrix only has 674 transitions (discarded 10 similar events)
[2026-05-24 15:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:05:11] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-24 15:05:11] [INFO ] Flow matrix only has 674 transitions (discarded 10 similar events)
[2026-05-24 15:05:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:05:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-24 15:05:12] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:05:12] [INFO ] Redundant transitions in 10 ms returned []
Running 676 sub problems to find dead transitions.
[2026-05-24 15:05:12] [INFO ] Flow matrix only has 674 transitions (discarded 10 similar events)
[2026-05-24 15:05:12] [INFO ] Invariant cache hit.
[2026-05-24 15:05:12] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Invariant property smplace_322 does not hold.
Invariant property smplace_321 does not hold.
Invariant property smplace_320 does not hold.
Invariant property smplace_319 does not hold.
Invariant property smplace_318 does not hold.
Invariant property smplace_317 does not hold.
Invariant property smplace_316 does not hold.
Invariant property smplace_315 does not hold.
Invariant property smplace_314 does not hold.
Invariant property smplace_313 does not hold.
Invariant property smplace_312 does not hold.
SDD proceeding with computation,19 properties remain. new max is 2048
SDD size :6.31398e+09 after 9.25845e+11
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:21] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:21] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:21] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:21] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:22] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:22] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:22] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:22] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:23] [INFO ] Deduced a trap composed of 51 places in 183 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:24] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:25] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:25] [INFO ] Deduced a trap composed of 98 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:05:26] [INFO ] Deduced a trap composed of 98 places in 191 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 674/855 variables, 181/204 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/855 variables, 94/298 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 855/855 variables, and 298 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 676 unsolved
SDD proceeding with computation,19 properties remain. new max is 4096
SDD size :9.25845e+11 after 9.25845e+11
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 674/855 variables, 181/204 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/855 variables, 94/298 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 676/974 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 855/855 variables, and 974 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 60537ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61571 ms. Remains : 181/181 places, 684/684 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 181 vertex of which 29 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 153 transition count 512
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 153 transition count 512
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 153 transition count 498
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 152 transition count 497
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 152 transition count 465
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 152 transition count 459
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 146 transition count 457
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 146 transition count 455
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 144 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 144 transition count 448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 143 transition count 447
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 142 transition count 446
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 142 transition count 445
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 141 transition count 444
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 140 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 140 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 116 place count 140 transition count 377
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 140 transition count 374
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 137 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 128 place count 137 transition count 368
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 137 transition count 365
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 134 transition count 365
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 141 place count 134 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 134 transition count 364
Applied a total of 142 rules in 77 ms. Remains 134 /181 variables (removed 47) and now considering 364/684 (removed 320) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:06:12] [INFO ] Flow matrix only has 360 transitions (discarded 4 similar events)
// Phase 1: matrix 360 rows 134 cols
[2026-05-24 15:06:13] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:06:13] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:06:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 15:06:13] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:06:13] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:06:13] [INFO ] After 27ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:06:13] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:06:13] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 384 ms.
RANDOM walk for 40000 steps (873 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (162 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 544244 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 544244 steps, saw 157334 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2026-05-24 15:06:16] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:06:16] [INFO ] Computed 10 invariants in 4 ms
[2026-05-24 15:06:16] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:17] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:17] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:17] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1314ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 194 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 194 transition count 731
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 193 transition count 736
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 192 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 192 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 191 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 191 transition count 720
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 190 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 190 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 189 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 189 transition count 711
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 188 transition count 704
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 188 transition count 704
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 187 transition count 702
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 187 transition count 702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 695
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 678
Applied a total of 43 rules in 62 ms. Remains 181 /203 variables (removed 22) and now considering 678/742 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 181/203 places, 678/742 transitions.
RANDOM walk for 40000 steps (864 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (180 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 669492 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :0 out of 1
Probabilistic random walk after 669492 steps, saw 150538 distinct states, run finished after 3001 ms. (steps per millisecond=223 ) properties seen :0
[2026-05-24 15:06:20] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
// Phase 1: matrix 668 rows 181 cols
[2026-05-24 15:06:20] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:06:20] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 668/837 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 93/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/849 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/849 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:21] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:21] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 668/837 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/849 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1269ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 678/678 transitions.
Applied a total of 0 rules in 14 ms. Remains 181 /181 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 181/181 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 678/678 transitions.
Applied a total of 0 rules in 14 ms. Remains 181 /181 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2026-05-24 15:06:22] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:06:22] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-24 15:06:22] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:06:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:06:22] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 15:06:23] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:06:23] [INFO ] Redundant transitions in 16 ms returned []
Running 670 sub problems to find dead transitions.
[2026-05-24 15:06:23] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:06:23] [INFO ] Invariant cache hit.
[2026-05-24 15:06:23] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:33] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:33] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:33] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:33] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:34] [INFO ] Deduced a trap composed of 98 places in 196 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:34] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:35] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:36] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:36] [INFO ] Deduced a trap composed of 36 places in 211 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:06:39] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 43 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (OVERLAPS) 668/849 variables, 181/201 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 93/294 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 849/849 variables, and 294 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 668/849 variables, 181/201 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 93/294 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 670/964 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/849 variables, and 964 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60839ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60849ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62439 ms. Remains : 181/181 places, 678/678 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 181 vertex of which 29 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 153 transition count 506
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 153 transition count 506
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 153 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 152 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 152 transition count 459
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 152 transition count 453
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 146 transition count 451
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 146 transition count 449
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 144 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 144 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 441
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 143 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 142 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 142 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 141 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 140 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 140 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 115 place count 140 transition count 373
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 140 transition count 370
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 137 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 137 transition count 364
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 137 transition count 361
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 134 transition count 361
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 139 place count 134 transition count 361
Applied a total of 139 rules in 79 ms. Remains 134 /181 variables (removed 47) and now considering 361/678 (removed 317) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:07:24] [INFO ] Flow matrix only has 357 transitions (discarded 4 similar events)
// Phase 1: matrix 357 rows 134 cols
[2026-05-24 15:07:24] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:07:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:07:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 15:07:24] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:07:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:07:24] [INFO ] After 41ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:25] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 12 ms to minimize.
[2026-05-24 15:07:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
TRAPS : Iteration 1
[2026-05-24 15:07:25] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:07:25] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 553 ms.
RANDOM walk for 40000 steps (878 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (187 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 542026 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 1
Probabilistic random walk after 542026 steps, saw 156722 distinct states, run finished after 3008 ms. (steps per millisecond=180 ) properties seen :0
[2026-05-24 15:07:28] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:07:28] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:07:28] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:28] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:28] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:28] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1212ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 202 transition count 741
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 201 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 192 transition count 735
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 191 transition count 721
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 191 transition count 721
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 190 transition count 719
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 190 transition count 719
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 189 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 189 transition count 712
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 188 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 188 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 187 transition count 703
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 187 transition count 703
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 186 transition count 701
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 186 transition count 701
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 185 transition count 694
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 185 transition count 694
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 184 transition count 692
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 184 transition count 692
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 183 transition count 685
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 183 transition count 685
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 182 transition count 683
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 182 transition count 683
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 181 transition count 679
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 181 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 180 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 180 transition count 677
Applied a total of 45 rules in 62 ms. Remains 180 /203 variables (removed 23) and now considering 677/742 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 180/203 places, 677/742 transitions.
RANDOM walk for 40000 steps (873 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (174 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 721591 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 1
Probabilistic random walk after 721591 steps, saw 164248 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2026-05-24 15:07:32] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
// Phase 1: matrix 667 rows 180 cols
[2026-05-24 15:07:32] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:07:32] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 667/835 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 93/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/847 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/847 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:33] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:33] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:33] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 667/835 variables, 168/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/835 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/847 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/847 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/847 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 847/847 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1152ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 677/677 transitions.
Applied a total of 0 rules in 8 ms. Remains 180 /180 variables (removed 0) and now considering 677/677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 180/180 places, 677/677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 677/677 transitions.
Applied a total of 0 rules in 8 ms. Remains 180 /180 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2026-05-24 15:07:33] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 15:07:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:07:34] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-24 15:07:34] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 15:07:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:07:34] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 15:07:34] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:07:34] [INFO ] Redundant transitions in 9 ms returned []
Running 669 sub problems to find dead transitions.
[2026-05-24 15:07:34] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 15:07:34] [INFO ] Invariant cache hit.
[2026-05-24 15:07:34] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:43] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:44] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:44] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:44] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:44] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:44] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:45] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:45] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:45] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:45] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:46] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:47] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:07:48] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (OVERLAPS) 667/847 variables, 180/203 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/847 variables, and 296 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (OVERLAPS) 667/847 variables, 180/203 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 669/965 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/847 variables, and 965 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60569ms problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61510 ms. Remains : 180/180 places, 677/677 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 180 vertex of which 29 / 180 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 152 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 152 transition count 505
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 152 transition count 491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 151 transition count 490
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 151 transition count 458
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 151 transition count 452
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 145 transition count 450
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 145 transition count 448
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 143 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 81 place count 143 transition count 440
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 143 transition count 439
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 142 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 141 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 141 transition count 437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 140 transition count 436
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 139 transition count 397
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 139 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 116 place count 139 transition count 371
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 139 transition count 368
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 136 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 128 place count 136 transition count 362
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 136 transition count 359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 133 transition count 359
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 140 place count 133 transition count 359
Applied a total of 140 rules in 73 ms. Remains 133 /180 variables (removed 47) and now considering 359/677 (removed 318) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:08:35] [INFO ] Flow matrix only has 355 transitions (discarded 4 similar events)
// Phase 1: matrix 355 rows 133 cols
[2026-05-24 15:08:35] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:08:35] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:08:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 15:08:35] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:08:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:08:35] [INFO ] After 32ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:08:35] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:08:35] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 365 ms.
RANDOM walk for 40000 steps (882 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (188 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 564587 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :0 out of 1
Probabilistic random walk after 564587 steps, saw 163538 distinct states, run finished after 3004 ms. (steps per millisecond=187 ) properties seen :0
[2026-05-24 15:08:38] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:08:38] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:08:38] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:39] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:39] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:39] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1068ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 191 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 190 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 190 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 189 transition count 724
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 189 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 188 transition count 717
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 188 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 187 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 187 transition count 715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 708
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 706
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 706
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 699
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 697
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 697
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 688
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 688
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 180 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 180 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 179 transition count 682
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 179 transition count 682
Applied a total of 47 rules in 56 ms. Remains 179 /203 variables (removed 24) and now considering 682/742 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 179/203 places, 682/742 transitions.
RANDOM walk for 40000 steps (873 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (169 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 728665 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 728665 steps, saw 165569 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2026-05-24 15:08:43] [INFO ] Flow matrix only has 672 transitions (discarded 10 similar events)
// Phase 1: matrix 672 rows 179 cols
[2026-05-24 15:08:43] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:08:43] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 672/839 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/839 variables, 94/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/839 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/851 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/851 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/851 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 52/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/167 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:43] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:43] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:43] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:43] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 672/839 variables, 167/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/839 variables, 94/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/839 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/839 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/851 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/851 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/851 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 973 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1296ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 682/682 transitions.
Applied a total of 0 rules in 8 ms. Remains 179 /179 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 179/179 places, 682/682 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 682/682 transitions.
Applied a total of 0 rules in 8 ms. Remains 179 /179 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2026-05-24 15:08:44] [INFO ] Flow matrix only has 672 transitions (discarded 10 similar events)
[2026-05-24 15:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:08:44] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-24 15:08:44] [INFO ] Flow matrix only has 672 transitions (discarded 10 similar events)
[2026-05-24 15:08:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:08:44] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-24 15:08:45] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:08:45] [INFO ] Redundant transitions in 9 ms returned []
Running 674 sub problems to find dead transitions.
[2026-05-24 15:08:45] [INFO ] Flow matrix only has 672 transitions (discarded 10 similar events)
[2026-05-24 15:08:45] [INFO ] Invariant cache hit.
[2026-05-24 15:08:45] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:54] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:55] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:55] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:55] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:56] [INFO ] Deduced a trap composed of 96 places in 306 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:56] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:58] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:08:59] [INFO ] Deduced a trap composed of 41 places in 329 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:09:00] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:09:01] [INFO ] Deduced a trap composed of 96 places in 265 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:09:02] [INFO ] Deduced a trap composed of 96 places in 223 ms of which 21 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:09:04] [INFO ] Deduced a trap composed of 59 places in 198 ms of which 22 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/851 variables, and 22 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/179 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 674 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 4 (OVERLAPS) 672/851 variables, 179/201 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/851 variables, 94/295 constraints. Problems are: Problem set: 0 solved, 674 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/851 variables, 674/969 constraints. Problems are: Problem set: 0 solved, 674 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/851 variables, and 969 constraints, problems are : Problem set: 0 solved, 674 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 179/179 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 674/674 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60571ms problems are : Problem set: 0 solved, 674 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61505 ms. Remains : 179/179 places, 682/682 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 179 vertex of which 29 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 151 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 151 transition count 510
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 151 transition count 496
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 150 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 56 place count 150 transition count 462
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 150 transition count 456
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 70 place count 144 transition count 454
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 70 place count 144 transition count 452
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 142 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 87 place count 142 transition count 439
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 142 transition count 438
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 141 transition count 438
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 140 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 140 transition count 436
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 139 transition count 435
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 138 transition count 396
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 138 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 122 place count 138 transition count 370
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 138 transition count 367
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 135 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 135 transition count 361
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 135 transition count 358
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 140 place count 132 transition count 358
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 146 place count 132 transition count 358
Applied a total of 146 rules in 74 ms. Remains 132 /179 variables (removed 47) and now considering 358/682 (removed 324) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:09:45] [INFO ] Flow matrix only has 354 transitions (discarded 4 similar events)
// Phase 1: matrix 354 rows 132 cols
[2026-05-24 15:09:45] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:09:45] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:09:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 15:09:46] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:09:46] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:09:46] [INFO ] After 28ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:09:46] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:09:46] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 340 ms.
RANDOM walk for 40000 steps (886 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (167 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 539040 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 539040 steps, saw 155692 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2026-05-24 15:09:49] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:09:49] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:09:49] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:09:49] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:09:49] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:09:49] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 788 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1125ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 191 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 189 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 189 transition count 712
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 188 transition count 710
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 188 transition count 710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 187 transition count 703
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 187 transition count 703
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 694
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 685
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 685
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 676
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 180 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 180 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 179 transition count 670
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 179 transition count 670
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 178 transition count 668
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 178 transition count 668
Applied a total of 49 rules in 60 ms. Remains 178 /203 variables (removed 25) and now considering 668/742 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 178/203 places, 668/742 transitions.
RANDOM walk for 40000 steps (871 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (177 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 735661 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :0 out of 1
Probabilistic random walk after 735661 steps, saw 166892 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
[2026-05-24 15:09:53] [INFO ] Flow matrix only has 658 transitions (discarded 10 similar events)
// Phase 1: matrix 658 rows 178 cols
[2026-05-24 15:09:53] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:09:53] [INFO ] State equation strengthened by 92 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 658/824 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 92/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/836 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/836 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/836 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 836/836 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/166 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:09:54] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 658/824 variables, 166/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 92/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/836 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/836 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/836 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 836/836 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 966ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 668/668 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 668/668 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 178/178 places, 668/668 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 668/668 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 668/668 (removed 0) transitions.
[2026-05-24 15:09:54] [INFO ] Flow matrix only has 658 transitions (discarded 10 similar events)
[2026-05-24 15:09:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:09:54] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-24 15:09:54] [INFO ] Flow matrix only has 658 transitions (discarded 10 similar events)
[2026-05-24 15:09:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:09:55] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 15:09:55] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:09:55] [INFO ] Redundant transitions in 10 ms returned []
Running 660 sub problems to find dead transitions.
[2026-05-24 15:09:55] [INFO ] Flow matrix only has 658 transitions (discarded 10 similar events)
[2026-05-24 15:09:55] [INFO ] Invariant cache hit.
[2026-05-24 15:09:55] [INFO ] State equation strengthened by 92 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:04] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:04] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:04] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:04] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:04] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:04] [INFO ] Deduced a trap composed of 96 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:05] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:05] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:05] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:05] [INFO ] Deduced a trap composed of 96 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:05] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:07] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:07] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:08] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (OVERLAPS) 658/836 variables, 178/202 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 92/294 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 836/836 variables, and 294 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 4 (OVERLAPS) 658/836 variables, 178/202 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 92/294 constraints. Problems are: Problem set: 0 solved, 660 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 660/954 constraints. Problems are: Problem set: 0 solved, 660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 836/836 variables, and 954 constraints, problems are : Problem set: 0 solved, 660 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 178/178 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 660/660 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60530ms problems are : Problem set: 0 solved, 660 unsolved
Search for dead transitions found 0 dead transitions in 60532ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61404 ms. Remains : 178/178 places, 668/668 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 178 vertex of which 29 / 178 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 150 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 150 transition count 496
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 150 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 149 transition count 481
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 149 transition count 449
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 149 transition count 443
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 143 transition count 441
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 143 transition count 439
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 141 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 141 transition count 432
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 141 transition count 431
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 140 transition count 431
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 139 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 139 transition count 429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 138 transition count 428
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 137 transition count 390
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 137 transition count 390
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 114 place count 137 transition count 365
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 137 transition count 362
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 134 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 134 transition count 356
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 134 transition count 353
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 132 place count 131 transition count 353
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 138 place count 131 transition count 353
Applied a total of 138 rules in 84 ms. Remains 131 /178 variables (removed 47) and now considering 353/668 (removed 315) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:10:56] [INFO ] Flow matrix only has 349 transitions (discarded 4 similar events)
// Phase 1: matrix 349 rows 131 cols
[2026-05-24 15:10:56] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:10:56] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:10:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 15:10:56] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:10:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:10:56] [INFO ] After 40ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:10:56] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 3 ms to minimize.
[2026-05-24 15:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
TRAPS : Iteration 1
[2026-05-24 15:10:56] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:10:56] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 526 ms.
RANDOM walk for 40000 steps (852 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (170 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 567910 steps, run timeout after 3025 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 567910 steps, saw 164262 distinct states, run finished after 3029 ms. (steps per millisecond=187 ) properties seen :0
[2026-05-24 15:10:59] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:10:59] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:10:59] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:00] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:00] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:00] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1161ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 191 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 189 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 189 transition count 712
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 187 transition count 708
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 187 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 699
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 180 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 180 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 179 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 179 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 178 transition count 668
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 178 transition count 668
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 177 transition count 666
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 177 transition count 666
Applied a total of 51 rules in 62 ms. Remains 177 /203 variables (removed 26) and now considering 666/742 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 177/203 places, 666/742 transitions.
RANDOM walk for 40000 steps (830 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (194 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732115 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :0 out of 1
Probabilistic random walk after 732115 steps, saw 166133 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
[2026-05-24 15:11:03] [INFO ] Flow matrix only has 656 transitions (discarded 10 similar events)
// Phase 1: matrix 656 rows 177 cols
[2026-05-24 15:11:03] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:11:03] [INFO ] State equation strengthened by 92 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 656/821 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 92/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/833 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/833 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/833 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 833/833 variables, and 279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 50/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/165 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:04] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:04] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 656/821 variables, 165/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/821 variables, 92/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/821 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/821 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/833 variables, 12/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/833 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/833 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 833/833 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 666/666 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 666/666 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 177/177 places, 666/666 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 666/666 transitions.
Applied a total of 0 rules in 7 ms. Remains 177 /177 variables (removed 0) and now considering 666/666 (removed 0) transitions.
[2026-05-24 15:11:05] [INFO ] Flow matrix only has 656 transitions (discarded 10 similar events)
[2026-05-24 15:11:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:11:05] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-24 15:11:05] [INFO ] Flow matrix only has 656 transitions (discarded 10 similar events)
[2026-05-24 15:11:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:11:05] [INFO ] State equation strengthened by 92 read => feed constraints.
[2026-05-24 15:11:06] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:11:06] [INFO ] Redundant transitions in 10 ms returned []
Running 658 sub problems to find dead transitions.
[2026-05-24 15:11:06] [INFO ] Flow matrix only has 656 transitions (discarded 10 similar events)
[2026-05-24 15:11:06] [INFO ] Invariant cache hit.
[2026-05-24 15:11:06] [INFO ] State equation strengthened by 92 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:19] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:19] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:20] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:20] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:20] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:20] [INFO ] Deduced a trap composed of 95 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:21] [INFO ] Deduced a trap composed of 95 places in 297 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:21] [INFO ] Deduced a trap composed of 95 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:21] [INFO ] Deduced a trap composed of 95 places in 197 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:21] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:23] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:25] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:11:26] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 26 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 177/833 variables, and 23 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/177 constraints, ReadFeed: 0/92 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 658 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 1 (OVERLAPS) 1/177 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 658 unsolved
SDD proceeding with computation,19 properties remain. new max is 8192
SDD size :3.92131e+13 after 3.92131e+13
At refinement iteration 4 (OVERLAPS) 656/833 variables, 177/200 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 92/292 constraints. Problems are: Problem set: 0 solved, 658 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 658/950 constraints. Problems are: Problem set: 0 solved, 658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/833 variables, and 950 constraints, problems are : Problem set: 0 solved, 658 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 177/177 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 658/658 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60583ms problems are : Problem set: 0 solved, 658 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61613 ms. Remains : 177/177 places, 666/666 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 177 vertex of which 29 / 177 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 149 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 149 transition count 494
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 149 transition count 480
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 148 transition count 479
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 148 transition count 447
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 148 transition count 441
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 142 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 142 transition count 437
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 140 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 140 transition count 430
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 140 transition count 429
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 139 transition count 429
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 138 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 138 transition count 427
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 137 transition count 426
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 136 transition count 388
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 136 transition count 388
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 114 place count 136 transition count 363
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 117 place count 136 transition count 360
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 133 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 133 transition count 354
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 133 transition count 351
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 132 place count 130 transition count 351
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 138 place count 130 transition count 351
Applied a total of 138 rules in 69 ms. Remains 130 /177 variables (removed 47) and now considering 351/666 (removed 315) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:12:06] [INFO ] Flow matrix only has 347 transitions (discarded 4 similar events)
// Phase 1: matrix 347 rows 130 cols
[2026-05-24 15:12:06] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:12:07] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:12:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 15:12:07] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:12:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:12:07] [INFO ] After 35ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:12:07] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:12:07] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 553 ms.
RANDOM walk for 40000 steps (863 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (177 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 531125 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 531125 steps, saw 153732 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2026-05-24 15:12:10] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:12:10] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:12:10] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 316 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:10] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:11] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:11] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1127ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 191 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 189 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 189 transition count 712
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 187 transition count 708
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 187 transition count 708
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 185 transition count 694
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 185 transition count 694
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 685
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 685
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 676
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 180 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 180 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 179 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 179 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 178 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 178 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 177 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 177 transition count 661
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 176 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 176 transition count 659
Applied a total of 53 rules in 69 ms. Remains 176 /203 variables (removed 27) and now considering 659/742 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 176/203 places, 659/742 transitions.
RANDOM walk for 40000 steps (868 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (180 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 764155 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 764155 steps, saw 172729 distinct states, run finished after 3004 ms. (steps per millisecond=254 ) properties seen :0
[2026-05-24 15:12:14] [INFO ] Flow matrix only has 649 transitions (discarded 10 similar events)
// Phase 1: matrix 649 rows 176 cols
[2026-05-24 15:12:14] [INFO ] Computed 10 invariants in 8 ms
[2026-05-24 15:12:14] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 649/813 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/813 variables, 91/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/825 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/825 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/825 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/164 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:15] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:15] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 649/813 variables, 164/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/813 variables, 91/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/813 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/813 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/825 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/825 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/825 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 825/825 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 176/176 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 919ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 659/659 transitions.
Applied a total of 0 rules in 7 ms. Remains 176 /176 variables (removed 0) and now considering 659/659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 176/176 places, 659/659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 659/659 transitions.
Applied a total of 0 rules in 8 ms. Remains 176 /176 variables (removed 0) and now considering 659/659 (removed 0) transitions.
[2026-05-24 15:12:15] [INFO ] Flow matrix only has 649 transitions (discarded 10 similar events)
[2026-05-24 15:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:12:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2026-05-24 15:12:15] [INFO ] Flow matrix only has 649 transitions (discarded 10 similar events)
[2026-05-24 15:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:12:16] [INFO ] State equation strengthened by 91 read => feed constraints.
[2026-05-24 15:12:16] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:12:16] [INFO ] Redundant transitions in 9 ms returned []
Running 651 sub problems to find dead transitions.
[2026-05-24 15:12:16] [INFO ] Flow matrix only has 649 transitions (discarded 10 similar events)
[2026-05-24 15:12:16] [INFO ] Invariant cache hit.
[2026-05-24 15:12:16] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:26] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:26] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:26] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:27] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:27] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:28] [INFO ] Deduced a trap composed of 95 places in 311 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:28] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:28] [INFO ] Deduced a trap composed of 95 places in 318 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:28] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:30] [INFO ] Deduced a trap composed of 49 places in 309 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:31] [INFO ] Deduced a trap composed of 40 places in 311 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:32] [INFO ] Deduced a trap composed of 36 places in 213 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
SMT process timed out in 30526ms, After SMT, problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 30529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31380 ms. Remains : 176/176 places, 659/659 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 176 vertex of which 29 / 176 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 148 transition count 487
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 148 transition count 487
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 148 transition count 473
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 147 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 147 transition count 440
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 147 transition count 434
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 141 transition count 432
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 141 transition count 430
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 139 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 139 transition count 423
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 139 transition count 422
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 138 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 137 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 137 transition count 420
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 136 transition count 419
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 135 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 135 transition count 382
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 113 place count 135 transition count 358
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 135 transition count 355
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 119 place count 132 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 132 transition count 349
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 132 transition count 346
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 129 transition count 346
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 129 transition count 346
Applied a total of 137 rules in 61 ms. Remains 129 /176 variables (removed 47) and now considering 346/659 (removed 313) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:12:47] [INFO ] Flow matrix only has 342 transitions (discarded 4 similar events)
// Phase 1: matrix 342 rows 129 cols
[2026-05-24 15:12:47] [INFO ] Computed 10 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:12:47] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:12:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 15:12:47] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:12:47] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:12:47] [INFO ] After 38ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:12:47] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:12:47] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 432 ms.
RANDOM walk for 40000 steps (853 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (171 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 538888 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 538888 steps, saw 155647 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2026-05-24 15:12:50] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:12:50] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:12:50] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:51] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:51] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:51] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1550ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 191 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 189 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 189 transition count 712
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 187 transition count 708
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 187 transition count 708
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 185 transition count 694
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 185 transition count 694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 183 transition count 690
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 183 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 683
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 681
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 180 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 180 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 179 transition count 672
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 179 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 178 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 178 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 177 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 177 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 176 transition count 659
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 176 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 175 transition count 657
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 175 transition count 657
Applied a total of 55 rules in 86 ms. Remains 175 /203 variables (removed 28) and now considering 657/742 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 175/203 places, 657/742 transitions.
RANDOM walk for 40000 steps (863 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (190 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 667742 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 667742 steps, saw 150059 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
[2026-05-24 15:12:55] [INFO ] Flow matrix only has 647 transitions (discarded 10 similar events)
// Phase 1: matrix 647 rows 175 cols
[2026-05-24 15:12:55] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:12:55] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 647/810 variables, 163/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 91/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/822 variables, 12/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/822 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 382 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/163 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:56] [INFO ] Deduced a trap composed of 16 places in 290 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:56] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:12:56] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 647/810 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 91/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/822 variables, 12/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/822 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/822 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 657/657 transitions.
Applied a total of 0 rules in 7 ms. Remains 175 /175 variables (removed 0) and now considering 657/657 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 175/175 places, 657/657 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 657/657 transitions.
Applied a total of 0 rules in 8 ms. Remains 175 /175 variables (removed 0) and now considering 657/657 (removed 0) transitions.
[2026-05-24 15:12:56] [INFO ] Flow matrix only has 647 transitions (discarded 10 similar events)
[2026-05-24 15:12:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:12:57] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-24 15:12:57] [INFO ] Flow matrix only has 647 transitions (discarded 10 similar events)
[2026-05-24 15:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:12:57] [INFO ] State equation strengthened by 91 read => feed constraints.
[2026-05-24 15:12:58] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:12:58] [INFO ] Redundant transitions in 14 ms returned []
Running 649 sub problems to find dead transitions.
[2026-05-24 15:12:58] [INFO ] Flow matrix only has 647 transitions (discarded 10 similar events)
[2026-05-24 15:12:58] [INFO ] Invariant cache hit.
[2026-05-24 15:12:58] [INFO ] State equation strengthened by 91 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:12] [INFO ] Deduced a trap composed of 57 places in 341 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:12] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:12] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:12] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:13] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:13] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:13] [INFO ] Deduced a trap composed of 94 places in 270 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:14] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:15] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:17] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:17] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:13:18] [INFO ] Deduced a trap composed of 94 places in 290 ms of which 42 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/822 variables, and 22 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/175 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 649 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 4 (OVERLAPS) 647/822 variables, 175/197 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 91/288 constraints. Problems are: Problem set: 0 solved, 649 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 649/937 constraints. Problems are: Problem set: 0 solved, 649 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/822 variables, and 937 constraints, problems are : Problem set: 0 solved, 649 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 175/175 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 649/649 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60800ms problems are : Problem set: 0 solved, 649 unsolved
Search for dead transitions found 0 dead transitions in 60802ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62099 ms. Remains : 175/175 places, 657/657 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 175 vertex of which 29 / 175 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 147 transition count 485
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 147 transition count 485
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 147 transition count 471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 146 transition count 470
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 146 transition count 438
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 146 transition count 432
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 140 transition count 430
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 140 transition count 428
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 138 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 138 transition count 421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 138 transition count 420
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 137 transition count 420
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 136 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 136 transition count 418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 135 transition count 417
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 134 transition count 380
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 134 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 113 place count 134 transition count 356
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 134 transition count 353
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 119 place count 131 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 125 place count 131 transition count 347
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 128 place count 131 transition count 344
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 128 transition count 344
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 128 transition count 344
Applied a total of 137 rules in 81 ms. Remains 128 /175 variables (removed 47) and now considering 344/657 (removed 313) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:13:58] [INFO ] Flow matrix only has 340 transitions (discarded 4 similar events)
// Phase 1: matrix 340 rows 128 cols
[2026-05-24 15:13:58] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:13:59] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:13:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 15:13:59] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:13:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:13:59] [INFO ] After 57ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:13:59] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:13:59] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 533 ms.
RANDOM walk for 40000 steps (859 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (179 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 486109 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 1
Probabilistic random walk after 486109 steps, saw 140978 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2026-05-24 15:14:02] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:14:02] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:14:02] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:03] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:03] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:03] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1641ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 191 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 189 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 189 transition count 712
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 187 transition count 708
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 187 transition count 708
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 185 transition count 694
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 185 transition count 694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 183 transition count 690
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 183 transition count 690
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 181 transition count 676
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 181 transition count 676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 180 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 180 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 179 transition count 667
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 179 transition count 667
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 178 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 178 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 177 transition count 658
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 177 transition count 658
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 176 transition count 656
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 176 transition count 656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 175 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 175 transition count 652
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 174 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 174 transition count 650
Applied a total of 57 rules in 78 ms. Remains 174 /203 variables (removed 29) and now considering 650/742 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 174/203 places, 650/742 transitions.
RANDOM walk for 40000 steps (866 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (169 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 609234 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :0 out of 1
Probabilistic random walk after 609234 steps, saw 137085 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
[2026-05-24 15:14:07] [INFO ] Flow matrix only has 640 transitions (discarded 10 similar events)
// Phase 1: matrix 640 rows 174 cols
[2026-05-24 15:14:07] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:14:07] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 640/802 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 90/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/814 variables, 12/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/814 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/814 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 47/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/162 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:07] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:08] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 640/802 variables, 162/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 90/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/802 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/802 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/814 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/814 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/814 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1443ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 650/650 transitions.
Applied a total of 0 rules in 12 ms. Remains 174 /174 variables (removed 0) and now considering 650/650 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 174/174 places, 650/650 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 650/650 transitions.
Applied a total of 0 rules in 12 ms. Remains 174 /174 variables (removed 0) and now considering 650/650 (removed 0) transitions.
[2026-05-24 15:14:08] [INFO ] Flow matrix only has 640 transitions (discarded 10 similar events)
[2026-05-24 15:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:14:09] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-24 15:14:09] [INFO ] Flow matrix only has 640 transitions (discarded 10 similar events)
[2026-05-24 15:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:14:09] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-24 15:14:10] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:14:10] [INFO ] Redundant transitions in 15 ms returned []
Running 642 sub problems to find dead transitions.
[2026-05-24 15:14:10] [INFO ] Flow matrix only has 640 transitions (discarded 10 similar events)
[2026-05-24 15:14:10] [INFO ] Invariant cache hit.
[2026-05-24 15:14:10] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:23] [INFO ] Deduced a trap composed of 57 places in 296 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:24] [INFO ] Deduced a trap composed of 25 places in 336 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:24] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:24] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:24] [INFO ] Deduced a trap composed of 17 places in 312 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:25] [INFO ] Deduced a trap composed of 94 places in 288 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:25] [INFO ] Deduced a trap composed of 94 places in 292 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:25] [INFO ] Deduced a trap composed of 94 places in 289 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:26] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:27] [INFO ] Deduced a trap composed of 48 places in 311 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:29] [INFO ] Deduced a trap composed of 39 places in 320 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:14:29] [INFO ] Deduced a trap composed of 36 places in 303 ms of which 37 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/814 variables, and 22 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/174 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (OVERLAPS) 640/814 variables, 174/196 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/814 variables, 90/286 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/814 variables, 642/928 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 814/814 variables, and 928 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60768ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62200 ms. Remains : 174/174 places, 650/650 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 174 vertex of which 29 / 174 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 146 transition count 478
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 146 transition count 478
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 146 transition count 464
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 145 transition count 463
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 145 transition count 431
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 145 transition count 425
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 139 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 139 transition count 421
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 137 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 137 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 137 transition count 413
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 136 transition count 413
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 135 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 135 transition count 411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 134 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 133 transition count 374
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 133 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 112 place count 133 transition count 351
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 133 transition count 348
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 130 transition count 348
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 130 transition count 342
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 130 transition count 339
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 130 place count 127 transition count 339
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 136 place count 127 transition count 339
Applied a total of 136 rules in 82 ms. Remains 127 /174 variables (removed 47) and now considering 339/650 (removed 311) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:15:11] [INFO ] Flow matrix only has 335 transitions (discarded 4 similar events)
// Phase 1: matrix 335 rows 127 cols
[2026-05-24 15:15:11] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:15:11] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:15:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 15:15:11] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:15:11] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:15:11] [INFO ] After 52ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:15:11] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:15:11] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 530 ms.
RANDOM walk for 40000 steps (867 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (181 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 515312 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 515312 steps, saw 149287 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2026-05-24 15:15:14] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:15:14] [INFO ] Computed 10 invariants in 9 ms
[2026-05-24 15:15:14] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 56/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 132/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:15] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:15] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:15] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1288 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1791ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 191 transition count 740
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 189 transition count 712
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 189 transition count 712
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 187 transition count 708
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 187 transition count 708
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 185 transition count 694
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 185 transition count 694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 183 transition count 690
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 183 transition count 690
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 181 transition count 676
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 181 transition count 676
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 179 transition count 672
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 179 transition count 672
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 178 transition count 665
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 178 transition count 665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 177 transition count 663
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 177 transition count 663
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 176 transition count 656
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 176 transition count 656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 175 transition count 654
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 175 transition count 654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 174 transition count 650
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 174 transition count 650
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 173 transition count 648
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 173 transition count 648
Applied a total of 59 rules in 76 ms. Remains 173 /203 variables (removed 30) and now considering 648/742 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 173/203 places, 648/742 transitions.
RANDOM walk for 40000 steps (866 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (186 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 602834 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 602834 steps, saw 135783 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2026-05-24 15:15:19] [INFO ] Flow matrix only has 638 transitions (discarded 10 similar events)
// Phase 1: matrix 638 rows 173 cols
[2026-05-24 15:15:19] [INFO ] Computed 10 invariants in 1 ms
[2026-05-24 15:15:19] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 638/799 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 90/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/799 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/811 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/811 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/811 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 811/811 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 46/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:20] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:20] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:20] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 638/799 variables, 161/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/799 variables, 90/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/799 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/799 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/811 variables, 12/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/811 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/811 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 277 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1415 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1714ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 648/648 transitions.
Applied a total of 0 rules in 12 ms. Remains 173 /173 variables (removed 0) and now considering 648/648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 173/173 places, 648/648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 648/648 transitions.
Applied a total of 0 rules in 11 ms. Remains 173 /173 variables (removed 0) and now considering 648/648 (removed 0) transitions.
[2026-05-24 15:15:21] [INFO ] Flow matrix only has 638 transitions (discarded 10 similar events)
[2026-05-24 15:15:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:15:21] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-24 15:15:21] [INFO ] Flow matrix only has 638 transitions (discarded 10 similar events)
[2026-05-24 15:15:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:15:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-24 15:15:22] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:15:22] [INFO ] Redundant transitions in 9 ms returned []
Running 640 sub problems to find dead transitions.
[2026-05-24 15:15:22] [INFO ] Flow matrix only has 638 transitions (discarded 10 similar events)
[2026-05-24 15:15:22] [INFO ] Invariant cache hit.
[2026-05-24 15:15:22] [INFO ] State equation strengthened by 90 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 640 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:35] [INFO ] Deduced a trap composed of 56 places in 220 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:35] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:35] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:35] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:36] [INFO ] Deduced a trap composed of 17 places in 270 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:36] [INFO ] Deduced a trap composed of 93 places in 265 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:36] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:38] [INFO ] Deduced a trap composed of 48 places in 308 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:39] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:40] [INFO ] Deduced a trap composed of 36 places in 296 ms of which 38 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 640 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 640 unsolved
SMT process timed out in 30650ms, After SMT, problems are : Problem set: 0 solved, 640 unsolved
Search for dead transitions found 0 dead transitions in 30651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31886 ms. Remains : 173/173 places, 648/648 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 173 vertex of which 29 / 173 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 145 transition count 476
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 145 transition count 476
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 145 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 144 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 144 transition count 429
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 144 transition count 423
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 138 transition count 421
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 138 transition count 419
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 136 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 136 transition count 412
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 136 transition count 411
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 135 transition count 411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 134 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 134 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 133 transition count 408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 132 transition count 372
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 132 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 112 place count 132 transition count 349
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 115 place count 132 transition count 346
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 129 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 129 transition count 340
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 127 place count 129 transition count 337
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 130 place count 126 transition count 337
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 136 place count 126 transition count 337
Applied a total of 136 rules in 69 ms. Remains 126 /173 variables (removed 47) and now considering 337/648 (removed 311) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:15:53] [INFO ] Flow matrix only has 333 transitions (discarded 4 similar events)
// Phase 1: matrix 333 rows 126 cols
[2026-05-24 15:15:53] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:15:53] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:15:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 15:15:53] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:15:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:15:53] [INFO ] After 53ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:15:53] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:15:53] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 496 ms.
RANDOM walk for 40000 steps (875 resets) in 243 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (179 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 548130 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 548130 steps, saw 158498 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2026-05-24 15:15:56] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:15:56] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:15:56] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 184/210 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 721/931 variables, 194/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/931 variables, 98/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/931 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/935 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 184/210 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:57] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:57] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 721/931 variables, 194/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/931 variables, 98/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:58] [INFO ] Deduced a trap composed of 16 places in 375 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:15:58] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 5 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/931 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/931 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/935 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/935 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/935 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1665 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2154ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 203 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 201 transition count 740
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 198 transition count 737
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 195 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 195 transition count 731
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 193 transition count 741
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 191 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 191 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 189 transition count 709
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 189 transition count 709
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 187 transition count 695
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 187 transition count 695
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 185 transition count 691
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 185 transition count 691
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 183 transition count 677
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 183 transition count 677
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 181 transition count 673
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 181 transition count 673
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 179 transition count 659
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 179 transition count 659
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 177 transition count 655
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 177 transition count 655
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 175 transition count 641
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 175 transition count 641
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 173 transition count 637
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 173 transition count 637
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 171 transition count 629
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 171 transition count 629
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 169 transition count 625
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 169 transition count 625
Applied a total of 68 rules in 79 ms. Remains 169 /203 variables (removed 34) and now considering 625/742 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 169/203 places, 625/742 transitions.
RANDOM walk for 40000 steps (856 resets) in 322 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (178 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 758012 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 758012 steps, saw 171146 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2026-05-24 15:16:02] [INFO ] Flow matrix only has 615 transitions (discarded 10 similar events)
// Phase 1: matrix 615 rows 169 cols
[2026-05-24 15:16:02] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:16:02] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/22 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/175 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/780 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 88/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/784 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/784 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/784 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/22 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/175 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:02] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:03] [INFO ] Deduced a trap composed of 54 places in 310 ms of which 35 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/780 variables, 160/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/780 variables, 88/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/780 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/784 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/784 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/784 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 784/784 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1467ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 625/625 transitions.
Applied a total of 0 rules in 12 ms. Remains 169 /169 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 169/169 places, 625/625 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 625/625 transitions.
Applied a total of 0 rules in 11 ms. Remains 169 /169 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2026-05-24 15:16:03] [INFO ] Flow matrix only has 615 transitions (discarded 10 similar events)
[2026-05-24 15:16:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:16:04] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-24 15:16:04] [INFO ] Flow matrix only has 615 transitions (discarded 10 similar events)
[2026-05-24 15:16:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:16:04] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 15:16:05] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:16:05] [INFO ] Redundant transitions in 14 ms returned []
Running 617 sub problems to find dead transitions.
[2026-05-24 15:16:05] [INFO ] Flow matrix only has 615 transitions (discarded 10 similar events)
[2026-05-24 15:16:05] [INFO ] Invariant cache hit.
[2026-05-24 15:16:05] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:17] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:18] [INFO ] Deduced a trap composed of 25 places in 314 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:18] [INFO ] Deduced a trap composed of 27 places in 299 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:18] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:18] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:19] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:19] [INFO ] Deduced a trap composed of 90 places in 268 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:21] [INFO ] Deduced a trap composed of 45 places in 296 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:23] [INFO ] Deduced a trap composed of 37 places in 311 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:23] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:23] [INFO ] Deduced a trap composed of 90 places in 266 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 617 unsolved
SMT process timed out in 30704ms, After SMT, problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 30707ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32019 ms. Remains : 169/169 places, 625/625 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 169 vertex of which 29 / 169 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 141 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 141 transition count 453
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 141 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 140 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 140 transition count 406
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 140 transition count 400
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 134 transition count 398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 134 transition count 396
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 132 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 132 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 132 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 131 transition count 388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 130 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 130 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 129 transition count 385
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 128 transition count 352
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 128 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 110 place count 128 transition count 331
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 128 transition count 328
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 125 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 125 transition count 322
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 125 transition count 319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 122 transition count 319
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 134 place count 122 transition count 319
Applied a total of 134 rules in 85 ms. Remains 122 /169 variables (removed 47) and now considering 319/625 (removed 306) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:16:35] [INFO ] Flow matrix only has 315 transitions (discarded 4 similar events)
// Phase 1: matrix 315 rows 122 cols
[2026-05-24 15:16:35] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:16:36] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:16:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 15:16:36] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:16:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-24 15:16:36] [INFO ] After 58ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:16:36] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:16:36] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 522 ms.
RANDOM walk for 40000 steps (851 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (174 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 493709 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 1
Probabilistic random walk after 493709 steps, saw 143588 distinct states, run finished after 3002 ms. (steps per millisecond=164 ) properties seen :0
[2026-05-24 15:16:39] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:16:39] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:16:39] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/27 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 184/211 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 720/931 variables, 193/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/931 variables, 98/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/931 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/935 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 184/211 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:40] [INFO ] Deduced a trap composed of 17 places in 314 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:40] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 720/931 variables, 193/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/931 variables, 98/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:41] [INFO ] Deduced a trap composed of 58 places in 345 ms of which 40 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/931 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/931 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/935 variables, 4/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2052ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 197 transition count 737
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 194 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 194 transition count 731
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 192 transition count 741
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 190 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 190 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 188 transition count 709
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 188 transition count 709
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 31 place count 186 transition count 695
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 186 transition count 695
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 184 transition count 691
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 184 transition count 691
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 182 transition count 677
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 182 transition count 677
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 180 transition count 673
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 180 transition count 673
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 178 transition count 659
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 178 transition count 659
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 176 transition count 655
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 176 transition count 655
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 174 transition count 641
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 174 transition count 641
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 172 transition count 637
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 172 transition count 637
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 170 transition count 629
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 170 transition count 629
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 168 transition count 625
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 168 transition count 625
Applied a total of 69 rules in 80 ms. Remains 168 /203 variables (removed 35) and now considering 625/742 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 168/203 places, 625/742 transitions.
RANDOM walk for 40000 steps (857 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (185 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 660815 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 660815 steps, saw 148148 distinct states, run finished after 3004 ms. (steps per millisecond=219 ) properties seen :0
[2026-05-24 15:16:44] [INFO ] Flow matrix only has 615 transitions (discarded 10 similar events)
// Phase 1: matrix 615 rows 168 cols
[2026-05-24 15:16:44] [INFO ] Computed 10 invariants in 1 ms
[2026-05-24 15:16:44] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/175 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 604/779 variables, 159/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/779 variables, 88/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/779 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/783 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/783 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/783 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 783/783 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/175 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:45] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:45] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 604/779 variables, 159/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/779 variables, 88/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/779 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/783 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/783 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/783 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 783/783 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1282ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 625/625 transitions.
Applied a total of 0 rules in 10 ms. Remains 168 /168 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 168/168 places, 625/625 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 625/625 transitions.
Applied a total of 0 rules in 10 ms. Remains 168 /168 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2026-05-24 15:16:46] [INFO ] Flow matrix only has 615 transitions (discarded 10 similar events)
[2026-05-24 15:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:16:46] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-24 15:16:46] [INFO ] Flow matrix only has 615 transitions (discarded 10 similar events)
[2026-05-24 15:16:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:16:46] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 15:16:47] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:16:47] [INFO ] Redundant transitions in 14 ms returned []
Running 617 sub problems to find dead transitions.
[2026-05-24 15:16:47] [INFO ] Flow matrix only has 615 transitions (discarded 10 similar events)
[2026-05-24 15:16:47] [INFO ] Invariant cache hit.
[2026-05-24 15:16:47] [INFO ] State equation strengthened by 88 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 617 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:16:59] [INFO ] Deduced a trap composed of 54 places in 313 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:00] [INFO ] Deduced a trap composed of 25 places in 311 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:00] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:00] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:00] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:01] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:01] [INFO ] Deduced a trap composed of 90 places in 276 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:03] [INFO ] Deduced a trap composed of 45 places in 299 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:04] [INFO ] Deduced a trap composed of 37 places in 328 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:05] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:05] [INFO ] Deduced a trap composed of 90 places in 273 ms of which 34 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 617 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 617 unsolved
SMT process timed out in 30654ms, After SMT, problems are : Problem set: 0 solved, 617 unsolved
Search for dead transitions found 0 dead transitions in 30656ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31892 ms. Remains : 168/168 places, 625/625 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 168 vertex of which 29 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 140 transition count 453
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 140 transition count 453
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 140 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 139 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 139 transition count 406
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 139 transition count 400
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 133 transition count 398
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 133 transition count 396
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 131 transition count 396
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 131 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 131 transition count 388
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 130 transition count 388
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 129 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 129 transition count 386
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 128 transition count 385
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 127 transition count 352
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 127 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 110 place count 127 transition count 331
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 127 transition count 328
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 124 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 124 transition count 322
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 124 transition count 319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 121 transition count 319
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 134 place count 121 transition count 319
Applied a total of 134 rules in 82 ms. Remains 121 /168 variables (removed 47) and now considering 319/625 (removed 306) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:17:18] [INFO ] Flow matrix only has 315 transitions (discarded 4 similar events)
// Phase 1: matrix 315 rows 121 cols
[2026-05-24 15:17:18] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:17:18] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:17:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 15:17:18] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:17:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-24 15:17:18] [INFO ] After 41ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:18] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:18] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 19 ms to minimize.
[2026-05-24 15:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
TRAPS : Iteration 1
[2026-05-24 15:17:18] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:17:18] [INFO ] After 749ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 907 ms.
RANDOM walk for 40000 steps (862 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (179 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 507314 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 507314 steps, saw 147093 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2026-05-24 15:17:21] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:17:21] [INFO ] Computed 10 invariants in 3 ms
[2026-05-24 15:17:21] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:22] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:22] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:23] [INFO ] Deduced a trap composed of 17 places in 243 ms of which 19 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1874ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 202 transition count 741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 201 transition count 741
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 200 transition count 740
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 200 transition count 740
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 197 transition count 737
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 194 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 194 transition count 731
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 193 transition count 736
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 192 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 192 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 191 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 191 transition count 720
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 190 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 190 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 189 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 189 transition count 711
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 188 transition count 704
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 188 transition count 704
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 187 transition count 702
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 187 transition count 702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 695
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 678
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 181 transition count 678
Applied a total of 44 rules in 98 ms. Remains 181 /203 variables (removed 22) and now considering 678/742 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 181/203 places, 678/742 transitions.
RANDOM walk for 40000 steps (868 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (170 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 489653 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 489653 steps, saw 142147 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2026-05-24 15:17:27] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
// Phase 1: matrix 668 rows 181 cols
[2026-05-24 15:17:27] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:17:27] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 668/837 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 93/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/849 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/849 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:27] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:27] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 668/837 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/849 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1174 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 678/678 transitions.
Applied a total of 0 rules in 12 ms. Remains 181 /181 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 181/181 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 678/678 transitions.
Applied a total of 0 rules in 11 ms. Remains 181 /181 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2026-05-24 15:17:28] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:17:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:17:28] [INFO ] Implicit Places using invariants in 282 ms returned []
[2026-05-24 15:17:28] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:17:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:17:29] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 15:17:30] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:17:30] [INFO ] Redundant transitions in 16 ms returned []
Running 670 sub problems to find dead transitions.
[2026-05-24 15:17:30] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:17:30] [INFO ] Invariant cache hit.
[2026-05-24 15:17:30] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:44] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:44] [INFO ] Deduced a trap composed of 61 places in 349 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:45] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:45] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:46] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:46] [INFO ] Deduced a trap composed of 98 places in 287 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:46] [INFO ] Deduced a trap composed of 98 places in 313 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:47] [INFO ] Deduced a trap composed of 98 places in 328 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:47] [INFO ] Deduced a trap composed of 42 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:49] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:50] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:17:50] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/849 variables, and 22 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/181 constraints, ReadFeed: 0/93 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 668/849 variables, 181/203 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 93/296 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 670/966 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/849 variables, and 966 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60781ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60783ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62606 ms. Remains : 181/181 places, 678/678 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 114 edges and 181 vertex of which 29 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 153 transition count 506
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 153 transition count 506
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 153 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 152 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 152 transition count 459
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 152 transition count 453
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 146 transition count 451
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 146 transition count 449
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 144 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 144 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 441
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 143 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 142 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 142 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 141 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 140 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 140 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 115 place count 140 transition count 373
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 140 transition count 370
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 137 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 137 transition count 364
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 137 transition count 361
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 134 transition count 361
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 138 place count 134 transition count 361
Applied a total of 138 rules in 53 ms. Remains 134 /181 variables (removed 47) and now considering 361/678 (removed 317) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:18:31] [INFO ] Flow matrix only has 357 transitions (discarded 4 similar events)
// Phase 1: matrix 357 rows 134 cols
[2026-05-24 15:18:31] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:18:31] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:18:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 15:18:31] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:18:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:18:31] [INFO ] After 40ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:18:31] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:18:31] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 488 ms.
RANDOM walk for 40000 steps (873 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (188 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 443221 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 443221 steps, saw 129355 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2026-05-24 15:18:34] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:18:34] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:18:34] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:35] [INFO ] Deduced a trap composed of 35 places in 245 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:35] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:36] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2142ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 197 transition count 737
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 195 transition count 732
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 195 transition count 732
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 193 transition count 742
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 192 transition count 728
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 192 transition count 728
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 191 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 191 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 190 transition count 719
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 190 transition count 719
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 189 transition count 717
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 189 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 188 transition count 710
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 188 transition count 710
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 187 transition count 708
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 187 transition count 708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 701
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 699
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 692
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 692
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 690
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 684
Applied a total of 43 rules in 80 ms. Remains 181 /203 variables (removed 22) and now considering 684/742 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 181/203 places, 684/742 transitions.
RANDOM walk for 40000 steps (851 resets) in 307 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 533372 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 533372 steps, saw 154309 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2026-05-24 15:18:40] [INFO ] Flow matrix only has 674 transitions (discarded 10 similar events)
// Phase 1: matrix 674 rows 181 cols
[2026-05-24 15:18:40] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:18:40] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 674/843 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 94/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/855 variables, 12/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/855 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 285 constraints, problems are : Problem set: 0 solved, 1 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:40] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 674/843 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/843 variables, 94/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/843 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:41] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 19 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/843 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/843 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/855 variables, 12/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/855 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/855 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 288 constraints, problems are : Problem set: 0 solved, 1 unsolved in 977 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1305ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 684/684 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 181/181 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 684/684 transitions.
Applied a total of 0 rules in 10 ms. Remains 181 /181 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2026-05-24 15:18:41] [INFO ] Flow matrix only has 674 transitions (discarded 10 similar events)
[2026-05-24 15:18:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:18:41] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-24 15:18:41] [INFO ] Flow matrix only has 674 transitions (discarded 10 similar events)
[2026-05-24 15:18:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:18:41] [INFO ] State equation strengthened by 94 read => feed constraints.
[2026-05-24 15:18:42] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:18:42] [INFO ] Redundant transitions in 16 ms returned []
Running 676 sub problems to find dead transitions.
[2026-05-24 15:18:42] [INFO ] Flow matrix only has 674 transitions (discarded 10 similar events)
[2026-05-24 15:18:42] [INFO ] Invariant cache hit.
[2026-05-24 15:18:42] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:57] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:57] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:57] [INFO ] Deduced a trap composed of 61 places in 354 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:57] [INFO ] Deduced a trap composed of 25 places in 331 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:58] [INFO ] Deduced a trap composed of 27 places in 331 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:58] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:59] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:59] [INFO ] Deduced a trap composed of 98 places in 296 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:18:59] [INFO ] Deduced a trap composed of 98 places in 278 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:00] [INFO ] Deduced a trap composed of 98 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:00] [INFO ] Deduced a trap composed of 98 places in 315 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:00] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:02] [INFO ] Deduced a trap composed of 51 places in 285 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:04] [INFO ] Deduced a trap composed of 36 places in 307 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:05] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 30 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/855 variables, and 25 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/181 constraints, ReadFeed: 0/94 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 676 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 4 (OVERLAPS) 674/855 variables, 181/206 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/855 variables, 94/300 constraints. Problems are: Problem set: 0 solved, 676 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 676/976 constraints. Problems are: Problem set: 0 solved, 676 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 855/855 variables, and 976 constraints, problems are : Problem set: 0 solved, 676 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 676/676 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61104ms problems are : Problem set: 0 solved, 676 unsolved
Search for dead transitions found 0 dead transitions in 61106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62670 ms. Remains : 181/181 places, 684/684 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 181 vertex of which 29 / 181 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 153 transition count 512
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 153 transition count 512
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 153 transition count 498
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 152 transition count 497
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 152 transition count 465
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 152 transition count 459
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 146 transition count 457
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 146 transition count 455
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 144 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 144 transition count 448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 143 transition count 447
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 142 transition count 446
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 142 transition count 445
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 141 transition count 444
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 140 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 140 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 116 place count 140 transition count 377
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 140 transition count 374
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 137 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 128 place count 137 transition count 368
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 137 transition count 365
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 134 transition count 365
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 141 place count 134 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 134 transition count 364
Applied a total of 142 rules in 106 ms. Remains 134 /181 variables (removed 47) and now considering 364/684 (removed 320) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:19:44] [INFO ] Flow matrix only has 360 transitions (discarded 4 similar events)
// Phase 1: matrix 360 rows 134 cols
[2026-05-24 15:19:44] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:19:44] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:19:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2026-05-24 15:19:44] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:19:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:19:44] [INFO ] After 68ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:44] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 18 ms to minimize.
[2026-05-24 15:19:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
TRAPS : Iteration 1
[2026-05-24 15:19:44] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:19:44] [INFO ] After 687ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 851 ms.
RANDOM walk for 40000 steps (861 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (174 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 386756 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 386756 steps, saw 113509 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2026-05-24 15:19:48] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:19:48] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:19:48] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:48] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:48] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1666ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 740
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 194 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 194 transition count 731
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 193 transition count 736
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 192 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 192 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 191 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 191 transition count 720
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 190 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 190 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 189 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 189 transition count 711
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 188 transition count 704
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 188 transition count 704
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 187 transition count 702
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 187 transition count 702
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 186 transition count 695
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 186 transition count 695
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 185 transition count 693
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 185 transition count 693
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 184 transition count 686
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 184 transition count 686
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 183 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 183 transition count 684
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 182 transition count 680
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 182 transition count 680
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 181 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 181 transition count 678
Applied a total of 43 rules in 90 ms. Remains 181 /203 variables (removed 22) and now considering 678/742 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 181/203 places, 678/742 transitions.
RANDOM walk for 40000 steps (857 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (181 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 401697 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 401697 steps, saw 117925 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2026-05-24 15:19:52] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
// Phase 1: matrix 668 rows 181 cols
[2026-05-24 15:19:52] [INFO ] Computed 10 invariants in 1 ms
[2026-05-24 15:19:52] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 668/837 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/837 variables, 93/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/849 variables, 12/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/849 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 54/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:53] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:19:53] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 668/837 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/837 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/837 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/849 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/849 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1344ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 678/678 transitions.
Applied a total of 0 rules in 23 ms. Remains 181 /181 variables (removed 0) and now considering 678/678 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 181/181 places, 678/678 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 678/678 transitions.
Applied a total of 0 rules in 12 ms. Remains 181 /181 variables (removed 0) and now considering 678/678 (removed 0) transitions.
[2026-05-24 15:19:54] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:19:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:19:54] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-24 15:19:54] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:19:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:19:54] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 15:19:55] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:19:55] [INFO ] Redundant transitions in 14 ms returned []
Running 670 sub problems to find dead transitions.
[2026-05-24 15:19:55] [INFO ] Flow matrix only has 668 transitions (discarded 10 similar events)
[2026-05-24 15:19:55] [INFO ] Invariant cache hit.
[2026-05-24 15:19:55] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:10] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:10] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:10] [INFO ] Deduced a trap composed of 25 places in 326 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:10] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:11] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:11] [INFO ] Deduced a trap composed of 98 places in 306 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:12] [INFO ] Deduced a trap composed of 98 places in 318 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:12] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:14] [INFO ] Deduced a trap composed of 51 places in 316 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:16] [INFO ] Deduced a trap composed of 36 places in 305 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:20:17] [INFO ] Deduced a trap composed of 43 places in 345 ms of which 41 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 181/849 variables, and 21 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/181 constraints, ReadFeed: 0/93 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 4 (OVERLAPS) 668/849 variables, 181/202 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 93/295 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 670/965 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/849 variables, and 965 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 181/181 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60892ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62172 ms. Remains : 181/181 places, 678/678 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 181 vertex of which 29 / 181 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 153 transition count 506
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 153 transition count 506
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 153 transition count 492
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 152 transition count 491
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 1 with 32 rules applied. Total rules applied 55 place count 152 transition count 459
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 152 transition count 453
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 69 place count 146 transition count 451
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 146 transition count 449
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 144 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 80 place count 144 transition count 442
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 144 transition count 441
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 143 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 142 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 142 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 141 transition count 438
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 140 transition count 399
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 140 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 115 place count 140 transition count 373
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 140 transition count 370
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 121 place count 137 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 127 place count 137 transition count 364
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 137 transition count 361
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 133 place count 134 transition count 361
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 139 place count 134 transition count 361
Applied a total of 139 rules in 101 ms. Remains 134 /181 variables (removed 47) and now considering 361/678 (removed 317) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:20:56] [INFO ] Flow matrix only has 357 transitions (discarded 4 similar events)
// Phase 1: matrix 357 rows 134 cols
[2026-05-24 15:20:56] [INFO ] Computed 10 invariants in 7 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:20:56] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:20:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 15:20:56] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:20:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:20:56] [INFO ] After 46ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:20:57] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:20:57] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 540 ms.
RANDOM walk for 40000 steps (832 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (176 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 553119 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 553119 steps, saw 160145 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2026-05-24 15:21:00] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:21:00] [INFO ] Computed 10 invariants in 1 ms
[2026-05-24 15:21:00] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 446 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:00] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:00] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 98/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/921 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/935 variables, 14/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/935 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/935 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 935/935 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1498ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 742/742 transitions.
Graph (complete) has 1143 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 2 place count 202 transition count 741
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 201 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 200 transition count 740
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 199 transition count 739
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 199 transition count 739
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 196 transition count 736
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 16 place count 193 transition count 730
Iterating global reduction 3 with 3 rules applied. Total rules applied 19 place count 193 transition count 730
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 192 transition count 735
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 22 place count 191 transition count 721
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 191 transition count 721
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 190 transition count 719
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 190 transition count 719
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 189 transition count 712
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 189 transition count 712
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 188 transition count 710
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 188 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 187 transition count 703
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 187 transition count 703
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 186 transition count 701
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 186 transition count 701
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 185 transition count 694
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 185 transition count 694
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 184 transition count 692
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 184 transition count 692
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 183 transition count 685
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 183 transition count 685
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 182 transition count 683
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 182 transition count 683
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 181 transition count 679
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 181 transition count 679
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 180 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 180 transition count 677
Applied a total of 45 rules in 90 ms. Remains 180 /203 variables (removed 23) and now considering 677/742 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 180/203 places, 677/742 transitions.
RANDOM walk for 40000 steps (888 resets) in 295 ms. (135 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (182 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 527660 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 527660 steps, saw 153001 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2026-05-24 15:21:04] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
// Phase 1: matrix 667 rows 180 cols
[2026-05-24 15:21:04] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:21:04] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 667/835 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/835 variables, 93/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/847 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/847 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 53/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 114/168 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:05] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:05] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:05] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 667/835 variables, 168/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/835 variables, 93/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/835 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/835 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/847 variables, 12/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/847 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/847 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 847/847 variables, and 287 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1700ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 677/677 transitions.
Applied a total of 0 rules in 17 ms. Remains 180 /180 variables (removed 0) and now considering 677/677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 180/180 places, 677/677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 677/677 transitions.
Applied a total of 0 rules in 14 ms. Remains 180 /180 variables (removed 0) and now considering 677/677 (removed 0) transitions.
[2026-05-24 15:21:06] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 15:21:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:21:06] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-24 15:21:06] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 15:21:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:21:07] [INFO ] State equation strengthened by 93 read => feed constraints.
[2026-05-24 15:21:08] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 15:21:08] [INFO ] Redundant transitions in 16 ms returned []
Running 669 sub problems to find dead transitions.
[2026-05-24 15:21:08] [INFO ] Flow matrix only has 667 transitions (discarded 10 similar events)
[2026-05-24 15:21:08] [INFO ] Invariant cache hit.
[2026-05-24 15:21:08] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:22] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:22] [INFO ] Deduced a trap composed of 60 places in 308 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:23] [INFO ] Deduced a trap composed of 25 places in 317 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:23] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:23] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:24] [INFO ] Deduced a trap composed of 97 places in 268 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:24] [INFO ] Deduced a trap composed of 42 places in 234 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:26] [INFO ] Deduced a trap composed of 51 places in 323 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:28] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:21:28] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 22 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 180/847 variables, and 20 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/180 constraints, ReadFeed: 0/93 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (OVERLAPS) 667/847 variables, 180/200 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/847 variables, 93/293 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/847 variables, 669/962 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/847 variables, and 962 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60993ms problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 60995ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62544 ms. Remains : 180/180 places, 677/677 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 113 edges and 180 vertex of which 29 / 180 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 152 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 152 transition count 505
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 21 place count 152 transition count 491
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 151 transition count 490
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 56 place count 151 transition count 457
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 6 rules applied. Total rules applied 62 place count 151 transition count 451
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 70 place count 145 transition count 449
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 70 place count 145 transition count 447
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 143 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 81 place count 143 transition count 440
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 143 transition count 439
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 142 transition count 439
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 141 transition count 438
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 141 transition count 437
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 140 transition count 436
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 139 transition count 397
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 139 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 116 place count 139 transition count 371
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 139 transition count 368
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 122 place count 136 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 128 place count 136 transition count 362
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 131 place count 136 transition count 359
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 134 place count 133 transition count 359
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 140 place count 133 transition count 359
Applied a total of 140 rules in 60 ms. Remains 133 /180 variables (removed 47) and now considering 359/677 (removed 318) transitions.
Running SMT prover for 1 properties.
[2026-05-24 15:22:09] [INFO ] Flow matrix only has 355 transitions (discarded 4 similar events)
// Phase 1: matrix 355 rows 133 cols
[2026-05-24 15:22:09] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:22:09] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-24 15:22:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-24 15:22:09] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-24 15:22:09] [INFO ] State equation strengthened by 21 read => feed constraints.
[2026-05-24 15:22:09] [INFO ] After 92ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 15:22:09] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 15:22:09] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 566 ms.
RANDOM walk for 40000 steps (904 resets) in 305 ms. (130 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (186 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 436598 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :0 out of 1
Probabilistic random walk after 436598 steps, saw 127617 distinct states, run finished after 3005 ms. (steps per millisecond=145 ) properties seen :0
[2026-05-24 15:22:12] [INFO ] Flow matrix only has 732 transitions (discarded 10 similar events)
// Phase 1: matrix 732 rows 203 cols
[2026-05-24 15:22:12] [INFO ] Computed 10 invariants in 2 ms
[2026-05-24 15:22:12] [INFO ] State equation strengthened by 98 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 732/921 variables, 189/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/921 variables, 98/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/935 variables, 14/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/935 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 935/935 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 58/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/189 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:22:13] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 15:22:13] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 732/921 variables, 189/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="FireWire-PT-20"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5973"
echo " Executing tool gold2025"
echo " Input is FireWire-PT-20, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r144-smll-177955812600188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;