About the Execution of ITS-Tools for DoubleExponent-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2883.987 | 3600000.00 | 4683983.00 | 12174.50 | ? ? ? ? 1 1 ? ? 1 ? ? ? ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800885.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 itstools
Input is DoubleExponent-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800885
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.3K Mar 6 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 6 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 6 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 6 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 6 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 169K 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 positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779681808003
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 04:03:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 04:03:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 04:03:29] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2026-05-25 04:03:29] [INFO ] Transformed 534 places.
[2026-05-25 04:03:29] [INFO ] Transformed 498 transitions.
[2026-05-25 04:03:29] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13383607889195660031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15138827687690557157.kers'
[2026-05-25 04:03:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13383607889195660031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15138827687690557157.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 498 rows 534 cols 1404 entries
Finished phase 1 with 449 SingleSign rule and 31 generalized
[2026-05-25 04:03:29] [INFO ] Computed 54 invariants in 19 ms
Computed 54 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-15138827687690557157.kers
Total runtime 22 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
RANDOM walk for 10000 steps (328 resets) in 47 ms. (208 steps per ms)
FORMULA DoubleExponent-PT-010-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140001 steps (4007 resets) in 299 ms. (466 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
[2026-05-25 04:03:29] [INFO ] Invariant cache hit.
[2026-05-25 04:03:30] [INFO ] [Real]Absence check using 5 positive place invariants in 21 ms returned sat
[2026-05-25 04:03:30] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 27 ms returned sat
[2026-05-25 04:03:30] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2026-05-25 04:03:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:03:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2026-05-25 04:03:31] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 55 ms returned sat
[2026-05-25 04:03:31] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2026-05-25 04:03:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2026-05-25 04:03:32] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 46 ms.
[2026-05-25 04:03:36] [INFO ] Added : 320 causal constraints over 64 iterations in 3893 ms. Result :unknown
[2026-05-25 04:03:36] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2026-05-25 04:03:36] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 30 ms returned sat
[2026-05-25 04:03:36] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2026-05-25 04:03:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:03:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2026-05-25 04:03:36] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 28 ms returned sat
[2026-05-25 04:03:37] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2026-05-25 04:03:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2026-05-25 04:03:37] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 42 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2026-05-25 04:03:41] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2026-05-25 04:03:41] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 21 ms returned sat
[2026-05-25 04:03:42] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2026-05-25 04:03:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:03:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2026-05-25 04:03:42] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 19 ms returned sat
[2026-05-25 04:03:42] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2026-05-25 04:03:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2026-05-25 04:03:43] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 34 ms.
[2026-05-25 04:03:47] [INFO ] Added : 415 causal constraints over 83 iterations in 4328 ms. Result :unknown
[2026-05-25 04:03:47] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 04:03:47] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 23 ms returned sat
[2026-05-25 04:03:47] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2026-05-25 04:03:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:03:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 04:03:48] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 16 ms returned sat
[2026-05-25 04:03:48] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2026-05-25 04:03:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 957 ms
[2026-05-25 04:03:49] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2026-05-25 04:03:53] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 04:03:53] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 21 ms returned sat
[2026-05-25 04:03:53] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2026-05-25 04:03:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:03:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 04:03:53] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 16 ms returned sat
[2026-05-25 04:03:53] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2026-05-25 04:03:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2332 ms
[2026-05-25 04:03:56] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2026-05-25 04:03:58] [INFO ] Added : 205 causal constraints over 41 iterations in 2330 ms. Result :unknown
[2026-05-25 04:03:58] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 04:03:58] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 18 ms returned sat
[2026-05-25 04:03:58] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2026-05-25 04:03:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:03:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2026-05-25 04:03:59] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 21 ms returned sat
[2026-05-25 04:03:59] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2026-05-25 04:03:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2026-05-25 04:03:59] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2026-05-25 04:04:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 04:04:04] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 04:04:04] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 16 ms returned sat
[2026-05-25 04:04:04] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2026-05-25 04:04:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 9 ms returned sat
[2026-05-25 04:04:04] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 27 ms returned sat
[2026-05-25 04:04:05] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2026-05-25 04:04:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1244 ms
[2026-05-25 04:04:06] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 04:04:08] [INFO ] Added : 119 causal constraints over 24 iterations in 1807 ms. Result :sat
Minimization took 639 ms.
[2026-05-25 04:04:08] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 04:04:08] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 23 ms returned sat
[2026-05-25 04:04:09] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2026-05-25 04:04:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 04:04:09] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 16 ms returned sat
[2026-05-25 04:04:09] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2026-05-25 04:04:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2026-05-25 04:04:09] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-25 04:04:14] [INFO ] Added : 360 causal constraints over 72 iterations in 4173 ms. Result :sat
Minimization took 294 ms.
[2026-05-25 04:04:14] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 04:04:14] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 17 ms returned sat
[2026-05-25 04:04:14] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2026-05-25 04:04:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 04:04:15] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 16 ms returned sat
[2026-05-25 04:04:15] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2026-05-25 04:04:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1916 ms
[2026-05-25 04:04:17] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2026-05-25 04:04:20] [INFO ] Added : 180 causal constraints over 36 iterations in 2725 ms. Result :unknown
[2026-05-25 04:04:20] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 04:04:20] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 18 ms returned sat
[2026-05-25 04:04:20] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2026-05-25 04:04:20] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2026-05-25 04:04:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 04:04:20] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 17 ms returned sat
[2026-05-25 04:04:20] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2026-05-25 04:04:20] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2026-05-25 04:04:22] [INFO ] Added : 55 causal constraints over 11 iterations in 1369 ms. Result :sat
Minimization took 592 ms.
[2026-05-25 04:04:22] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 04:04:22] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 18 ms returned sat
[2026-05-25 04:04:23] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2026-05-25 04:04:23] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2026-05-25 04:04:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 04:04:23] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 17 ms returned sat
[2026-05-25 04:04:23] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2026-05-25 04:04:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 770 ms
[2026-05-25 04:04:24] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2026-05-25 04:04:28] [INFO ] Added : 330 causal constraints over 66 iterations in 3893 ms. Result :unknown
[2026-05-25 04:04:28] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 04:04:28] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 20 ms returned sat
[2026-05-25 04:04:28] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2026-05-25 04:04:28] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 28 ms.
[2026-05-25 04:04:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 04:04:28] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 16 ms returned sat
[2026-05-25 04:04:29] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2026-05-25 04:04:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2026-05-25 04:04:29] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 15 ms.
[2026-05-25 04:04:33] [INFO ] Added : 310 causal constraints over 62 iterations in 4093 ms. Result :unknown
[2026-05-25 04:04:33] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 04:04:33] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 28 ms returned sat
[2026-05-25 04:04:34] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2026-05-25 04:04:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2026-05-25 04:04:34] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 25 ms returned sat
[2026-05-25 04:04:34] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2026-05-25 04:04:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2026-05-25 04:04:35] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2026-05-25 04:04:39] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 04:04:39] [INFO ] [Real]Absence check using 5 positive and 49 generalized place invariants in 29 ms returned sat
[2026-05-25 04:04:39] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2026-05-25 04:04:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:04:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-25 04:04:39] [INFO ] [Nat]Absence check using 5 positive and 49 generalized place invariants in 26 ms returned sat
[2026-05-25 04:04:40] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2026-05-25 04:04:40] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-25 04:04:43] [INFO ] Added : 185 causal constraints over 37 iterations in 3200 ms. Result :sat
Minimization took 590 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
FORMULA DoubleExponent-PT-010-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Support contains 13 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 527 transition count 389
Reduce places removed 107 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 112 rules applied. Total rules applied 223 place count 420 transition count 384
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 228 place count 415 transition count 384
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 228 place count 415 transition count 363
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 270 place count 394 transition count 363
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 448 place count 305 transition count 274
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 480 place count 289 transition count 274
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 3 with 38 rules applied. Total rules applied 518 place count 289 transition count 236
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 556 place count 251 transition count 236
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 594 place count 251 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 595 place count 250 transition count 235
Applied a total of 595 rules in 167 ms. Remains 250 /534 variables (removed 284) and now considering 235/498 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 250/534 places, 235/498 transitions.
findPositiveTsemiflow completed in 57448 ms - Found solution {32=1, 54=1, 58=1, 61=2, 62=2, 86=1, 89=1, 127=1, 143=2, 151=1, 211=1, 225=1, 228=1} and attempted to minimize in 0 ms success -> {32=1, 54=1, 58=1, 86=1, 89=1, 127=1, 151=1, 211=1, 228=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17920234655884273618.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11279826529904089955.kers'
[2026-05-25 04:06:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17920234655884273618.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11279826529904089955.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 235 rows 248 cols 1412 entries
Finished phase 1 with 139 SingleSign rule and 61 generalized
[2026-05-25 04:06:11] [INFO ] Computed 50 invariants in 2 ms
Computed 50 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11279826529904089955.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
RANDOM walk for 1000000 steps (128508 resets) in 1040 ms. (960 steps per ms)
BEST_FIRST walk for 13000005 steps (1101290 resets) in 8278 ms. (1570 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
[2026-05-25 04:06:20] [INFO ] Invariant cache hit.
[2026-05-25 04:06:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:21] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:21] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2026-05-25 04:06:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:06:21] [INFO ] [Real]Added 32 Read/Feed constraints in 85 ms returned sat
[2026-05-25 04:06:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:21] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 20 ms returned sat
[2026-05-25 04:06:21] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2026-05-25 04:06:21] [INFO ] [Nat]Added 32 Read/Feed constraints in 162 ms returned sat
[2026-05-25 04:06:21] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 27 ms.
[2026-05-25 04:06:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2026-05-25 04:06:22] [INFO ] Added : 106 causal constraints over 22 iterations in 1212 ms. Result :sat
Minimization took 321 ms.
[2026-05-25 04:06:23] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:23] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:23] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-25 04:06:23] [INFO ] [Real]Added 32 Read/Feed constraints in 114 ms returned sat
[2026-05-25 04:06:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:23] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:23] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2026-05-25 04:06:23] [INFO ] [Nat]Added 32 Read/Feed constraints in 356 ms returned sat
[2026-05-25 04:06:24] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 12 ms.
[2026-05-25 04:06:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 429 ms
[2026-05-25 04:06:26] [INFO ] Added : 165 causal constraints over 34 iterations in 2165 ms. Result :sat
Minimization took 516 ms.
[2026-05-25 04:06:26] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:26] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:26] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-25 04:06:26] [INFO ] [Real]Added 32 Read/Feed constraints in 90 ms returned sat
[2026-05-25 04:06:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:27] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 10 ms returned sat
[2026-05-25 04:06:27] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2026-05-25 04:06:27] [INFO ] [Nat]Added 32 Read/Feed constraints in 170 ms returned sat
[2026-05-25 04:06:27] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 16 ms.
[2026-05-25 04:06:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2026-05-25 04:06:28] [INFO ] Added : 91 causal constraints over 19 iterations in 1049 ms. Result :sat
Minimization took 371 ms.
[2026-05-25 04:06:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:28] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:28] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-25 04:06:29] [INFO ] [Real]Added 32 Read/Feed constraints in 104 ms returned sat
[2026-05-25 04:06:29] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 14 ms.
[2026-05-25 04:06:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:29] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 10 ms returned sat
[2026-05-25 04:06:29] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-25 04:06:29] [INFO ] [Nat]Added 32 Read/Feed constraints in 115 ms returned sat
[2026-05-25 04:06:29] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 15 ms.
[2026-05-25 04:06:31] [INFO ] Added : 174 causal constraints over 35 iterations in 1680 ms. Result :sat
Minimization took 709 ms.
[2026-05-25 04:06:31] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:31] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:32] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2026-05-25 04:06:32] [INFO ] [Real]Added 32 Read/Feed constraints in 121 ms returned sat
[2026-05-25 04:06:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:32] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:32] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2026-05-25 04:06:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 199 ms returned sat
[2026-05-25 04:06:32] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 9 ms.
[2026-05-25 04:06:34] [INFO ] Added : 151 causal constraints over 31 iterations in 1793 ms. Result :sat
Minimization took 436 ms.
[2026-05-25 04:06:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:34] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:35] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2026-05-25 04:06:35] [INFO ] [Real]Added 32 Read/Feed constraints in 108 ms returned sat
[2026-05-25 04:06:35] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 13 ms.
[2026-05-25 04:06:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:35] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:35] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-25 04:06:35] [INFO ] [Nat]Added 32 Read/Feed constraints in 340 ms returned sat
[2026-05-25 04:06:35] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 11 ms.
[2026-05-25 04:06:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2026-05-25 04:06:37] [INFO ] Added : 148 causal constraints over 30 iterations in 2164 ms. Result :sat
Minimization took 451 ms.
[2026-05-25 04:06:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:38] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:38] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2026-05-25 04:06:38] [INFO ] [Real]Added 32 Read/Feed constraints in 96 ms returned sat
[2026-05-25 04:06:38] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 14 ms.
[2026-05-25 04:06:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:38] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:38] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-25 04:06:39] [INFO ] [Nat]Added 32 Read/Feed constraints in 116 ms returned sat
[2026-05-25 04:06:39] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 11 ms.
[2026-05-25 04:06:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 386 ms
[2026-05-25 04:06:40] [INFO ] Added : 81 causal constraints over 17 iterations in 1141 ms. Result :sat
Minimization took 390 ms.
[2026-05-25 04:06:40] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:40] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:40] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-25 04:06:40] [INFO ] [Real]Added 32 Read/Feed constraints in 46 ms returned sat
[2026-05-25 04:06:40] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 11 ms.
[2026-05-25 04:06:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:41] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:41] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-25 04:06:41] [INFO ] [Nat]Added 32 Read/Feed constraints in 109 ms returned sat
[2026-05-25 04:06:41] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 13 ms.
[2026-05-25 04:06:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 823 ms
[2026-05-25 04:06:42] [INFO ] Added : 85 causal constraints over 18 iterations in 1599 ms. Result :sat
Minimization took 316 ms.
[2026-05-25 04:06:43] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:43] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:43] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-25 04:06:43] [INFO ] [Real]Added 32 Read/Feed constraints in 42 ms returned sat
[2026-05-25 04:06:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:43] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 10 ms returned sat
[2026-05-25 04:06:43] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-25 04:06:43] [INFO ] [Nat]Added 32 Read/Feed constraints in 85 ms returned sat
[2026-05-25 04:06:43] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 11 ms.
[2026-05-25 04:06:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2026-05-25 04:06:44] [INFO ] Added : 40 causal constraints over 9 iterations in 522 ms. Result :sat
Minimization took 369 ms.
[2026-05-25 04:06:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:44] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:44] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-25 04:06:44] [INFO ] [Real]Added 32 Read/Feed constraints in 68 ms returned sat
[2026-05-25 04:06:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:44] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 10 ms returned sat
[2026-05-25 04:06:44] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-25 04:06:44] [INFO ] [Nat]Added 32 Read/Feed constraints in 86 ms returned sat
[2026-05-25 04:06:45] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 11 ms.
[2026-05-25 04:06:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2026-05-25 04:06:45] [INFO ] Added : 91 causal constraints over 19 iterations in 931 ms. Result :sat
Minimization took 359 ms.
[2026-05-25 04:06:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:46] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 10 ms returned sat
[2026-05-25 04:06:46] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2026-05-25 04:06:46] [INFO ] [Real]Added 32 Read/Feed constraints in 103 ms returned sat
[2026-05-25 04:06:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:46] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:46] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2026-05-25 04:06:47] [INFO ] [Nat]Added 32 Read/Feed constraints in 176 ms returned sat
[2026-05-25 04:06:47] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 30 ms.
[2026-05-25 04:06:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 532 ms
[2026-05-25 04:06:48] [INFO ] Added : 150 causal constraints over 31 iterations in 1724 ms. Result :sat
Minimization took 565 ms.
[2026-05-25 04:06:49] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:49] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 21 ms returned sat
[2026-05-25 04:06:49] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2026-05-25 04:06:49] [INFO ] [Real]Added 32 Read/Feed constraints in 78 ms returned sat
[2026-05-25 04:06:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:49] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 11 ms returned sat
[2026-05-25 04:06:49] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2026-05-25 04:06:49] [INFO ] [Nat]Added 32 Read/Feed constraints in 110 ms returned sat
[2026-05-25 04:06:49] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 12 ms.
[2026-05-25 04:06:51] [INFO ] Added : 146 causal constraints over 30 iterations in 1164 ms. Result :sat
Minimization took 414 ms.
[2026-05-25 04:06:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:06:51] [INFO ] [Real]Absence check using 4 positive and 46 generalized place invariants in 10 ms returned sat
[2026-05-25 04:06:51] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2026-05-25 04:06:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:06:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:06:51] [INFO ] [Nat]Absence check using 4 positive and 46 generalized place invariants in 10 ms returned sat
[2026-05-25 04:06:51] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2026-05-25 04:06:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 307 ms returned sat
[2026-05-25 04:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2026-05-25 04:06:52] [INFO ] Computed and/alt/rep : 198/1041/198 causal constraints (skipped 36 transitions) in 13 ms.
[2026-05-25 04:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2026-05-25 04:06:54] [INFO ] Added : 142 causal constraints over 29 iterations in 1852 ms. Result :sat
Minimization took 590 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Support contains 13 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 235/235 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 235/235 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 250/250 places, 235/235 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 235/235 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 235/235 (removed 0) transitions.
[2026-05-25 04:07:35] [INFO ] Invariant cache hit.
[2026-05-25 04:07:36] [INFO ] Implicit Places using invariants in 1250 ms returned [21, 27, 48, 53, 75, 82, 103, 109, 130, 135, 136, 160, 166, 189, 195, 203, 211, 217, 241, 247]
[2026-05-25 04:07:36] [INFO ] Actually due to overlaps returned [203, 135]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1277 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 248/250 places, 235/235 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 248 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 247 transition count 234
Applied a total of 2 rules in 25 ms. Remains 247 /248 variables (removed 1) and now considering 234/235 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2543832306466442632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11717025735124110944.kers'
[2026-05-25 04:07:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2543832306466442632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11717025735124110944.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 234 rows 245 cols 1361 entries
Finished phase 1 with 141 SingleSign rule and 58 generalized
[2026-05-25 04:07:36] [INFO ] Computed 48 invariants in 2 ms
Computed 48 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11717025735124110944.kers
Total runtime 3 ms.
[2026-05-25 04:07:38] [INFO ] Implicit Places using invariants in 1053 ms returned [21, 27, 48, 53, 75, 82, 103, 109, 130, 135, 159, 165, 188, 194, 209, 214, 238, 244]
[2026-05-25 04:07:38] [INFO ] Actually due to overlaps returned [244, 238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1057 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 245/250 places, 234/235 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 245 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 233
Applied a total of 2 rules in 22 ms. Remains 244 /245 variables (removed 1) and now considering 233/234 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16219742232395273986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7769611521413926035.kers'
[2026-05-25 04:07:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16219742232395273986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7769611521413926035.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 233 rows 242 cols 1318 entries
Finished phase 1 with 146 SingleSign rule and 52 generalized
[2026-05-25 04:07:38] [INFO ] Computed 46 invariants in 3 ms
Computed 46 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7769611521413926035.kers
Total runtime 10 ms.
[2026-05-25 04:07:38] [INFO ] Implicit Places using invariants in 860 ms returned [21, 27, 48, 53, 75, 82, 103, 109, 130, 135, 159, 165, 188, 194, 209, 214]
[2026-05-25 04:07:38] [INFO ] Actually due to overlaps returned [27, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 863 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 242/250 places, 233/235 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 241 transition count 232
Applied a total of 2 rules in 16 ms. Remains 241 /242 variables (removed 1) and now considering 232/233 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15311371504995266357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16195296804060618122.kers'
[2026-05-25 04:07:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15311371504995266357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16195296804060618122.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 232 rows 239 cols 1281 entries
Finished phase 1 with 145 SingleSign rule and 52 generalized
[2026-05-25 04:07:38] [INFO ] Computed 44 invariants in 2 ms
Computed 44 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16195296804060618122.kers
Total runtime 2 ms.
[2026-05-25 04:07:39] [INFO ] Implicit Places using invariants in 814 ms returned [45, 50, 72, 79, 100, 106, 127, 132, 156, 162, 185, 191, 206, 211]
[2026-05-25 04:07:39] [INFO ] Actually due to overlaps returned [50, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 827 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 239/250 places, 232/235 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 238 transition count 231
Applied a total of 2 rules in 17 ms. Remains 238 /239 variables (removed 1) and now considering 231/232 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-518260051307028178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4657637610913143277.kers'
[2026-05-25 04:07:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-518260051307028178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4657637610913143277.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 231 rows 236 cols 1249 entries
Finished phase 1 with 144 SingleSign rule and 52 generalized
[2026-05-25 04:07:39] [INFO ] Computed 42 invariants in 2 ms
Computed 42 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4657637610913143277.kers
Total runtime 2 ms.
[2026-05-25 04:07:40] [INFO ] Implicit Places using invariants in 602 ms returned [69, 76, 97, 103, 124, 129, 153, 159, 182, 188, 203, 208]
[2026-05-25 04:07:40] [INFO ] Actually due to overlaps returned [76, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 614 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 236/250 places, 231/235 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 236 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 235 transition count 230
Applied a total of 2 rules in 27 ms. Remains 235 /236 variables (removed 1) and now considering 230/231 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-891715782127765243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16182406628157075469.kers'
[2026-05-25 04:07:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-891715782127765243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16182406628157075469.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 230 rows 233 cols 1222 entries
Finished phase 1 with 144 SingleSign rule and 51 generalized
[2026-05-25 04:07:40] [INFO ] Computed 40 invariants in 2 ms
Computed 40 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16182406628157075469.kers
Total runtime 2 ms.
[2026-05-25 04:07:40] [INFO ] Implicit Places using invariants in 568 ms returned [94, 100, 121, 126, 150, 156, 179, 185, 200, 205]
[2026-05-25 04:07:40] [INFO ] Actually due to overlaps returned [100, 94]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 571 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 233/250 places, 230/235 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 230
Applied a total of 2 rules in 29 ms. Remains 233 /233 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11850345574680317098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-771172359539096810.kers'
[2026-05-25 04:07:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11850345574680317098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-771172359539096810.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 230 rows 231 cols 1202 entries
Finished phase 1 with 144 SingleSign rule and 51 generalized
[2026-05-25 04:07:41] [INFO ] Computed 38 invariants in 2 ms
Computed 38 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-771172359539096810.kers
Total runtime 3 ms.
[2026-05-25 04:07:41] [INFO ] Implicit Places using invariants in 454 ms returned [119, 124, 148, 154, 177, 183, 198, 203]
[2026-05-25 04:07:41] [INFO ] Actually due to overlaps returned [124, 119]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 475 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 231/250 places, 230/235 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 230 transition count 229
Applied a total of 2 rules in 12 ms. Remains 230 /231 variables (removed 1) and now considering 229/230 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11412794208009010312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7102635338709676314.kers'
[2026-05-25 04:07:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11412794208009010312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7102635338709676314.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 229 rows 228 cols 1183 entries
Finished phase 1 with 143 SingleSign rule and 51 generalized
[2026-05-25 04:07:41] [INFO ] Computed 36 invariants in 2 ms
Computed 36 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7102635338709676314.kers
Total runtime 3 ms.
[2026-05-25 04:07:41] [INFO ] Implicit Places using invariants in 370 ms returned [145, 151, 174, 180, 195, 200]
[2026-05-25 04:07:41] [INFO ] Actually due to overlaps returned [151, 145]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 393 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 228/250 places, 229/235 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 228 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 227 transition count 228
Applied a total of 2 rules in 11 ms. Remains 227 /228 variables (removed 1) and now considering 228/229 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14454815481752490051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1876372738239229398.kers'
[2026-05-25 04:07:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14454815481752490051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1876372738239229398.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 228 rows 225 cols 1169 entries
Finished phase 1 with 142 SingleSign rule and 51 generalized
[2026-05-25 04:07:41] [INFO ] Computed 34 invariants in 2 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1876372738239229398.kers
Total runtime 3 ms.
[2026-05-25 04:07:42] [INFO ] Implicit Places using invariants in 381 ms returned [171, 177, 192, 197]
[2026-05-25 04:07:42] [INFO ] Actually due to overlaps returned [171, 177]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 406 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 225/250 places, 228/235 transitions.
Applied a total of 0 rules in 5 ms. Remains 225 /225 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 10 iterations and 6680 ms. Remains : 225/250 places, 228/235 transitions.
findPositiveTsemiflow completed in 123116 ms - Found solution {28=1, 52=1, 71=1, 104=1, 128=1, 188=1, 205=1, 212=1} and attempted to minimize in 0 ms success -> {28=1, 52=1, 71=1, 104=1, 128=1, 188=1, 205=1, 212=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1196123935067220028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6805860437101800272.kers'
[2026-05-25 04:09:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1196123935067220028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6805860437101800272.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 228 rows 223 cols 1160 entries
Finished phase 1 with 144 SingleSign rule and 49 generalized
[2026-05-25 04:09:55] [INFO ] Computed 32 invariants in 8 ms
Computed 32 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6805860437101800272.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
RANDOM walk for 1000000 steps (144393 resets) in 863 ms. (1157 steps per ms)
BEST_FIRST walk for 13000004 steps (1188297 resets) in 7633 ms. (1702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
[2026-05-25 04:10:03] [INFO ] Invariant cache hit.
[2026-05-25 04:10:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:04] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:04] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 04:10:04] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:10:04] [INFO ] [Real]Added 32 Read/Feed constraints in 106 ms returned sat
[2026-05-25 04:10:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:04] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:04] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-25 04:10:04] [INFO ] [Nat]Added 32 Read/Feed constraints in 170 ms returned sat
[2026-05-25 04:10:04] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 18 ms.
[2026-05-25 04:10:05] [INFO ] Added : 109 causal constraints over 22 iterations in 1227 ms. Result :sat
Minimization took 386 ms.
[2026-05-25 04:10:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:06] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:06] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2026-05-25 04:10:06] [INFO ] [Real]Added 32 Read/Feed constraints in 185 ms returned sat
[2026-05-25 04:10:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:06] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-25 04:10:06] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2026-05-25 04:10:07] [INFO ] [Nat]Added 32 Read/Feed constraints in 291 ms returned sat
[2026-05-25 04:10:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2026-05-25 04:10:07] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 8 ms.
[2026-05-25 04:10:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 447 ms
[2026-05-25 04:10:10] [INFO ] Added : 175 causal constraints over 36 iterations in 3102 ms. Result :sat
Minimization took 647 ms.
[2026-05-25 04:10:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:11] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:11] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2026-05-25 04:10:11] [INFO ] [Real]Added 32 Read/Feed constraints in 79 ms returned sat
[2026-05-25 04:10:11] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:10:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:11] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-25 04:10:11] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2026-05-25 04:10:11] [INFO ] [Nat]Added 32 Read/Feed constraints in 149 ms returned sat
[2026-05-25 04:10:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2026-05-25 04:10:12] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:10:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 274 ms
[2026-05-25 04:10:14] [INFO ] Added : 150 causal constraints over 30 iterations in 2329 ms. Result :sat
Minimization took 431 ms.
[2026-05-25 04:10:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:14] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-25 04:10:14] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-25 04:10:15] [INFO ] [Real]Added 32 Read/Feed constraints in 163 ms returned sat
[2026-05-25 04:10:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 04:10:15] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:15] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-25 04:10:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 225 ms returned sat
[2026-05-25 04:10:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2026-05-25 04:10:15] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 8 ms.
[2026-05-25 04:10:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2026-05-25 04:10:17] [INFO ] Added : 108 causal constraints over 22 iterations in 1695 ms. Result :sat
Minimization took 305 ms.
[2026-05-25 04:10:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:17] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-25 04:10:17] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2026-05-25 04:10:18] [INFO ] [Real]Added 32 Read/Feed constraints in 93 ms returned sat
[2026-05-25 04:10:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 04:10:18] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:18] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2026-05-25 04:10:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 154 ms returned sat
[2026-05-25 04:10:18] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:10:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2026-05-25 04:10:20] [INFO ] Added : 165 causal constraints over 33 iterations in 2274 ms. Result :sat
Minimization took 435 ms.
[2026-05-25 04:10:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:21] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-25 04:10:21] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-25 04:10:21] [INFO ] [Real]Added 32 Read/Feed constraints in 106 ms returned sat
[2026-05-25 04:10:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:21] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 14 ms returned sat
[2026-05-25 04:10:21] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-25 04:10:21] [INFO ] [Nat]Added 32 Read/Feed constraints in 139 ms returned sat
[2026-05-25 04:10:21] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:10:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1493 ms
[2026-05-25 04:10:25] [INFO ] Added : 160 causal constraints over 32 iterations in 3646 ms. Result :sat
Minimization took 480 ms.
[2026-05-25 04:10:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:25] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:26] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2026-05-25 04:10:26] [INFO ] [Real]Added 32 Read/Feed constraints in 104 ms returned sat
[2026-05-25 04:10:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:26] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-25 04:10:26] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-05-25 04:10:26] [INFO ] [Nat]Added 32 Read/Feed constraints in 86 ms returned sat
[2026-05-25 04:10:26] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:10:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 484 ms
[2026-05-25 04:10:28] [INFO ] Added : 124 causal constraints over 25 iterations in 1979 ms. Result :sat
Minimization took 479 ms.
[2026-05-25 04:10:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:28] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:29] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-25 04:10:29] [INFO ] [Real]Added 32 Read/Feed constraints in 63 ms returned sat
[2026-05-25 04:10:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 04:10:29] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:29] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-25 04:10:29] [INFO ] [Nat]Added 32 Read/Feed constraints in 110 ms returned sat
[2026-05-25 04:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2026-05-25 04:10:29] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 9 ms.
[2026-05-25 04:10:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1891 ms
[2026-05-25 04:10:33] [INFO ] Added : 123 causal constraints over 26 iterations in 3524 ms. Result :sat
Minimization took 363 ms.
[2026-05-25 04:10:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:33] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:33] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-25 04:10:33] [INFO ] [Real]Added 32 Read/Feed constraints in 28 ms returned sat
[2026-05-25 04:10:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:33] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:33] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 04:10:33] [INFO ] [Nat]Added 32 Read/Feed constraints in 128 ms returned sat
[2026-05-25 04:10:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2026-05-25 04:10:33] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 14 ms.
[2026-05-25 04:10:34] [INFO ] Added : 41 causal constraints over 9 iterations in 333 ms. Result :sat
Minimization took 248 ms.
[2026-05-25 04:10:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:34] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:34] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-25 04:10:34] [INFO ] [Real]Added 32 Read/Feed constraints in 80 ms returned sat
[2026-05-25 04:10:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:34] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-25 04:10:34] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-05-25 04:10:35] [INFO ] [Nat]Added 32 Read/Feed constraints in 187 ms returned sat
[2026-05-25 04:10:35] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:10:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2026-05-25 04:10:36] [INFO ] Added : 80 causal constraints over 16 iterations in 1012 ms. Result :sat
Minimization took 279 ms.
[2026-05-25 04:10:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:36] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:36] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-25 04:10:36] [INFO ] [Real]Added 32 Read/Feed constraints in 115 ms returned sat
[2026-05-25 04:10:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:36] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:36] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2026-05-25 04:10:37] [INFO ] [Nat]Added 32 Read/Feed constraints in 119 ms returned sat
[2026-05-25 04:10:37] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:10:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3157 ms
[2026-05-25 04:10:42] [INFO ] Added : 143 causal constraints over 29 iterations in 5172 ms. Result :sat
Minimization took 414 ms.
[2026-05-25 04:10:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:42] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:42] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-25 04:10:42] [INFO ] [Real]Added 32 Read/Feed constraints in 154 ms returned sat
[2026-05-25 04:10:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:43] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned sat
[2026-05-25 04:10:43] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-25 04:10:43] [INFO ] [Nat]Added 32 Read/Feed constraints in 170 ms returned sat
[2026-05-25 04:10:48] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4790 ms
[2026-05-25 04:10:48] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 8 ms.
[2026-05-25 04:10:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 372 ms
[2026-05-25 04:10:52] [INFO ] Added : 172 causal constraints over 35 iterations in 4277 ms. Result :sat
Minimization took 936 ms.
[2026-05-25 04:10:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2026-05-25 04:10:53] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:53] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-25 04:10:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:10:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 04:10:53] [INFO ] [Nat]Absence check using 2 positive and 30 generalized place invariants in 6 ms returned sat
[2026-05-25 04:10:53] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-25 04:10:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 765 ms returned sat
[2026-05-25 04:10:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1678 ms
[2026-05-25 04:10:56] [INFO ] Computed and/alt/rep : 194/1082/194 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:10:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2026-05-25 04:10:58] [INFO ] Added : 134 causal constraints over 27 iterations in 2346 ms. Result :sat
Minimization took 412 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Support contains 13 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 228/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 225 /225 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 225/225 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 225 /225 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2026-05-25 04:11:19] [INFO ] Invariant cache hit.
[2026-05-25 04:11:19] [INFO ] Implicit Places using invariants in 390 ms returned [190, 195]
[2026-05-25 04:11:19] [INFO ] Actually due to overlaps returned [190]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 400 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 224/225 places, 228/228 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 227
Applied a total of 2 rules in 26 ms. Remains 223 /224 variables (removed 1) and now considering 227/228 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5425572280534517119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15396887307990388434.kers'
[2026-05-25 04:11:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5425572280534517119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15396887307990388434.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 221 cols 1153 entries
Finished phase 1 with 142 SingleSign rule and 50 generalized
[2026-05-25 04:11:19] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15396887307990388434.kers
Total runtime 2 ms.
[2026-05-25 04:11:20] [INFO ] Implicit Places using invariants in 332 ms returned []
[2026-05-25 04:11:20] [INFO ] Invariant cache hit.
[2026-05-25 04:11:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:11:21] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 223/225 places, 227/228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2495 ms. Remains : 223/225 places, 227/228 transitions.
findPositiveTsemiflow completed in 93288 ms - Found solution {28=1, 50=1, 53=2, 54=2, 69=1, 102=1, 118=2, 126=1, 186=1, 200=1, 203=1, 210=1} and attempted to minimize in 0 ms success -> {28=1, 50=1, 69=1, 102=1, 126=1, 186=1, 203=1, 210=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 208, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
[2026-05-25 04:13:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
RANDOM walk for 1000000 steps (144323 resets) in 855 ms. (1168 steps per ms)
BEST_FIRST walk for 13000007 steps (1187801 resets) in 7631 ms. (1703 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
[2026-05-25 04:13:13] [INFO ] Invariant cache hit.
[2026-05-25 04:13:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:13] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:13:13] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-25 04:13:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:13:13] [INFO ] [Real]Added 32 Read/Feed constraints in 117 ms returned sat
[2026-05-25 04:13:14] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 8 ms.
[2026-05-25 04:13:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:13:14] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:13:14] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2026-05-25 04:13:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 148 ms returned sat
[2026-05-25 04:13:14] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:13:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2026-05-25 04:13:16] [INFO ] Added : 108 causal constraints over 23 iterations in 2372 ms. Result :sat
Minimization took 306 ms.
[2026-05-25 04:13:17] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:13:17] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:13:17] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-25 04:13:17] [INFO ] [Real]Added 32 Read/Feed constraints in 149 ms returned sat
[2026-05-25 04:13:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:17] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:17] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2026-05-25 04:13:17] [INFO ] [Nat]Added 32 Read/Feed constraints in 236 ms returned sat
[2026-05-25 04:13:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 542 ms
[2026-05-25 04:13:18] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 9 ms.
[2026-05-25 04:13:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1054 ms
[2026-05-25 04:13:22] [INFO ] Added : 190 causal constraints over 39 iterations in 4511 ms. Result :sat
Minimization took 947 ms.
[2026-05-25 04:13:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:23] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:13:24] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-25 04:13:24] [INFO ] [Real]Added 32 Read/Feed constraints in 68 ms returned sat
[2026-05-25 04:13:24] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:13:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:13:24] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:13:24] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-05-25 04:13:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 139 ms returned sat
[2026-05-25 04:13:24] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:13:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2075 ms
[2026-05-25 04:13:28] [INFO ] Added : 179 causal constraints over 37 iterations in 4475 ms. Result :sat
Minimization took 355 ms.
[2026-05-25 04:13:29] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:13:29] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:29] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-25 04:13:29] [INFO ] [Real]Added 32 Read/Feed constraints in 92 ms returned sat
[2026-05-25 04:13:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:29] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:29] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-25 04:13:29] [INFO ] [Nat]Added 32 Read/Feed constraints in 261 ms returned sat
[2026-05-25 04:13:29] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:13:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 364 ms
[2026-05-25 04:13:31] [INFO ] Added : 118 causal constraints over 24 iterations in 1885 ms. Result :sat
Minimization took 268 ms.
[2026-05-25 04:13:32] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:13:32] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:32] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2026-05-25 04:13:32] [INFO ] [Real]Added 32 Read/Feed constraints in 91 ms returned sat
[2026-05-25 04:13:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:13:32] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:13:32] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2026-05-25 04:13:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 150 ms returned sat
[2026-05-25 04:13:32] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:13:35] [INFO ] Added : 147 causal constraints over 30 iterations in 2489 ms. Result :sat
Minimization took 348 ms.
[2026-05-25 04:13:35] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:35] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:35] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-25 04:13:35] [INFO ] [Real]Added 32 Read/Feed constraints in 69 ms returned sat
[2026-05-25 04:13:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:35] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:35] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-25 04:13:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 165 ms returned sat
[2026-05-25 04:13:36] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:13:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1432 ms
[2026-05-25 04:13:40] [INFO ] Added : 186 causal constraints over 38 iterations in 4753 ms. Result :sat
Minimization took 765 ms.
[2026-05-25 04:13:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:41] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:41] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2026-05-25 04:13:41] [INFO ] [Real]Added 32 Read/Feed constraints in 100 ms returned sat
[2026-05-25 04:13:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:42] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:42] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-25 04:13:42] [INFO ] [Nat]Added 32 Read/Feed constraints in 219 ms returned sat
[2026-05-25 04:13:42] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:13:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2026-05-25 04:13:43] [INFO ] Added : 112 causal constraints over 23 iterations in 1622 ms. Result :sat
Minimization took 501 ms.
[2026-05-25 04:13:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:13:44] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:13:44] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 04:13:44] [INFO ] [Real]Added 32 Read/Feed constraints in 110 ms returned sat
[2026-05-25 04:13:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:44] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:44] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 04:13:44] [INFO ] [Nat]Added 32 Read/Feed constraints in 138 ms returned sat
[2026-05-25 04:13:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2026-05-25 04:13:45] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:13:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2026-05-25 04:13:46] [INFO ] Added : 77 causal constraints over 16 iterations in 1083 ms. Result :sat
Minimization took 231 ms.
[2026-05-25 04:13:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:46] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:13:46] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-25 04:13:46] [INFO ] [Real]Added 32 Read/Feed constraints in 23 ms returned sat
[2026-05-25 04:13:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:46] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:46] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-25 04:13:46] [INFO ] [Nat]Added 32 Read/Feed constraints in 112 ms returned sat
[2026-05-25 04:13:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2026-05-25 04:13:47] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 15 ms.
[2026-05-25 04:13:47] [INFO ] Added : 40 causal constraints over 8 iterations in 426 ms. Result :sat
Minimization took 200 ms.
[2026-05-25 04:13:47] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:13:47] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:47] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-25 04:13:47] [INFO ] [Real]Added 32 Read/Feed constraints in 63 ms returned sat
[2026-05-25 04:13:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:47] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:48] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-25 04:13:48] [INFO ] [Nat]Added 32 Read/Feed constraints in 112 ms returned sat
[2026-05-25 04:13:48] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:13:56] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7428 ms
[2026-05-25 04:13:56] [INFO ] Added : 97 causal constraints over 21 iterations in 8740 ms. Result :sat
Minimization took 497 ms.
[2026-05-25 04:13:57] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:57] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:57] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2026-05-25 04:13:57] [INFO ] [Real]Added 32 Read/Feed constraints in 76 ms returned sat
[2026-05-25 04:13:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:13:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:13:57] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:13:57] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2026-05-25 04:13:58] [INFO ] [Nat]Added 32 Read/Feed constraints in 133 ms returned sat
[2026-05-25 04:13:58] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:14:04] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3295 ms
[2026-05-25 04:14:04] [INFO ] Added : 141 causal constraints over 29 iterations in 6278 ms. Result :sat
Minimization took 369 ms.
[2026-05-25 04:14:04] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:14:04] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:14:04] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2026-05-25 04:14:05] [INFO ] [Real]Added 32 Read/Feed constraints in 126 ms returned sat
[2026-05-25 04:14:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:14:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:14:05] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:14:05] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-05-25 04:14:05] [INFO ] [Nat]Added 32 Read/Feed constraints in 422 ms returned sat
[2026-05-25 04:14:14] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8737 ms
[2026-05-25 04:14:14] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:14:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2026-05-25 04:14:16] [INFO ] Added : 135 causal constraints over 27 iterations in 2195 ms. Result :sat
Minimization took 443 ms.
[2026-05-25 04:14:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:14:17] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:14:17] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2026-05-25 04:14:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:14:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:14:17] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:14:17] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2026-05-25 04:14:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 653 ms returned sat
[2026-05-25 04:14:20] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2283 ms
[2026-05-25 04:14:20] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2026-05-25 04:14:24] [INFO ] Added : 160 causal constraints over 33 iterations in 4387 ms. Result :sat
Minimization took 571 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 7 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 223/223 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 11 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 04:15:05] [INFO ] Invariant cache hit.
[2026-05-25 04:15:05] [INFO ] Implicit Places using invariants in 396 ms returned []
[2026-05-25 04:15:05] [INFO ] Invariant cache hit.
[2026-05-25 04:15:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:15:07] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
[2026-05-25 04:15:07] [INFO ] Redundant transitions in 15 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 04:15:07] [INFO ] Invariant cache hit.
[2026-05-25 04:15:07] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 227/450 variables, 223/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 325 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/450 variables, 223/321 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 32/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 226/579 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 583 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62386 ms. Remains : 223/223 places, 227/227 transitions.
findPositiveTsemiflow completed in 94083 ms - Found solution {28=1, 50=1, 53=2, 54=2, 69=1, 102=1, 118=2, 126=1, 186=1, 200=1, 203=1, 210=1} and attempted to minimize in 0 ms success -> {28=1, 50=1, 69=1, 102=1, 126=1, 186=1, 203=1, 210=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 177, +inf]
RANDOM walk for 40000 steps (5708 resets) in 831 ms. (48 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (373 resets) in 76 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (371 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (349 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (369 resets) in 63 ms. (62 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (342 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (376 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (358 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (367 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (357 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (383 resets) in 60 ms. (65 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (371 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (367 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (364 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (348 resets) in 60 ms. (65 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (352 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (377 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (373 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (366 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (377 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (366 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (364 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (379 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (387 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (381 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
[2026-05-25 04:17:52] [INFO ] Flatten gal took : 113 ms
[2026-05-25 04:17:52] [INFO ] Flatten gal took : 54 ms
[2026-05-25 04:17:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4576220487927018984.gal : 42 ms
[2026-05-25 04:17:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4389463779054937981.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4576220487927018984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4389463779054937981.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4389463779054937981.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :40 after 117
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :117 after 230
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :230 after 487
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :487 after 1092
Invariant property MIN8 does not hold.
SDD proceeding with computation,23 properties remain. new max is 2048
SDD size :1092 after 9071
SDD proceeding with computation,23 properties remain. new max is 4096
SDD size :9071 after 19971
SDD proceeding with computation,23 properties remain. new max is 8192
SDD size :19971 after 35060
SDD proceeding with computation,23 properties remain. new max is 16384
SDD size :35060 after 69163
SDD proceeding with computation,23 properties remain. new max is 32768
SDD size :69163 after 163863
Interrupted probabilistic random walk after 208818 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :1 out of 24
Probabilistic random walk after 208818 steps, saw 104430 distinct states, run finished after 3005 ms. (steps per millisecond=69 ) properties seen :1
[2026-05-25 04:17:55] [INFO ] Invariant cache hit.
[2026-05-25 04:17:55] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem MAX11 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 20/216 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/218 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 65536
SDD size :163863 after 349856
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 227/445 variables, 218/247 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 32/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/450 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 286 constraints, problems are : Problem set: 1 solved, 22 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 17/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 131072
SDD size :349856 after 736084
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 13/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 20/216 variables, 9/73 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 9/82 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 2/218 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 1/87 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 218/450 variables, and 87 constraints, problems are : Problem set: 1 solved, 22 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/223 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6424ms problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 221 transition count 226
Applied a total of 4 rules in 10 ms. Remains 221 /223 variables (removed 2) and now considering 226/227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 221/223 places, 226/227 transitions.
RANDOM walk for 40000 steps (5759 resets) in 563 ms. (70 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (367 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (380 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (378 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (378 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (363 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (351 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (362 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (352 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (372 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (363 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (377 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (373 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (348 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (382 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (383 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (362 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (358 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (366 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (372 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (373 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (363 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (374 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 187190 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 22
Probabilistic random walk after 187190 steps, saw 93616 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3988041132235469988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11417627682897072656.kers'
[2026-05-25 04:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3988041132235469988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11417627682897072656.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 219 cols 1158 entries
Finished phase 1 with 151 SingleSign rule and 39 generalized
[2026-05-25 04:18:05] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11417627682897072656.kers
Total runtime 3 ms.
[2026-05-25 04:18:05] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 24/210 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 6/216 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 226/442 variables, 216/245 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 262144
SDD size :736084 after 1.27357e+08
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 24/210 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/216 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 226/442 variables, 216/464 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 524288
SDD size :1.27357e+08 after 4.97423e+08
At refinement iteration 23 (INCLUDED_ONLY) 0/442 variables, 35/499 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/442 variables, 22/521 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/442 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/442 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/442 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/442 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/442 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:18:42] [INFO ] Flatten gal took : 23 ms
[2026-05-25 04:18:42] [INFO ] Applying decomposition
[2026-05-25 04:18:42] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11019451028592621808.txt' '-o' '/tmp/graph11019451028592621808.bin' '-w' '/tmp/graph11019451028592621808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11019451028592621808.bin' '-l' '-1' '-v' '-w' '/tmp/graph11019451028592621808.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:18:42] [INFO ] Decomposing Gal with order
[2026-05-25 04:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 30 (OVERLAPS) 5/447 variables, 5/539 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2026-05-25 04:18:42] [INFO ] Removed a total of 109 redundant transitions.
[2026-05-25 04:18:42] [INFO ] Flatten gal took : 85 ms
[2026-05-25 04:18:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 14 ms.
[2026-05-25 04:18:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality157967199027374054.gal : 7 ms
[2026-05-25 04:18:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3525174431854987068.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality157967199027374054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3525174431854987068.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality3525174431854987068.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :14 after 40
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :40 after 61
At refinement iteration 31 (INCLUDED_ONLY) 0/447 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :61 after 1163
At refinement iteration 32 (INCLUDED_ONLY) 0/447 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :1163 after 29207
At refinement iteration 33 (INCLUDED_ONLY) 0/447 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 34 (OVERLAPS) 0/447 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 543 constraints, problems are : Problem set: 0 solved, 22 unsolved in 40141 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 232/232 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41535ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 31027 ms.
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 9 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 221/221 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 04:19:17] [INFO ] Invariant cache hit.
[2026-05-25 04:19:18] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-25 04:19:18] [INFO ] Invariant cache hit.
[2026-05-25 04:19:18] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:19:20] [INFO ] Implicit Places using invariants and state equation in 1949 ms returned []
Implicit Place search using SMT with State Equation took 2268 ms to find 0 implicit places.
[2026-05-25 04:19:20] [INFO ] Redundant transitions in 20 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-25 04:19:20] [INFO ] Invariant cache hit.
[2026-05-25 04:19:20] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :29207 after 221260
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Detected timeout of ITS tools.
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 225 unsolved in 18827 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 225/512 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 552 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48912ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 48913ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51217 ms. Remains : 221/221 places, 226/226 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 176, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17208224304816988573.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12047234872814259990.kers'
[2026-05-25 04:20:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17208224304816988573.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12047234872814259990.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 227 rows 221 cols 1153 entries
Finished phase 1 with 142 SingleSign rule and 50 generalized
[2026-05-25 04:20:09] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12047234872814259990.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 176, +inf]
RANDOM walk for 1000000 steps (144445 resets) in 900 ms. (1109 steps per ms)
BEST_FIRST walk for 13000005 steps (1188254 resets) in 8062 ms. (1612 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 176, +inf]
[2026-05-25 04:20:18] [INFO ] Invariant cache hit.
[2026-05-25 04:20:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:20:18] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:20:18] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2026-05-25 04:20:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:20:18] [INFO ] [Real]Added 32 Read/Feed constraints in 142 ms returned sat
[2026-05-25 04:20:18] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 9 ms.
[2026-05-25 04:20:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:20:18] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2026-05-25 04:20:18] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-25 04:20:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 163 ms returned sat
[2026-05-25 04:20:18] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:20:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 380 ms
[2026-05-25 04:20:21] [INFO ] Added : 108 causal constraints over 23 iterations in 2355 ms. Result :sat
Minimization took 326 ms.
[2026-05-25 04:20:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:21] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:21] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-25 04:20:21] [INFO ] [Real]Added 32 Read/Feed constraints in 149 ms returned sat
[2026-05-25 04:20:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:21] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-25 04:20:21] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2026-05-25 04:20:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 236 ms returned sat
[2026-05-25 04:20:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 575 ms
[2026-05-25 04:20:22] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 15 ms.
[2026-05-25 04:20:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1096 ms
[2026-05-25 04:20:27] [INFO ] Added : 190 causal constraints over 39 iterations in 4655 ms. Result :sat
Minimization took 912 ms.
[2026-05-25 04:20:28] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:28] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:28] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-25 04:20:28] [INFO ] [Real]Added 32 Read/Feed constraints in 69 ms returned sat
[2026-05-25 04:20:28] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:20:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:20:28] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 12 ms returned sat
[2026-05-25 04:20:28] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-25 04:20:28] [INFO ] [Nat]Added 32 Read/Feed constraints in 143 ms returned sat
[2026-05-25 04:20:28] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:20:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2055 ms
[2026-05-25 04:20:33] [INFO ] Added : 179 causal constraints over 37 iterations in 4515 ms. Result :sat
Minimization took 365 ms.
[2026-05-25 04:20:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:20:33] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:33] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2026-05-25 04:20:34] [INFO ] [Real]Added 32 Read/Feed constraints in 96 ms returned sat
[2026-05-25 04:20:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-25 04:20:34] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:34] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-25 04:20:34] [INFO ] [Nat]Added 32 Read/Feed constraints in 268 ms returned sat
[2026-05-25 04:20:34] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2026-05-25 04:20:36] [INFO ] Added : 118 causal constraints over 24 iterations in 2002 ms. Result :sat
Minimization took 291 ms.
[2026-05-25 04:20:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:36] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:37] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2026-05-25 04:20:37] [INFO ] [Real]Added 32 Read/Feed constraints in 92 ms returned sat
[2026-05-25 04:20:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:37] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:37] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-25 04:20:37] [INFO ] [Nat]Added 32 Read/Feed constraints in 156 ms returned sat
[2026-05-25 04:20:37] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:20:40] [INFO ] Added : 147 causal constraints over 30 iterations in 2649 ms. Result :sat
Minimization took 324 ms.
[2026-05-25 04:20:40] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:40] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:40] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-25 04:20:40] [INFO ] [Real]Added 32 Read/Feed constraints in 72 ms returned sat
[2026-05-25 04:20:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:40] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:40] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2026-05-25 04:20:41] [INFO ] [Nat]Added 32 Read/Feed constraints in 172 ms returned sat
[2026-05-25 04:20:41] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:20:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1501 ms
[2026-05-25 04:20:46] [INFO ] Added : 186 causal constraints over 38 iterations in 5002 ms. Result :sat
Minimization took 714 ms.
[2026-05-25 04:20:46] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:46] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:46] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-25 04:20:47] [INFO ] [Real]Added 32 Read/Feed constraints in 96 ms returned sat
[2026-05-25 04:20:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:47] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:47] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2026-05-25 04:20:47] [INFO ] [Nat]Added 32 Read/Feed constraints in 227 ms returned sat
[2026-05-25 04:20:47] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:20:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2026-05-25 04:20:49] [INFO ] Added : 112 causal constraints over 23 iterations in 1714 ms. Result :sat
Minimization took 520 ms.
[2026-05-25 04:20:49] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:49] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:49] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2026-05-25 04:20:49] [INFO ] [Real]Added 32 Read/Feed constraints in 111 ms returned sat
[2026-05-25 04:20:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:20:50] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:50] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2026-05-25 04:20:50] [INFO ] [Nat]Added 32 Read/Feed constraints in 142 ms returned sat
[2026-05-25 04:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2026-05-25 04:20:50] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:20:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2026-05-25 04:20:51] [INFO ] Added : 77 causal constraints over 16 iterations in 1095 ms. Result :sat
Minimization took 238 ms.
[2026-05-25 04:20:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:20:51] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:20:51] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2026-05-25 04:20:51] [INFO ] [Real]Added 32 Read/Feed constraints in 83 ms returned sat
[2026-05-25 04:20:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:20:52] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:20:52] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-25 04:20:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 115 ms returned sat
[2026-05-25 04:20:52] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:20:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 728 ms
[2026-05-25 04:20:53] [INFO ] Added : 63 causal constraints over 13 iterations in 1380 ms. Result :sat
Minimization took 221 ms.
[2026-05-25 04:20:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:20:53] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:20:54] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-25 04:20:54] [INFO ] [Real]Added 32 Read/Feed constraints in 68 ms returned sat
[2026-05-25 04:20:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:20:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:20:54] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:20:54] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-25 04:20:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 110 ms returned sat
[2026-05-25 04:20:54] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:21:02] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7532 ms
[2026-05-25 04:21:03] [INFO ] Added : 97 causal constraints over 21 iterations in 8774 ms. Result :sat
Minimization took 478 ms.
[2026-05-25 04:21:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:21:03] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:21:03] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2026-05-25 04:21:03] [INFO ] [Real]Added 32 Read/Feed constraints in 77 ms returned sat
[2026-05-25 04:21:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:21:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:21:03] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2026-05-25 04:21:04] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-25 04:21:04] [INFO ] [Nat]Added 32 Read/Feed constraints in 153 ms returned sat
[2026-05-25 04:21:04] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:21:10] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3170 ms
[2026-05-25 04:21:10] [INFO ] Added : 141 causal constraints over 29 iterations in 6108 ms. Result :sat
Minimization took 355 ms.
[2026-05-25 04:21:10] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:21:10] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:21:10] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-25 04:21:11] [INFO ] [Real]Added 32 Read/Feed constraints in 120 ms returned sat
[2026-05-25 04:21:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:21:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:21:11] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:21:11] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-25 04:21:11] [INFO ] [Nat]Added 32 Read/Feed constraints in 428 ms returned sat
[2026-05-25 04:21:20] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8826 ms
[2026-05-25 04:21:20] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2026-05-25 04:21:22] [INFO ] Added : 135 causal constraints over 27 iterations in 2269 ms. Result :sat
Minimization took 467 ms.
[2026-05-25 04:21:23] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:21:23] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2026-05-25 04:21:23] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2026-05-25 04:21:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:21:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:21:23] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 14 ms returned sat
[2026-05-25 04:21:23] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2026-05-25 04:21:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 640 ms returned sat
[2026-05-25 04:21:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2328 ms
[2026-05-25 04:21:26] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2026-05-25 04:21:31] [INFO ] Added : 160 causal constraints over 33 iterations in 4405 ms. Result :sat
Minimization took 560 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 176, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 176, +inf]
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 223/223 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 04:22:09] [INFO ] Invariant cache hit.
[2026-05-25 04:22:09] [INFO ] Implicit Places using invariants in 346 ms returned []
[2026-05-25 04:22:09] [INFO ] Invariant cache hit.
[2026-05-25 04:22:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:22:11] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
[2026-05-25 04:22:11] [INFO ] Redundant transitions in 8 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 04:22:11] [INFO ] Invariant cache hit.
[2026-05-25 04:22:11] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 227/450 variables, 223/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 325 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/450 variables, 223/321 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 32/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 226/579 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 583 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62275 ms. Remains : 223/223 places, 227/227 transitions.
findPositiveTsemiflow completed in 94715 ms - Found solution {28=1, 50=1, 53=2, 54=2, 69=1, 102=1, 118=2, 126=1, 186=1, 200=1, 203=1, 210=1} and attempted to minimize in 0 ms success -> {28=1, 50=1, 69=1, 102=1, 126=1, 186=1, 203=1, 210=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 176, +inf]
[2026-05-25 04:24:56] [INFO ] Flatten gal took : 26 ms
[2026-05-25 04:24:56] [INFO ] Flatten gal took : 33 ms
[2026-05-25 04:24:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality574198787118342705.gal : 7 ms
[2026-05-25 04:24:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10808537937343868046.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality574198787118342705.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10808537937343868046.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality10808537937343868046.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :40 after 117
RANDOM walk for 40000 steps (5714 resets) in 478 ms. (83 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :117 after 230
BEST_FIRST walk for 4001 steps (367 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :230 after 487
BEST_FIRST walk for 4001 steps (348 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (349 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (374 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (360 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (359 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :487 after 1092
BEST_FIRST walk for 4001 steps (393 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (372 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (373 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (367 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (364 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
Invariant property MIN8 does not hold.
SDD proceeding with computation,23 properties remain. new max is 2048
SDD size :1092 after 9071
BEST_FIRST walk for 4002 steps (353 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (364 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (356 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (359 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (365 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (356 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 4096
SDD size :9071 after 19971
BEST_FIRST walk for 4001 steps (355 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (369 resets) in 61 ms. (64 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (371 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (353 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (355 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (347 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (363 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 8192
SDD size :19971 after 35060
SDD proceeding with computation,23 properties remain. new max is 16384
SDD size :35060 after 69163
SDD proceeding with computation,23 properties remain. new max is 32768
SDD size :69163 after 163863
SDD proceeding with computation,23 properties remain. new max is 65536
SDD size :163863 after 349856
Interrupted probabilistic random walk after 210725 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :1 out of 24
Probabilistic random walk after 210725 steps, saw 105380 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :1
[2026-05-25 04:24:59] [INFO ] Invariant cache hit.
[2026-05-25 04:24:59] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem MAX11 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 20/216 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/218 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 227/445 variables, 218/247 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 32/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/450 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 286 constraints, problems are : Problem set: 1 solved, 22 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 17/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 131072
SDD size :349856 after 736084
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 13/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 20/216 variables, 9/73 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 9/82 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 216/450 variables, and 85 constraints, problems are : Problem set: 1 solved, 22 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/223 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6364ms problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 221 transition count 226
Applied a total of 4 rules in 9 ms. Remains 221 /223 variables (removed 2) and now considering 226/227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 221/223 places, 226/227 transitions.
RANDOM walk for 40000 steps (5747 resets) in 275 ms. (144 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (356 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (364 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (354 resets) in 47 ms. (83 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (358 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (377 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (342 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (379 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (348 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (379 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (357 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (342 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (364 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (375 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (360 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (375 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (367 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (360 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (362 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (391 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (370 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (379 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (352 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 215684 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 22
Probabilistic random walk after 215684 steps, saw 107861 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8247939098934286125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4092050156055601448.kers'
[2026-05-25 04:25:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8247939098934286125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4092050156055601448.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 219 cols 1158 entries
Finished phase 1 with 151 SingleSign rule and 39 generalized
[2026-05-25 04:25:09] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4092050156055601448.kers
Total runtime 2 ms.
[2026-05-25 04:25:09] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 24/210 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 6/216 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 226/442 variables, 216/245 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1368 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 262144
SDD size :736084 after 1.27357e+08
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 24/210 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/216 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (OVERLAPS) 226/442 variables, 216/445 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/442 variables, 35/480 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 524288
At refinement iteration 23 (INCLUDED_ONLY) 0/442 variables, 22/502 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD size :1.27357e+08 after 4.97423e+08
At refinement iteration 24 (INCLUDED_ONLY) 0/442 variables, 16/518 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/442 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:25:46] [INFO ] Flatten gal took : 15 ms
[2026-05-25 04:25:46] [INFO ] Applying decomposition
[2026-05-25 04:25:46] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13193287632428835176.txt' '-o' '/tmp/graph13193287632428835176.bin' '-w' '/tmp/graph13193287632428835176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13193287632428835176.bin' '-l' '-1' '-v' '-w' '/tmp/graph13193287632428835176.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:25:46] [INFO ] Decomposing Gal with order
[2026-05-25 04:25:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:25:46] [INFO ] Removed a total of 98 redundant transitions.
[2026-05-25 04:25:46] [INFO ] Flatten gal took : 48 ms
[2026-05-25 04:25:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 11 ms.
[2026-05-25 04:25:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9099877654500822470.gal : 8 ms
[2026-05-25 04:25:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6410747615792167081.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9099877654500822470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6410747615792167081.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6410747615792167081.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :8 after 20
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :20 after 61
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :61 after 86
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :86 after 288
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :288 after 313
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :313 after 549
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :549 after 1268
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :1268 after 4308
At refinement iteration 26 (INCLUDED_ONLY) 0/442 variables, 8/527 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :4308 after 48205
At refinement iteration 27 (INCLUDED_ONLY) 0/442 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :48205 after 136151
At refinement iteration 28 (INCLUDED_ONLY) 0/442 variables, 20/548 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/442 variables, 3/551 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/442 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/447 variables, and 552 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 216/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 230/230 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 46391ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 6 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 221/221 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 04:25:56] [INFO ] Invariant cache hit.
[2026-05-25 04:25:56] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-25 04:25:56] [INFO ] Invariant cache hit.
[2026-05-25 04:25:56] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:25:58] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2340 ms to find 0 implicit places.
[2026-05-25 04:25:58] [INFO ] Redundant transitions in 10 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-25 04:25:58] [INFO ] Invariant cache hit.
[2026-05-25 04:25:58] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :136151 after 314304
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 225 unsolved in 18372 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 225/512 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Detected timeout of ITS tools.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 552 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48455ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 48456ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50828 ms. Remains : 221/221 places, 226/226 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 175, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12266601055092939358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6606743810131484592.kers'
[2026-05-25 04:26:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12266601055092939358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6606743810131484592.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 221 cols 1153 entries
Finished phase 1 with 142 SingleSign rule and 50 generalized
[2026-05-25 04:26:46] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6606743810131484592.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 175, +inf]
RANDOM walk for 1000000 steps (144220 resets) in 893 ms. (1118 steps per ms)
BEST_FIRST walk for 13000006 steps (1189741 resets) in 7958 ms. (1633 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 175, +inf]
[2026-05-25 04:26:55] [INFO ] Invariant cache hit.
[2026-05-25 04:26:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:26:55] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:26:55] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-25 04:26:55] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:26:56] [INFO ] [Real]Added 32 Read/Feed constraints in 118 ms returned sat
[2026-05-25 04:26:56] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:26:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:26:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:26:56] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:26:56] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2026-05-25 04:26:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 148 ms returned sat
[2026-05-25 04:26:56] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 15 ms.
[2026-05-25 04:26:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2026-05-25 04:26:58] [INFO ] Added : 108 causal constraints over 23 iterations in 2393 ms. Result :sat
Minimization took 312 ms.
[2026-05-25 04:26:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:26:59] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:26:59] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2026-05-25 04:26:59] [INFO ] [Real]Added 32 Read/Feed constraints in 152 ms returned sat
[2026-05-25 04:26:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:26:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:26:59] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:26:59] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2026-05-25 04:26:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 236 ms returned sat
[2026-05-25 04:27:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 581 ms
[2026-05-25 04:27:00] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:27:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1102 ms
[2026-05-25 04:27:05] [INFO ] Added : 190 causal constraints over 39 iterations in 4627 ms. Result :sat
Minimization took 918 ms.
[2026-05-25 04:27:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:06] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:06] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-25 04:27:06] [INFO ] [Real]Added 32 Read/Feed constraints in 71 ms returned sat
[2026-05-25 04:27:06] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:27:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:06] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:06] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-25 04:27:06] [INFO ] [Nat]Added 32 Read/Feed constraints in 154 ms returned sat
[2026-05-25 04:27:06] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:27:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2040 ms
[2026-05-25 04:27:11] [INFO ] Added : 179 causal constraints over 37 iterations in 4541 ms. Result :sat
Minimization took 366 ms.
[2026-05-25 04:27:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:11] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:11] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-25 04:27:11] [INFO ] [Real]Added 32 Read/Feed constraints in 95 ms returned sat
[2026-05-25 04:27:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:12] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 11 ms returned sat
[2026-05-25 04:27:12] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2026-05-25 04:27:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 270 ms returned sat
[2026-05-25 04:27:12] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 14 ms.
[2026-05-25 04:27:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2026-05-25 04:27:14] [INFO ] Added : 118 causal constraints over 24 iterations in 1998 ms. Result :sat
Minimization took 294 ms.
[2026-05-25 04:27:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:14] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:27:14] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-25 04:27:14] [INFO ] [Real]Added 32 Read/Feed constraints in 93 ms returned sat
[2026-05-25 04:27:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:15] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:15] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-25 04:27:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 155 ms returned sat
[2026-05-25 04:27:15] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:27:17] [INFO ] Added : 147 causal constraints over 30 iterations in 2673 ms. Result :sat
Minimization took 330 ms.
[2026-05-25 04:27:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:18] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:18] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-25 04:27:18] [INFO ] [Real]Added 32 Read/Feed constraints in 71 ms returned sat
[2026-05-25 04:27:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:18] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:18] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-25 04:27:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 172 ms returned sat
[2026-05-25 04:27:18] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 9 ms.
[2026-05-25 04:27:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1519 ms
[2026-05-25 04:27:23] [INFO ] Added : 186 causal constraints over 38 iterations in 5033 ms. Result :sat
Minimization took 706 ms.
[2026-05-25 04:27:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:24] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:24] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2026-05-25 04:27:24] [INFO ] [Real]Added 32 Read/Feed constraints in 97 ms returned sat
[2026-05-25 04:27:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:25] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:25] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-25 04:27:25] [INFO ] [Nat]Added 32 Read/Feed constraints in 228 ms returned sat
[2026-05-25 04:27:25] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:27:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2026-05-25 04:27:27] [INFO ] Added : 112 causal constraints over 23 iterations in 1697 ms. Result :sat
Minimization took 529 ms.
[2026-05-25 04:27:27] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:27] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:27] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 04:27:27] [INFO ] [Real]Added 32 Read/Feed constraints in 115 ms returned sat
[2026-05-25 04:27:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:27] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:27] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2026-05-25 04:27:28] [INFO ] [Nat]Added 32 Read/Feed constraints in 142 ms returned sat
[2026-05-25 04:27:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2026-05-25 04:27:28] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2026-05-25 04:27:29] [INFO ] Added : 77 causal constraints over 16 iterations in 1089 ms. Result :sat
Minimization took 240 ms.
[2026-05-25 04:27:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:29] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:29] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2026-05-25 04:27:29] [INFO ] [Real]Added 32 Read/Feed constraints in 219 ms returned sat
[2026-05-25 04:27:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:30] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:27:30] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-25 04:27:30] [INFO ] [Nat]Added 32 Read/Feed constraints in 179 ms returned sat
[2026-05-25 04:27:30] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:27:30] [INFO ] Added : 45 causal constraints over 9 iterations in 353 ms. Result :sat
Minimization took 204 ms.
[2026-05-25 04:27:30] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:30] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:31] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2026-05-25 04:27:31] [INFO ] [Real]Added 32 Read/Feed constraints in 66 ms returned sat
[2026-05-25 04:27:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:31] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:27:31] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-25 04:27:31] [INFO ] [Nat]Added 32 Read/Feed constraints in 110 ms returned sat
[2026-05-25 04:27:31] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:27:40] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7535 ms
[2026-05-25 04:27:40] [INFO ] Added : 97 causal constraints over 21 iterations in 8817 ms. Result :sat
Minimization took 484 ms.
[2026-05-25 04:27:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:40] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2026-05-25 04:27:40] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-25 04:27:40] [INFO ] [Real]Added 32 Read/Feed constraints in 75 ms returned sat
[2026-05-25 04:27:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:27:41] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-25 04:27:41] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-25 04:27:41] [INFO ] [Nat]Added 32 Read/Feed constraints in 143 ms returned sat
[2026-05-25 04:27:41] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:27:47] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3182 ms
[2026-05-25 04:27:47] [INFO ] Added : 141 causal constraints over 29 iterations in 6154 ms. Result :sat
Minimization took 364 ms.
[2026-05-25 04:27:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:47] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:48] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2026-05-25 04:27:48] [INFO ] [Real]Added 32 Read/Feed constraints in 121 ms returned sat
[2026-05-25 04:27:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:27:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:27:48] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:27:48] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-25 04:27:48] [INFO ] [Nat]Added 32 Read/Feed constraints in 419 ms returned sat
[2026-05-25 04:27:57] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8666 ms
[2026-05-25 04:27:57] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2026-05-25 04:27:59] [INFO ] Added : 135 causal constraints over 27 iterations in 2335 ms. Result :sat
Minimization took 482 ms.
[2026-05-25 04:28:00] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:28:00] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:28:00] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2026-05-25 04:28:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:28:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:28:00] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:28:00] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2026-05-25 04:28:01] [INFO ] [Nat]Added 32 Read/Feed constraints in 651 ms returned sat
[2026-05-25 04:28:03] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2240 ms
[2026-05-25 04:28:03] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:28:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2026-05-25 04:28:08] [INFO ] Added : 160 causal constraints over 33 iterations in 4500 ms. Result :sat
Minimization took 585 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 175, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 175, +inf]
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 7 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 223/223 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 04:28:49] [INFO ] Invariant cache hit.
[2026-05-25 04:28:50] [INFO ] Implicit Places using invariants in 358 ms returned []
[2026-05-25 04:28:50] [INFO ] Invariant cache hit.
[2026-05-25 04:28:50] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:28:52] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2145 ms to find 0 implicit places.
[2026-05-25 04:28:52] [INFO ] Redundant transitions in 4 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 04:28:52] [INFO ] Invariant cache hit.
[2026-05-25 04:28:52] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 227/450 variables, 223/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 325 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/450 variables, 223/321 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 32/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 226/579 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 583 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62251 ms. Remains : 223/223 places, 227/227 transitions.
findPositiveTsemiflow completed in 93670 ms - Found solution {28=1, 50=1, 53=2, 54=2, 69=1, 102=1, 118=2, 126=1, 186=1, 200=1, 203=1, 210=1} and attempted to minimize in 1 ms success -> {28=1, 50=1, 69=1, 102=1, 126=1, 186=1, 203=1, 210=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 175, +inf]
[2026-05-25 04:31:35] [INFO ] Flatten gal took : 14 ms
[2026-05-25 04:31:35] [INFO ] Flatten gal took : 13 ms
[2026-05-25 04:31:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14937799489055460622.gal : 3 ms
[2026-05-25 04:31:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17525561210281729627.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14937799489055460622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17525561210281729627.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17525561210281729627.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :40 after 117
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :117 after 230
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :230 after 487
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :487 after 1092
RANDOM walk for 40000 steps (5743 resets) in 504 ms. (79 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (373 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (365 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
Invariant property MIN8 does not hold.
SDD proceeding with computation,23 properties remain. new max is 2048
SDD size :1092 after 9071
BEST_FIRST walk for 4000 steps (356 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (360 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (367 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (361 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (370 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (358 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 4096
BEST_FIRST walk for 4002 steps (356 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
SDD size :9071 after 19971
BEST_FIRST walk for 4002 steps (365 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (367 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (365 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (371 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (360 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (365 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (377 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (369 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (359 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (363 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (365 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (388 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (360 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (374 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 8192
BEST_FIRST walk for 4002 steps (365 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
SDD size :19971 after 35060
SDD proceeding with computation,23 properties remain. new max is 16384
SDD size :35060 after 69163
SDD proceeding with computation,23 properties remain. new max is 32768
SDD size :69163 after 163863
SDD proceeding with computation,23 properties remain. new max is 65536
SDD size :163863 after 349856
Interrupted probabilistic random walk after 213334 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :1 out of 24
Probabilistic random walk after 213334 steps, saw 106686 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :1
[2026-05-25 04:31:39] [INFO ] Invariant cache hit.
[2026-05-25 04:31:39] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem MAX11 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 20/216 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/218 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 227/445 variables, 218/247 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 32/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/450 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 286 constraints, problems are : Problem set: 1 solved, 22 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 17/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 131072
SDD size :349856 after 736084
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 13/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 20/216 variables, 9/73 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 9/82 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 2/218 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 218/450 variables, and 87 constraints, problems are : Problem set: 1 solved, 22 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/223 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6311ms problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 221 transition count 226
Applied a total of 4 rules in 8 ms. Remains 221 /223 variables (removed 2) and now considering 226/227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 221/223 places, 226/227 transitions.
RANDOM walk for 40000 steps (5822 resets) in 245 ms. (162 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (350 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (364 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (353 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (360 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (379 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (359 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (353 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (361 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (348 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (386 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (365 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (368 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (371 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (386 resets) in 28 ms. (137 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (356 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (348 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (366 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (364 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (369 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (367 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (368 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (366 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 182483 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 22
Probabilistic random walk after 182483 steps, saw 91261 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-571058762238234160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13503583536038641071.kers'
[2026-05-25 04:31:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-571058762238234160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13503583536038641071.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 219 cols 1158 entries
Finished phase 1 with 151 SingleSign rule and 39 generalized
[2026-05-25 04:31:48] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13503583536038641071.kers
Total runtime 2 ms.
[2026-05-25 04:31:48] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 24/210 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 6/216 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 226/442 variables, 216/245 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 262144
SDD size :736084 after 1.27357e+08
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 24/210 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/216 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 524288
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD size :1.27357e+08 after 4.97423e+08
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/216 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:32:26] [INFO ] Flatten gal took : 12 ms
[2026-05-25 04:32:26] [INFO ] Applying decomposition
[2026-05-25 04:32:26] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5312088972191326625.txt' '-o' '/tmp/graph5312088972191326625.bin' '-w' '/tmp/graph5312088972191326625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5312088972191326625.bin' '-l' '-1' '-v' '-w' '/tmp/graph5312088972191326625.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:32:26] [INFO ] Decomposing Gal with order
[2026-05-25 04:32:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:32:26] [INFO ] Removed a total of 106 redundant transitions.
[2026-05-25 04:32:26] [INFO ] Flatten gal took : 25 ms
[2026-05-25 04:32:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 7 ms.
[2026-05-25 04:32:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14946507679992361935.gal : 3 ms
[2026-05-25 04:32:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13131699743880897491.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14946507679992361935.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13131699743880897491.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13131699743880897491.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :10 after 27
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :27 after 58
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :58 after 204
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :204 after 1195
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :1195 after 132922
At refinement iteration 23 (INCLUDED_ONLY) 0/216 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/216 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 25 (OVERLAPS) 226/442 variables, 216/526 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/442 variables, 35/561 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/442 variables, 22/583 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/442 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/442 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/442 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/447 variables, and 590 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 216/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 288/288 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46533ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 11 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 221/221 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 7 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 04:32:35] [INFO ] Invariant cache hit.
[2026-05-25 04:32:35] [INFO ] Implicit Places using invariants in 344 ms returned []
[2026-05-25 04:32:35] [INFO ] Invariant cache hit.
[2026-05-25 04:32:36] [INFO ] State equation strengthened by 35 read => feed constraints.
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :132922 after 447767
[2026-05-25 04:32:37] [INFO ] Implicit Places using invariants and state equation in 1914 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2026-05-25 04:32:37] [INFO ] Redundant transitions in 2 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-25 04:32:37] [INFO ] Invariant cache hit.
[2026-05-25 04:32:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 225 unsolved in 18981 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :447767 after 1.30393e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 225/512 constraints. Problems are: Problem set: 0 solved, 225 unsolved
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :1.30393e+06 after 3.89423e+07
Detected timeout of ITS tools.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 552 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49035ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 49036ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51313 ms. Remains : 221/221 places, 226/226 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 174, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12711617752053026132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1149733651428004725.kers'
[2026-05-25 04:33:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12711617752053026132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1149733651428004725.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 221 cols 1153 entries
Finished phase 1 with 142 SingleSign rule and 50 generalized
[2026-05-25 04:33:26] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1149733651428004725.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 174, +inf]
RANDOM walk for 1000000 steps (144422 resets) in 949 ms. (1052 steps per ms)
BEST_FIRST walk for 13000002 steps (1190161 resets) in 8377 ms. (1551 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 174, +inf]
[2026-05-25 04:33:36] [INFO ] Invariant cache hit.
[2026-05-25 04:33:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:36] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:33:36] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-25 04:33:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:33:36] [INFO ] [Real]Added 32 Read/Feed constraints in 117 ms returned sat
[2026-05-25 04:33:36] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:33:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:33:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:36] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:33:36] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-25 04:33:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 148 ms returned sat
[2026-05-25 04:33:36] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:33:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 371 ms
[2026-05-25 04:33:39] [INFO ] Added : 108 causal constraints over 23 iterations in 2318 ms. Result :sat
Minimization took 303 ms.
[2026-05-25 04:33:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:33:39] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:33:39] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-25 04:33:39] [INFO ] [Real]Added 32 Read/Feed constraints in 152 ms returned sat
[2026-05-25 04:33:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:33:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:39] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:33:40] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2026-05-25 04:33:40] [INFO ] [Nat]Added 32 Read/Feed constraints in 246 ms returned sat
[2026-05-25 04:33:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 518 ms
[2026-05-25 04:33:40] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 8 ms.
[2026-05-25 04:33:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1102 ms
[2026-05-25 04:33:45] [INFO ] Added : 190 causal constraints over 39 iterations in 4617 ms. Result :sat
Minimization took 899 ms.
[2026-05-25 04:33:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:46] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:33:46] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-25 04:33:46] [INFO ] [Real]Added 32 Read/Feed constraints in 71 ms returned sat
[2026-05-25 04:33:46] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:33:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:33:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:46] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:33:46] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2026-05-25 04:33:46] [INFO ] [Nat]Added 32 Read/Feed constraints in 140 ms returned sat
[2026-05-25 04:33:46] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:33:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2059 ms
[2026-05-25 04:33:51] [INFO ] Added : 179 causal constraints over 37 iterations in 4525 ms. Result :sat
Minimization took 362 ms.
[2026-05-25 04:33:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:51] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:33:52] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-25 04:33:52] [INFO ] [Real]Added 32 Read/Feed constraints in 94 ms returned sat
[2026-05-25 04:33:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:33:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:52] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:33:52] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-25 04:33:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 267 ms returned sat
[2026-05-25 04:33:52] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 9 ms.
[2026-05-25 04:33:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 406 ms
[2026-05-25 04:33:54] [INFO ] Added : 118 causal constraints over 24 iterations in 2026 ms. Result :sat
Minimization took 277 ms.
[2026-05-25 04:33:54] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:33:54] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:33:55] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-25 04:33:55] [INFO ] [Real]Added 32 Read/Feed constraints in 87 ms returned sat
[2026-05-25 04:33:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:33:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:33:55] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:33:55] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2026-05-25 04:33:55] [INFO ] [Nat]Added 32 Read/Feed constraints in 149 ms returned sat
[2026-05-25 04:33:55] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:33:58] [INFO ] Added : 147 causal constraints over 30 iterations in 2553 ms. Result :sat
Minimization took 315 ms.
[2026-05-25 04:33:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:58] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:33:58] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2026-05-25 04:33:58] [INFO ] [Real]Added 32 Read/Feed constraints in 68 ms returned sat
[2026-05-25 04:33:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:33:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:33:58] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 16 ms returned sat
[2026-05-25 04:33:58] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-25 04:33:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 165 ms returned sat
[2026-05-25 04:33:59] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:34:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1650 ms
[2026-05-25 04:34:04] [INFO ] Added : 186 causal constraints over 38 iterations in 4992 ms. Result :sat
Minimization took 691 ms.
[2026-05-25 04:34:04] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:04] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:34:04] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2026-05-25 04:34:04] [INFO ] [Real]Added 32 Read/Feed constraints in 96 ms returned sat
[2026-05-25 04:34:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:34:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:34:05] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-25 04:34:05] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-25 04:34:05] [INFO ] [Nat]Added 32 Read/Feed constraints in 223 ms returned sat
[2026-05-25 04:34:05] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:34:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2026-05-25 04:34:07] [INFO ] Added : 112 causal constraints over 23 iterations in 1671 ms. Result :sat
Minimization took 529 ms.
[2026-05-25 04:34:07] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:34:07] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:34:07] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 04:34:07] [INFO ] [Real]Added 32 Read/Feed constraints in 114 ms returned sat
[2026-05-25 04:34:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:34:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:07] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:34:07] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 04:34:08] [INFO ] [Nat]Added 32 Read/Feed constraints in 140 ms returned sat
[2026-05-25 04:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2026-05-25 04:34:08] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2026-05-25 04:34:09] [INFO ] Added : 77 causal constraints over 16 iterations in 1106 ms. Result :sat
Minimization took 233 ms.
[2026-05-25 04:34:09] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:34:09] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:34:09] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 04:34:09] [INFO ] [Real]Added 32 Read/Feed constraints in 115 ms returned sat
[2026-05-25 04:34:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:34:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:09] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:34:10] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-25 04:34:10] [INFO ] [Nat]Added 32 Read/Feed constraints in 186 ms returned sat
[2026-05-25 04:34:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2026-05-25 04:34:10] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:34:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 585 ms
[2026-05-25 04:34:12] [INFO ] Added : 58 causal constraints over 13 iterations in 1421 ms. Result :sat
Minimization took 234 ms.
[2026-05-25 04:34:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:12] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:34:12] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-25 04:34:12] [INFO ] [Real]Added 32 Read/Feed constraints in 64 ms returned sat
[2026-05-25 04:34:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:34:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:12] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:34:12] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2026-05-25 04:34:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 112 ms returned sat
[2026-05-25 04:34:12] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 9 ms.
[2026-05-25 04:34:21] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7523 ms
[2026-05-25 04:34:21] [INFO ] Added : 97 causal constraints over 21 iterations in 8800 ms. Result :sat
Minimization took 473 ms.
[2026-05-25 04:34:22] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:34:22] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:34:22] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2026-05-25 04:34:22] [INFO ] [Real]Added 32 Read/Feed constraints in 75 ms returned sat
[2026-05-25 04:34:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:34:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:22] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:34:22] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-25 04:34:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 139 ms returned sat
[2026-05-25 04:34:22] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:34:28] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3218 ms
[2026-05-25 04:34:28] [INFO ] Added : 141 causal constraints over 29 iterations in 6166 ms. Result :sat
Minimization took 341 ms.
[2026-05-25 04:34:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:29] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:34:29] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2026-05-25 04:34:29] [INFO ] [Real]Added 32 Read/Feed constraints in 121 ms returned sat
[2026-05-25 04:34:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:34:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:29] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:34:29] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-25 04:34:30] [INFO ] [Nat]Added 32 Read/Feed constraints in 424 ms returned sat
[2026-05-25 04:34:38] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8587 ms
[2026-05-25 04:34:38] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2026-05-25 04:34:40] [INFO ] Added : 135 causal constraints over 27 iterations in 2280 ms. Result :sat
Minimization took 472 ms.
[2026-05-25 04:34:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:34:41] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:34:41] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2026-05-25 04:34:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:34:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:34:41] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:34:41] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2026-05-25 04:34:42] [INFO ] [Nat]Added 32 Read/Feed constraints in 643 ms returned sat
[2026-05-25 04:34:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2298 ms
[2026-05-25 04:34:44] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2026-05-25 04:34:49] [INFO ] Added : 160 causal constraints over 33 iterations in 4475 ms. Result :sat
Minimization took 579 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 174, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 174, +inf]
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 9 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 223/223 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 04:35:29] [INFO ] Invariant cache hit.
[2026-05-25 04:35:30] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-25 04:35:30] [INFO ] Invariant cache hit.
[2026-05-25 04:35:30] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:35:31] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2026-05-25 04:35:31] [INFO ] Redundant transitions in 2 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 04:35:31] [INFO ] Invariant cache hit.
[2026-05-25 04:35:31] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 227/450 variables, 223/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/450 variables, and 325 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/450 variables, 223/321 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 32/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 226/579 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 583 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62203 ms. Remains : 223/223 places, 227/227 transitions.
findPositiveTsemiflow completed in 92953 ms - Found solution {28=1, 50=1, 53=2, 54=2, 69=1, 102=1, 118=2, 126=1, 186=1, 200=1, 203=1, 210=1} and attempted to minimize in 0 ms success -> {28=1, 50=1, 69=1, 102=1, 126=1, 186=1, 203=1, 210=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 174, +inf]
[2026-05-25 04:38:14] [INFO ] Flatten gal took : 22 ms
[2026-05-25 04:38:14] [INFO ] Flatten gal took : 17 ms
[2026-05-25 04:38:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3646792450004716380.gal : 7 ms
[2026-05-25 04:38:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7129437399692683405.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3646792450004716380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7129437399692683405.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7129437399692683405.prop.
RANDOM walk for 40000 steps (5735 resets) in 353 ms. (112 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (364 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (361 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 11
BEST_FIRST walk for 4001 steps (371 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :40 after 117
BEST_FIRST walk for 4001 steps (358 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :117 after 230
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :230 after 487
BEST_FIRST walk for 4003 steps (357 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (348 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (354 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :487 after 1092
BEST_FIRST walk for 4003 steps (354 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (373 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (361 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (336 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (362 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (354 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
Invariant property MIN8 does not hold.
SDD proceeding with computation,23 properties remain. new max is 2048
SDD size :1092 after 9071
BEST_FIRST walk for 4000 steps (362 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (369 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (353 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (365 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (364 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (368 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (359 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (365 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (364 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (359 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 4096
BEST_FIRST walk for 4002 steps (364 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
SDD size :9071 after 19971
SDD proceeding with computation,23 properties remain. new max is 8192
SDD size :19971 after 35060
SDD proceeding with computation,23 properties remain. new max is 16384
SDD size :35060 after 69163
SDD proceeding with computation,23 properties remain. new max is 32768
SDD size :69163 after 163863
SDD proceeding with computation,23 properties remain. new max is 65536
SDD size :163863 after 349856
Interrupted probabilistic random walk after 343520 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :1 out of 24
Probabilistic random walk after 343520 steps, saw 171789 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :1
[2026-05-25 04:38:18] [INFO ] Invariant cache hit.
[2026-05-25 04:38:18] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem MAX11 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 20/216 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/218 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 227/445 variables, 218/247 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 32/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/450 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 286 constraints, problems are : Problem set: 1 solved, 22 unsolved in 1334 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 17/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 131072
SDD size :349856 after 736084
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 13/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 20/216 variables, 9/73 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 9/82 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 2/218 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SMT process timed out in 6386ms, After SMT, problems are : Problem set: 1 solved, 22 unsolved
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 221 transition count 226
Applied a total of 4 rules in 24 ms. Remains 221 /223 variables (removed 2) and now considering 226/227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 221/223 places, 226/227 transitions.
RANDOM walk for 40000 steps (5705 resets) in 417 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (383 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (371 resets) in 43 ms. (90 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (357 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (377 resets) in 27 ms. (142 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (374 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (360 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (356 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (357 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (383 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (359 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (358 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (380 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (376 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (358 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (366 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (353 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (365 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (374 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (385 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (377 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (337 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (358 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 319360 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 22
Probabilistic random walk after 319360 steps, saw 159706 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9349704860917546002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5149175171160427593.kers'
[2026-05-25 04:38:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9349704860917546002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5149175171160427593.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 219 cols 1158 entries
Finished phase 1 with 151 SingleSign rule and 39 generalized
[2026-05-25 04:38:28] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5149175171160427593.kers
Total runtime 3 ms.
[2026-05-25 04:38:28] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 24/210 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 6/216 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 226/442 variables, 216/245 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 262144
SDD size :736084 after 1.27357e+08
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 24/210 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/216 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 226/442 variables, 216/464 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 524288
At refinement iteration 23 (INCLUDED_ONLY) 0/442 variables, 35/499 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD size :1.27357e+08 after 4.97423e+08
At refinement iteration 24 (INCLUDED_ONLY) 0/442 variables, 22/521 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/442 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/442 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/442 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/442 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/442 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:39:05] [INFO ] Flatten gal took : 9 ms
[2026-05-25 04:39:05] [INFO ] Applying decomposition
[2026-05-25 04:39:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6684187073177889291.txt' '-o' '/tmp/graph6684187073177889291.bin' '-w' '/tmp/graph6684187073177889291.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6684187073177889291.bin' '-l' '-1' '-v' '-w' '/tmp/graph6684187073177889291.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:39:05] [INFO ] Decomposing Gal with order
[2026-05-25 04:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:39:05] [INFO ] Removed a total of 104 redundant transitions.
[2026-05-25 04:39:05] [INFO ] Flatten gal took : 24 ms
[2026-05-25 04:39:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 8 ms.
[2026-05-25 04:39:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14387664538882499287.gal : 4 ms
[2026-05-25 04:39:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11532345345046272979.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14387664538882499287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11532345345046272979.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11532345345046272979.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :14 after 40
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :40 after 1048
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :1048 after 1175
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :1175 after 45089
At refinement iteration 30 (OVERLAPS) 5/447 variables, 5/539 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/447 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/447 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/447 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :45089 after 221825
At refinement iteration 34 (OVERLAPS) 0/447 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 543 constraints, problems are : Problem set: 0 solved, 22 unsolved in 39962 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 232/232 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41262ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 30160 ms.
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 5 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 221/221 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 04:39:39] [INFO ] Invariant cache hit.
[2026-05-25 04:39:39] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-25 04:39:39] [INFO ] Invariant cache hit.
[2026-05-25 04:39:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:39:41] [INFO ] Implicit Places using invariants and state equation in 1879 ms returned []
Implicit Place search using SMT with State Equation took 2219 ms to find 0 implicit places.
[2026-05-25 04:39:41] [INFO ] Redundant transitions in 1 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-25 04:39:41] [INFO ] Invariant cache hit.
[2026-05-25 04:39:41] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :221825 after 591924
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Detected timeout of ITS tools.
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 225 unsolved in 18906 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 225/512 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 552 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48966ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 48967ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51203 ms. Remains : 221/221 places, 226/226 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 173, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15720919287393137727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13113185920790344578.kers'
[2026-05-25 04:40:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15720919287393137727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13113185920790344578.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 227 rows 221 cols 1153 entries
Finished phase 1 with 142 SingleSign rule and 50 generalized
[2026-05-25 04:40:30] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-13113185920790344578.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 173, +inf]
RANDOM walk for 1000000 steps (144252 resets) in 917 ms. (1089 steps per ms)
BEST_FIRST walk for 13000005 steps (1188951 resets) in 8213 ms. (1582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 173, +inf]
[2026-05-25 04:40:39] [INFO ] Invariant cache hit.
[2026-05-25 04:40:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:40:39] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:40:39] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-25 04:40:39] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:40:40] [INFO ] [Real]Added 32 Read/Feed constraints in 117 ms returned sat
[2026-05-25 04:40:40] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:40:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:40:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:40:40] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:40:40] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-25 04:40:40] [INFO ] [Nat]Added 32 Read/Feed constraints in 150 ms returned sat
[2026-05-25 04:40:40] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:40:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 379 ms
[2026-05-25 04:40:42] [INFO ] Added : 108 causal constraints over 23 iterations in 2384 ms. Result :sat
Minimization took 316 ms.
[2026-05-25 04:40:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:40:43] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:40:43] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-25 04:40:43] [INFO ] [Real]Added 32 Read/Feed constraints in 151 ms returned sat
[2026-05-25 04:40:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:40:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:40:43] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:40:43] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2026-05-25 04:40:44] [INFO ] [Nat]Added 32 Read/Feed constraints in 237 ms returned sat
[2026-05-25 04:40:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 557 ms
[2026-05-25 04:40:44] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:40:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1085 ms
[2026-05-25 04:40:49] [INFO ] Added : 190 causal constraints over 39 iterations in 4637 ms. Result :sat
Minimization took 929 ms.
[2026-05-25 04:40:50] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:40:50] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:40:50] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-25 04:40:50] [INFO ] [Real]Added 32 Read/Feed constraints in 69 ms returned sat
[2026-05-25 04:40:50] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:40:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:40:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:40:50] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 9 ms returned sat
[2026-05-25 04:40:50] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-25 04:40:50] [INFO ] [Nat]Added 32 Read/Feed constraints in 143 ms returned sat
[2026-05-25 04:40:50] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:40:55] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2092 ms
[2026-05-25 04:40:55] [INFO ] Added : 179 causal constraints over 37 iterations in 4586 ms. Result :sat
Minimization took 376 ms.
[2026-05-25 04:40:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:40:55] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:40:55] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-25 04:40:55] [INFO ] [Real]Added 32 Read/Feed constraints in 96 ms returned sat
[2026-05-25 04:40:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:40:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:40:56] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:40:56] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2026-05-25 04:40:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 270 ms returned sat
[2026-05-25 04:40:56] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:40:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 402 ms
[2026-05-25 04:40:58] [INFO ] Added : 118 causal constraints over 24 iterations in 2029 ms. Result :sat
Minimization took 289 ms.
[2026-05-25 04:40:58] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:40:58] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:40:58] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2026-05-25 04:40:59] [INFO ] [Real]Added 32 Read/Feed constraints in 89 ms returned sat
[2026-05-25 04:40:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:40:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:40:59] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:40:59] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-25 04:40:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 155 ms returned sat
[2026-05-25 04:40:59] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:41:01] [INFO ] Added : 147 causal constraints over 30 iterations in 2606 ms. Result :sat
Minimization took 323 ms.
[2026-05-25 04:41:02] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:02] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:41:02] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2026-05-25 04:41:02] [INFO ] [Real]Added 32 Read/Feed constraints in 71 ms returned sat
[2026-05-25 04:41:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:41:02] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:02] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2026-05-25 04:41:02] [INFO ] [Nat]Added 32 Read/Feed constraints in 170 ms returned sat
[2026-05-25 04:41:02] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:41:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1520 ms
[2026-05-25 04:41:07] [INFO ] Added : 186 causal constraints over 38 iterations in 5027 ms. Result :sat
Minimization took 705 ms.
[2026-05-25 04:41:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:41:08] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:08] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2026-05-25 04:41:08] [INFO ] [Real]Added 32 Read/Feed constraints in 100 ms returned sat
[2026-05-25 04:41:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:08] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:09] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-25 04:41:09] [INFO ] [Nat]Added 32 Read/Feed constraints in 224 ms returned sat
[2026-05-25 04:41:09] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:41:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 296 ms
[2026-05-25 04:41:11] [INFO ] Added : 112 causal constraints over 23 iterations in 1727 ms. Result :sat
Minimization took 529 ms.
[2026-05-25 04:41:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:41:11] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:11] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2026-05-25 04:41:11] [INFO ] [Real]Added 32 Read/Feed constraints in 116 ms returned sat
[2026-05-25 04:41:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:11] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 33 ms returned sat
[2026-05-25 04:41:12] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-25 04:41:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 141 ms returned sat
[2026-05-25 04:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2026-05-25 04:41:12] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:41:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2026-05-25 04:41:13] [INFO ] Added : 77 causal constraints over 16 iterations in 1102 ms. Result :sat
Minimization took 241 ms.
[2026-05-25 04:41:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:13] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:13] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-25 04:41:13] [INFO ] [Real]Added 32 Read/Feed constraints in 154 ms returned sat
[2026-05-25 04:41:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:14] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:14] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-25 04:41:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 167 ms returned sat
[2026-05-25 04:41:14] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:41:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2026-05-25 04:41:15] [INFO ] Added : 50 causal constraints over 11 iterations in 720 ms. Result :sat
Minimization took 202 ms.
[2026-05-25 04:41:15] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:15] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:15] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-25 04:41:15] [INFO ] [Real]Added 32 Read/Feed constraints in 65 ms returned sat
[2026-05-25 04:41:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:41:15] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:15] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2026-05-25 04:41:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 110 ms returned sat
[2026-05-25 04:41:15] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:41:24] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7522 ms
[2026-05-25 04:41:24] [INFO ] Added : 97 causal constraints over 21 iterations in 8787 ms. Result :sat
Minimization took 483 ms.
[2026-05-25 04:41:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:25] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:41:25] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-25 04:41:25] [INFO ] [Real]Added 32 Read/Feed constraints in 75 ms returned sat
[2026-05-25 04:41:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:25] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:41:25] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2026-05-25 04:41:25] [INFO ] [Nat]Added 32 Read/Feed constraints in 138 ms returned sat
[2026-05-25 04:41:25] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:41:31] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3353 ms
[2026-05-25 04:41:31] [INFO ] Added : 141 causal constraints over 29 iterations in 6312 ms. Result :sat
Minimization took 352 ms.
[2026-05-25 04:41:32] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:32] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:41:32] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-25 04:41:32] [INFO ] [Real]Added 32 Read/Feed constraints in 126 ms returned sat
[2026-05-25 04:41:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:32] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:41:32] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-25 04:41:33] [INFO ] [Nat]Added 32 Read/Feed constraints in 426 ms returned sat
[2026-05-25 04:41:41] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8641 ms
[2026-05-25 04:41:41] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:41:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2026-05-25 04:41:44] [INFO ] Added : 135 causal constraints over 27 iterations in 2244 ms. Result :sat
Minimization took 465 ms.
[2026-05-25 04:41:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:44] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:41:44] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2026-05-25 04:41:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:41:44] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:41:45] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2026-05-25 04:41:45] [INFO ] [Nat]Added 32 Read/Feed constraints in 645 ms returned sat
[2026-05-25 04:41:47] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2250 ms
[2026-05-25 04:41:47] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2026-05-25 04:41:52] [INFO ] Added : 160 causal constraints over 33 iterations in 4428 ms. Result :sat
Minimization took 570 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 173, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 173, +inf]
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 223/223 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 04:42:30] [INFO ] Invariant cache hit.
[2026-05-25 04:42:31] [INFO ] Implicit Places using invariants in 405 ms returned []
[2026-05-25 04:42:31] [INFO ] Invariant cache hit.
[2026-05-25 04:42:31] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:42:33] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
[2026-05-25 04:42:33] [INFO ] Redundant transitions in 0 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 04:42:33] [INFO ] Invariant cache hit.
[2026-05-25 04:42:33] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 227/450 variables, 223/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 325 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/450 variables, 223/321 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 32/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 226/579 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 583 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62312 ms. Remains : 223/223 places, 227/227 transitions.
findPositiveTsemiflow completed in 93791 ms - Found solution {28=1, 50=1, 53=2, 54=2, 69=1, 102=1, 118=2, 126=1, 186=1, 200=1, 203=1, 210=1} and attempted to minimize in 0 ms success -> {28=1, 50=1, 69=1, 102=1, 126=1, 186=1, 203=1, 210=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 173, +inf]
[2026-05-25 04:45:17] [INFO ] Flatten gal took : 89 ms
RANDOM walk for 40000 steps (5840 resets) in 275 ms. (144 steps per ms) remains 24/24 properties
[2026-05-25 04:45:17] [INFO ] Flatten gal took : 25 ms
[2026-05-25 04:45:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11055949627271408230.gal : 2 ms
[2026-05-25 04:45:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6764490541851954147.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11055949627271408230.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6764490541851954147.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4000 steps (377 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (382 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4001 steps (360 resets) in 118 ms. (33 steps per ms) remains 24/24 properties
Loading property file /tmp/ReachabilityCardinality6764490541851954147.prop.
SDD proceeding with computation,24 properties remain. new max is 4
BEST_FIRST walk for 4001 steps (369 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :40 after 117
BEST_FIRST walk for 4002 steps (371 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :117 after 230
BEST_FIRST walk for 4000 steps (366 resets) in 59 ms. (66 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :230 after 487
BEST_FIRST walk for 4001 steps (356 resets) in 50 ms. (78 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (376 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :487 after 1092
BEST_FIRST walk for 4002 steps (372 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (375 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (370 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (364 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (378 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
Invariant property MIN8 does not hold.
SDD proceeding with computation,23 properties remain. new max is 2048
SDD size :1092 after 9071
BEST_FIRST walk for 4002 steps (372 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (365 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (347 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (353 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (358 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (365 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (358 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (350 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (347 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 4096
SDD size :9071 after 19971
BEST_FIRST walk for 4000 steps (352 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (374 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 8192
SDD size :19971 after 35060
SDD proceeding with computation,23 properties remain. new max is 16384
SDD size :35060 after 69163
SDD proceeding with computation,23 properties remain. new max is 32768
SDD size :69163 after 163863
Interrupted probabilistic random walk after 158524 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :1 out of 24
Probabilistic random walk after 158524 steps, saw 79270 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :1
[2026-05-25 04:45:20] [INFO ] Invariant cache hit.
[2026-05-25 04:45:20] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem MAX11 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 20/216 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 65536
SDD size :163863 after 349856
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/218 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 227/445 variables, 218/247 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 32/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/450 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 286 constraints, problems are : Problem set: 1 solved, 22 unsolved in 2217 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 17/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 131072
SDD size :349856 after 736084
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/450 variables, and 51 constraints, problems are : Problem set: 1 solved, 22 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 17/27 constraints, State Equation: 0/223 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7231ms problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 221 transition count 226
Applied a total of 4 rules in 9 ms. Remains 221 /223 variables (removed 2) and now considering 226/227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 221/223 places, 226/227 transitions.
RANDOM walk for 40000 steps (5780 resets) in 377 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (375 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (352 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (367 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (348 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (352 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (366 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (358 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (373 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (383 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (365 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (348 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (345 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (363 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (373 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (357 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (373 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (370 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (371 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (346 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (342 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (353 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (378 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 236751 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 22
Probabilistic random walk after 236751 steps, saw 118396 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15960683285769551732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6164077669359693739.kers'
[2026-05-25 04:45:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15960683285769551732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6164077669359693739.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 219 cols 1158 entries
Finished phase 1 with 151 SingleSign rule and 39 generalized
[2026-05-25 04:45:31] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6164077669359693739.kers
Total runtime 2 ms.
[2026-05-25 04:45:31] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 24/210 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 6/216 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 226/442 variables, 216/245 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 262144
SDD size :736084 after 1.27357e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 24/210 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/216 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 524288
SDD size :1.27357e+08 after 4.97423e+08
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 10/252 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 226/442 variables, 216/468 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/442 variables, 35/503 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/442 variables, 22/525 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/442 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/442 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/442 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:46:07] [INFO ] Flatten gal took : 15 ms
[2026-05-25 04:46:07] [INFO ] Applying decomposition
[2026-05-25 04:46:07] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph760767931977237003.txt' '-o' '/tmp/graph760767931977237003.bin' '-w' '/tmp/graph760767931977237003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph760767931977237003.bin' '-l' '-1' '-v' '-w' '/tmp/graph760767931977237003.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:46:07] [INFO ] Decomposing Gal with order
[2026-05-25 04:46:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:46:07] [INFO ] Removed a total of 103 redundant transitions.
[2026-05-25 04:46:07] [INFO ] Flatten gal took : 31 ms
[2026-05-25 04:46:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 6 ms.
[2026-05-25 04:46:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10824836894576306298.gal : 4 ms
[2026-05-25 04:46:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4817721650179387165.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10824836894576306298.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4817721650179387165.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4817721650179387165.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :27 after 126
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :126 after 1163
At refinement iteration 28 (INCLUDED_ONLY) 0/442 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :1163 after 45077
At refinement iteration 29 (INCLUDED_ONLY) 0/442 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :45077 after 221733
At refinement iteration 30 (INCLUDED_ONLY) 0/442 variables, 4/537 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/442 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/442 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/442 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 34 (OVERLAPS) 5/447 variables, 5/544 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/447 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/447 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/447 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 548 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45007 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 237/237 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 46333ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 221/221 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 04:46:17] [INFO ] Invariant cache hit.
[2026-05-25 04:46:17] [INFO ] Implicit Places using invariants in 315 ms returned []
[2026-05-25 04:46:17] [INFO ] Invariant cache hit.
[2026-05-25 04:46:18] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:46:19] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2251 ms to find 0 implicit places.
[2026-05-25 04:46:19] [INFO ] Redundant transitions in 1 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-25 04:46:19] [INFO ] Invariant cache hit.
[2026-05-25 04:46:19] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 225 unsolved in 18130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 225/512 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Detected timeout of ITS tools.
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 552 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48192ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 48193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50455 ms. Remains : 221/221 places, 226/226 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 172, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17641926078006083818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14717700938870375019.kers'
[2026-05-25 04:47:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17641926078006083818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14717700938870375019.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 221 cols 1153 entries
Finished phase 1 with 142 SingleSign rule and 50 generalized
[2026-05-25 04:47:08] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14717700938870375019.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 172, +inf]
RANDOM walk for 1000000 steps (144056 resets) in 870 ms. (1148 steps per ms)
BEST_FIRST walk for 13000007 steps (1188393 resets) in 7901 ms. (1645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 172, +inf]
[2026-05-25 04:47:16] [INFO ] Invariant cache hit.
[2026-05-25 04:47:16] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:47:16] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:16] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-25 04:47:16] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:47:17] [INFO ] [Real]Added 32 Read/Feed constraints in 117 ms returned sat
[2026-05-25 04:47:17] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:47:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:47:17] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:47:17] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-25 04:47:17] [INFO ] [Nat]Added 32 Read/Feed constraints in 148 ms returned sat
[2026-05-25 04:47:17] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:47:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 380 ms
[2026-05-25 04:47:19] [INFO ] Added : 108 causal constraints over 23 iterations in 2351 ms. Result :sat
Minimization took 305 ms.
[2026-05-25 04:47:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:20] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:47:20] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2026-05-25 04:47:20] [INFO ] [Real]Added 32 Read/Feed constraints in 150 ms returned sat
[2026-05-25 04:47:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:20] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:20] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2026-05-25 04:47:20] [INFO ] [Nat]Added 32 Read/Feed constraints in 235 ms returned sat
[2026-05-25 04:47:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 572 ms
[2026-05-25 04:47:21] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:47:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1154 ms
[2026-05-25 04:47:26] [INFO ] Added : 190 causal constraints over 39 iterations in 4692 ms. Result :sat
Minimization took 915 ms.
[2026-05-25 04:47:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:27] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:47:27] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2026-05-25 04:47:27] [INFO ] [Real]Added 32 Read/Feed constraints in 72 ms returned sat
[2026-05-25 04:47:27] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:47:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:47:27] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:47:27] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-25 04:47:27] [INFO ] [Nat]Added 32 Read/Feed constraints in 142 ms returned sat
[2026-05-25 04:47:27] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:47:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2065 ms
[2026-05-25 04:47:32] [INFO ] Added : 179 causal constraints over 37 iterations in 4562 ms. Result :sat
Minimization took 373 ms.
[2026-05-25 04:47:32] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:47:32] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:32] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-25 04:47:32] [INFO ] [Real]Added 32 Read/Feed constraints in 96 ms returned sat
[2026-05-25 04:47:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:32] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:33] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2026-05-25 04:47:33] [INFO ] [Nat]Added 32 Read/Feed constraints in 270 ms returned sat
[2026-05-25 04:47:33] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:47:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2026-05-25 04:47:35] [INFO ] Added : 118 causal constraints over 24 iterations in 1984 ms. Result :sat
Minimization took 293 ms.
[2026-05-25 04:47:35] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:35] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:47:35] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2026-05-25 04:47:35] [INFO ] [Real]Added 32 Read/Feed constraints in 90 ms returned sat
[2026-05-25 04:47:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:47:35] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:36] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2026-05-25 04:47:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 154 ms returned sat
[2026-05-25 04:47:36] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:47:38] [INFO ] Added : 147 causal constraints over 30 iterations in 2573 ms. Result :sat
Minimization took 333 ms.
[2026-05-25 04:47:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:39] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:39] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2026-05-25 04:47:39] [INFO ] [Real]Added 32 Read/Feed constraints in 73 ms returned sat
[2026-05-25 04:47:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:47:39] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:47:39] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-25 04:47:39] [INFO ] [Nat]Added 32 Read/Feed constraints in 172 ms returned sat
[2026-05-25 04:47:39] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:47:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1473 ms
[2026-05-25 04:47:44] [INFO ] Added : 186 causal constraints over 38 iterations in 4958 ms. Result :sat
Minimization took 719 ms.
[2026-05-25 04:47:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:45] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:45] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2026-05-25 04:47:45] [INFO ] [Real]Added 32 Read/Feed constraints in 96 ms returned sat
[2026-05-25 04:47:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:47:45] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-25 04:47:45] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-25 04:47:46] [INFO ] [Nat]Added 32 Read/Feed constraints in 225 ms returned sat
[2026-05-25 04:47:46] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:47:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2026-05-25 04:47:47] [INFO ] Added : 112 causal constraints over 23 iterations in 1717 ms. Result :sat
Minimization took 521 ms.
[2026-05-25 04:47:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:48] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:48] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-25 04:47:48] [INFO ] [Real]Added 32 Read/Feed constraints in 113 ms returned sat
[2026-05-25 04:47:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:48] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:48] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 04:47:48] [INFO ] [Nat]Added 32 Read/Feed constraints in 140 ms returned sat
[2026-05-25 04:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2026-05-25 04:47:49] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:47:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2026-05-25 04:47:50] [INFO ] Added : 77 causal constraints over 16 iterations in 1079 ms. Result :sat
Minimization took 243 ms.
[2026-05-25 04:47:50] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:47:50] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-25 04:47:50] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-25 04:47:50] [INFO ] [Real]Added 32 Read/Feed constraints in 133 ms returned sat
[2026-05-25 04:47:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:50] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:50] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-25 04:47:50] [INFO ] [Nat]Added 32 Read/Feed constraints in 141 ms returned sat
[2026-05-25 04:47:50] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:47:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1834 ms
[2026-05-25 04:47:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 776 ms
[2026-05-25 04:47:54] [INFO ] Added : 66 causal constraints over 15 iterations in 3321 ms. Result :sat
Minimization took 230 ms.
[2026-05-25 04:47:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:54] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:47:54] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-25 04:47:54] [INFO ] [Real]Added 32 Read/Feed constraints in 67 ms returned sat
[2026-05-25 04:47:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:47:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:47:54] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:47:54] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-25 04:47:55] [INFO ] [Nat]Added 32 Read/Feed constraints in 111 ms returned sat
[2026-05-25 04:47:55] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:48:03] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7474 ms
[2026-05-25 04:48:03] [INFO ] Added : 97 causal constraints over 21 iterations in 8765 ms. Result :sat
Minimization took 480 ms.
[2026-05-25 04:48:04] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:48:04] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:48:04] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2026-05-25 04:48:04] [INFO ] [Real]Added 32 Read/Feed constraints in 76 ms returned sat
[2026-05-25 04:48:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:48:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:48:04] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:48:04] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2026-05-25 04:48:04] [INFO ] [Nat]Added 32 Read/Feed constraints in 140 ms returned sat
[2026-05-25 04:48:04] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:48:11] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3200 ms
[2026-05-25 04:48:11] [INFO ] Added : 141 causal constraints over 29 iterations in 6147 ms. Result :sat
Minimization took 366 ms.
[2026-05-25 04:48:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:48:11] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 9 ms returned sat
[2026-05-25 04:48:11] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2026-05-25 04:48:11] [INFO ] [Real]Added 32 Read/Feed constraints in 125 ms returned sat
[2026-05-25 04:48:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:48:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:48:11] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:48:11] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2026-05-25 04:48:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 437 ms returned sat
[2026-05-25 04:48:21] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8863 ms
[2026-05-25 04:48:21] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2026-05-25 04:48:23] [INFO ] Added : 135 causal constraints over 27 iterations in 2236 ms. Result :sat
Minimization took 460 ms.
[2026-05-25 04:48:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:48:24] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-25 04:48:24] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2026-05-25 04:48:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:48:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:48:24] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:48:24] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2026-05-25 04:48:25] [INFO ] [Nat]Added 32 Read/Feed constraints in 645 ms returned sat
[2026-05-25 04:48:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2275 ms
[2026-05-25 04:48:27] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2026-05-25 04:48:31] [INFO ] Added : 160 causal constraints over 33 iterations in 4435 ms. Result :sat
Minimization took 556 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 172, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 172, +inf]
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 9 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 223/223 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 04:49:09] [INFO ] Invariant cache hit.
[2026-05-25 04:49:09] [INFO ] Implicit Places using invariants in 354 ms returned []
[2026-05-25 04:49:09] [INFO ] Invariant cache hit.
[2026-05-25 04:49:09] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:49:11] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2026-05-25 04:49:11] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 04:49:11] [INFO ] Invariant cache hit.
[2026-05-25 04:49:11] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 227/450 variables, 223/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 325 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/450 variables, 223/321 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 32/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 226/579 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 583 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62322 ms. Remains : 223/223 places, 227/227 transitions.
findPositiveTsemiflow completed in 93663 ms - Found solution {28=1, 50=1, 53=2, 54=2, 69=1, 102=1, 118=2, 126=1, 186=1, 200=1, 203=1, 210=1} and attempted to minimize in 0 ms success -> {28=1, 50=1, 69=1, 102=1, 126=1, 186=1, 203=1, 210=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 172, +inf]
[2026-05-25 04:51:55] [INFO ] Flatten gal took : 8 ms
[2026-05-25 04:51:55] [INFO ] Flatten gal took : 12 ms
[2026-05-25 04:51:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14379074336855203363.gal : 16 ms
[2026-05-25 04:51:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14353092153695101015.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14379074336855203363.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14353092153695101015.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14353092153695101015.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :40 after 117
RANDOM walk for 40000 steps (5762 resets) in 320 ms. (124 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :117 after 230
BEST_FIRST walk for 4001 steps (347 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :230 after 487
BEST_FIRST walk for 4000 steps (375 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (377 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (381 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :487 after 1092
BEST_FIRST walk for 4001 steps (351 resets) in 28 ms. (137 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (360 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
Invariant property MIN8 does not hold.
SDD proceeding with computation,23 properties remain. new max is 2048
SDD size :1092 after 9071
BEST_FIRST walk for 4002 steps (368 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (391 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (349 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (369 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (376 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (360 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (381 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 4096
SDD size :9071 after 19971
BEST_FIRST walk for 4000 steps (349 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (385 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (373 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (362 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (388 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (363 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (368 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (365 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (374 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (375 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (374 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 8192
SDD size :19971 after 35060
SDD proceeding with computation,23 properties remain. new max is 16384
SDD size :35060 after 69163
SDD proceeding with computation,23 properties remain. new max is 32768
SDD size :69163 after 163863
SDD proceeding with computation,23 properties remain. new max is 65536
SDD size :163863 after 349856
Interrupted probabilistic random walk after 219842 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :1 out of 24
Probabilistic random walk after 219842 steps, saw 109939 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :1
[2026-05-25 04:51:59] [INFO ] Invariant cache hit.
[2026-05-25 04:51:59] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem MAX11 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 20/216 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/218 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 227/445 variables, 218/247 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 32/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/450 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 286 constraints, problems are : Problem set: 1 solved, 22 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 17/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 131072
SDD size :349856 after 736084
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 13/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 20/216 variables, 9/73 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 9/82 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 2/218 variables, 1/86 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SMT process timed out in 6313ms, After SMT, problems are : Problem set: 1 solved, 22 unsolved
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 221 transition count 226
Applied a total of 4 rules in 8 ms. Remains 221 /223 variables (removed 2) and now considering 226/227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 221/223 places, 226/227 transitions.
RANDOM walk for 40000 steps (5797 resets) in 256 ms. (155 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (357 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (372 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (361 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (360 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (349 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (368 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (369 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (378 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (374 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (375 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (380 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (373 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (362 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (365 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (376 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (379 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (352 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (368 resets) in 22 ms. (173 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (366 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (351 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (351 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (363 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 217096 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 22
Probabilistic random walk after 217096 steps, saw 108567 distinct states, run finished after 3003 ms. (steps per millisecond=72 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4585200251976456629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5702443691086233732.kers'
[2026-05-25 04:52:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4585200251976456629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5702443691086233732.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 219 cols 1158 entries
Finished phase 1 with 151 SingleSign rule and 39 generalized
[2026-05-25 04:52:08] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5702443691086233732.kers
Total runtime 2 ms.
[2026-05-25 04:52:08] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 24/210 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 6/216 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 226/442 variables, 216/245 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1269 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 262144
SDD size :736084 after 1.27357e+08
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 24/210 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/216 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 524288
SDD size :1.27357e+08 after 4.97423e+08
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 6/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 226/442 variables, 216/464 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/442 variables, 35/499 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/442 variables, 22/521 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/442 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/442 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/442 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/442 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/442 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:52:45] [INFO ] Flatten gal took : 7 ms
[2026-05-25 04:52:45] [INFO ] Applying decomposition
[2026-05-25 04:52:45] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3115078257941217453.txt' '-o' '/tmp/graph3115078257941217453.bin' '-w' '/tmp/graph3115078257941217453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3115078257941217453.bin' '-l' '-1' '-v' '-w' '/tmp/graph3115078257941217453.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:52:45] [INFO ] Decomposing Gal with order
[2026-05-25 04:52:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:52:45] [INFO ] Removed a total of 100 redundant transitions.
[2026-05-25 04:52:45] [INFO ] Flatten gal took : 20 ms
[2026-05-25 04:52:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 13 ms.
[2026-05-25 04:52:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15819442679061844856.gal : 6 ms
[2026-05-25 04:52:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13127654996764943205.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15819442679061844856.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13127654996764943205.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13127654996764943205.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :8 after 20
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :20 after 50
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :50 after 56
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :56 after 273
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :273 after 279
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :279 after 512
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :512 after 1206
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :1206 after 2334
At refinement iteration 30 (OVERLAPS) 5/447 variables, 5/539 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/447 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :2334 after 46384
At refinement iteration 32 (INCLUDED_ONLY) 0/447 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/447 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :46384 after 134232
At refinement iteration 34 (OVERLAPS) 0/447 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 543 constraints, problems are : Problem set: 0 solved, 22 unsolved in 40072 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 232/232 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41352ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 12 different solutions.
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :134232 after 311997
Parikh walk visited 0 properties in 30688 ms.
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 5 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 221/221 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 3 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 04:53:20] [INFO ] Invariant cache hit.
[2026-05-25 04:53:21] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-25 04:53:21] [INFO ] Invariant cache hit.
[2026-05-25 04:53:21] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 04:53:22] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2279 ms to find 0 implicit places.
[2026-05-25 04:53:23] [INFO ] Redundant transitions in 2 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-25 04:53:23] [INFO ] Invariant cache hit.
[2026-05-25 04:53:23] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Detected timeout of ITS tools.
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 225 unsolved in 18834 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 225/512 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 552 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48892ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 48895ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51186 ms. Remains : 221/221 places, 226/226 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 171, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14196723984087864455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2479181730548996644.kers'
[2026-05-25 04:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14196723984087864455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2479181730548996644.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 227 rows 221 cols 1153 entries
Finished phase 1 with 142 SingleSign rule and 50 generalized
[2026-05-25 04:54:11] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2479181730548996644.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 171, +inf]
RANDOM walk for 1000000 steps (144078 resets) in 943 ms. (1059 steps per ms)
BEST_FIRST walk for 13000004 steps (1189018 resets) in 8543 ms. (1521 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 171, +inf]
[2026-05-25 04:54:21] [INFO ] Invariant cache hit.
[2026-05-25 04:54:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:54:21] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 14 ms returned sat
[2026-05-25 04:54:21] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-25 04:54:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:54:21] [INFO ] [Real]Added 32 Read/Feed constraints in 119 ms returned sat
[2026-05-25 04:54:21] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:54:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:21] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:54:21] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-25 04:54:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 151 ms returned sat
[2026-05-25 04:54:22] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 14 ms.
[2026-05-25 04:54:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 362 ms
[2026-05-25 04:54:24] [INFO ] Added : 108 causal constraints over 23 iterations in 2376 ms. Result :sat
Minimization took 305 ms.
[2026-05-25 04:54:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:24] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:24] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2026-05-25 04:54:25] [INFO ] [Real]Added 32 Read/Feed constraints in 150 ms returned sat
[2026-05-25 04:54:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:25] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:25] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2026-05-25 04:54:25] [INFO ] [Nat]Added 32 Read/Feed constraints in 235 ms returned sat
[2026-05-25 04:54:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 558 ms
[2026-05-25 04:54:26] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:54:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1033 ms
[2026-05-25 04:54:30] [INFO ] Added : 190 causal constraints over 39 iterations in 4588 ms. Result :sat
Minimization took 906 ms.
[2026-05-25 04:54:31] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:54:31] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:31] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2026-05-25 04:54:31] [INFO ] [Real]Added 32 Read/Feed constraints in 72 ms returned sat
[2026-05-25 04:54:31] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:54:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:31] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:32] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-25 04:54:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 144 ms returned sat
[2026-05-25 04:54:32] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 04:54:36] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2025 ms
[2026-05-25 04:54:36] [INFO ] Added : 179 causal constraints over 37 iterations in 4465 ms. Result :sat
Minimization took 378 ms.
[2026-05-25 04:54:37] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:37] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-25 04:54:37] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 04:54:37] [INFO ] [Real]Added 32 Read/Feed constraints in 93 ms returned sat
[2026-05-25 04:54:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:54:37] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:37] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2026-05-25 04:54:37] [INFO ] [Nat]Added 32 Read/Feed constraints in 274 ms returned sat
[2026-05-25 04:54:37] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:54:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2026-05-25 04:54:39] [INFO ] Added : 118 causal constraints over 24 iterations in 2052 ms. Result :sat
Minimization took 289 ms.
[2026-05-25 04:54:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:40] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:54:40] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2026-05-25 04:54:40] [INFO ] [Real]Added 32 Read/Feed constraints in 87 ms returned sat
[2026-05-25 04:54:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:54:40] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2026-05-25 04:54:40] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-25 04:54:40] [INFO ] [Nat]Added 32 Read/Feed constraints in 154 ms returned sat
[2026-05-25 04:54:40] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 14 ms.
[2026-05-25 04:54:43] [INFO ] Added : 147 causal constraints over 30 iterations in 2630 ms. Result :sat
Minimization took 334 ms.
[2026-05-25 04:54:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:43] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:43] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-25 04:54:43] [INFO ] [Real]Added 32 Read/Feed constraints in 71 ms returned sat
[2026-05-25 04:54:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:44] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:54:44] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-25 04:54:44] [INFO ] [Nat]Added 32 Read/Feed constraints in 171 ms returned sat
[2026-05-25 04:54:44] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:54:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1457 ms
[2026-05-25 04:54:49] [INFO ] Added : 186 causal constraints over 38 iterations in 4855 ms. Result :sat
Minimization took 701 ms.
[2026-05-25 04:54:49] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:54:49] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:54:50] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 04:54:50] [INFO ] [Real]Added 32 Read/Feed constraints in 96 ms returned sat
[2026-05-25 04:54:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:50] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:50] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-25 04:54:50] [INFO ] [Nat]Added 32 Read/Feed constraints in 224 ms returned sat
[2026-05-25 04:54:50] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:54:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2026-05-25 04:54:52] [INFO ] Added : 112 causal constraints over 23 iterations in 1652 ms. Result :sat
Minimization took 536 ms.
[2026-05-25 04:54:52] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:54:52] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:52] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 04:54:52] [INFO ] [Real]Added 32 Read/Feed constraints in 112 ms returned sat
[2026-05-25 04:54:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:53] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:54:53] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2026-05-25 04:54:53] [INFO ] [Nat]Added 32 Read/Feed constraints in 139 ms returned sat
[2026-05-25 04:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2026-05-25 04:54:53] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 8 ms.
[2026-05-25 04:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2026-05-25 04:54:54] [INFO ] Added : 77 causal constraints over 16 iterations in 1094 ms. Result :sat
Minimization took 238 ms.
[2026-05-25 04:54:54] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:54:54] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:54:54] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-25 04:54:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:54] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:54:55] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 04:54:55] [INFO ] [Nat]Added 32 Read/Feed constraints in 86 ms returned sat
[2026-05-25 04:54:55] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:54:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2026-05-25 04:54:56] [INFO ] Added : 55 causal constraints over 11 iterations in 919 ms. Result :sat
Minimization took 360 ms.
[2026-05-25 04:54:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:54:56] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:54:56] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-05-25 04:54:56] [INFO ] [Real]Added 32 Read/Feed constraints in 64 ms returned sat
[2026-05-25 04:54:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:54:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2026-05-25 04:54:56] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2026-05-25 04:54:56] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-25 04:54:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 110 ms returned sat
[2026-05-25 04:54:56] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 04:55:05] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7440 ms
[2026-05-25 04:55:05] [INFO ] Added : 97 causal constraints over 21 iterations in 8682 ms. Result :sat
Minimization took 466 ms.
[2026-05-25 04:55:06] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:55:06] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:55:06] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2026-05-25 04:55:06] [INFO ] [Real]Added 32 Read/Feed constraints in 73 ms returned sat
[2026-05-25 04:55:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:55:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:55:06] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:55:06] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-25 04:55:06] [INFO ] [Nat]Added 32 Read/Feed constraints in 143 ms returned sat
[2026-05-25 04:55:06] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 04:55:12] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3297 ms
[2026-05-25 04:55:12] [INFO ] Added : 141 causal constraints over 29 iterations in 6217 ms. Result :sat
Minimization took 339 ms.
[2026-05-25 04:55:13] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:55:13] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2026-05-25 04:55:13] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-25 04:55:13] [INFO ] [Real]Added 32 Read/Feed constraints in 124 ms returned sat
[2026-05-25 04:55:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:55:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:55:13] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:55:13] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-25 04:55:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 424 ms returned sat
[2026-05-25 04:55:22] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8721 ms
[2026-05-25 04:55:22] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:55:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2026-05-25 04:55:25] [INFO ] Added : 135 causal constraints over 27 iterations in 2250 ms. Result :sat
Minimization took 468 ms.
[2026-05-25 04:55:25] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 04:55:25] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 04:55:25] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2026-05-25 04:55:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:55:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 04:55:25] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 04:55:26] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2026-05-25 04:55:26] [INFO ] [Nat]Added 32 Read/Feed constraints in 650 ms returned sat
[2026-05-25 04:55:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2242 ms
[2026-05-25 04:55:28] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 04:55:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2026-05-25 04:55:33] [INFO ] Added : 160 causal constraints over 33 iterations in 4450 ms. Result :sat
Minimization took 565 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 171, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 171, +inf]
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 223/223 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 04:56:13] [INFO ] Invariant cache hit.
[2026-05-25 04:56:13] [INFO ] Implicit Places using invariants in 331 ms returned []
[2026-05-25 04:56:13] [INFO ] Invariant cache hit.
[2026-05-25 04:56:13] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 04:56:15] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
[2026-05-25 04:56:15] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 04:56:15] [INFO ] Invariant cache hit.
[2026-05-25 04:56:15] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 227/450 variables, 223/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 325 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 227/450 variables, 223/321 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/450 variables, 32/353 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/450 variables, 226/579 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 583 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62218 ms. Remains : 223/223 places, 227/227 transitions.
findPositiveTsemiflow completed in 93993 ms - Found solution {28=1, 50=1, 53=2, 54=2, 69=1, 102=1, 118=2, 126=1, 186=1, 200=1, 203=1, 210=1} and attempted to minimize in 0 ms success -> {28=1, 50=1, 69=1, 102=1, 126=1, 186=1, 203=1, 210=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 171, +inf]
[2026-05-25 04:58:59] [INFO ] Flatten gal took : 11 ms
[2026-05-25 04:58:59] [INFO ] Flatten gal took : 12 ms
[2026-05-25 04:58:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12620343025958314726.gal : 2 ms
[2026-05-25 04:58:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7893887553141852451.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12620343025958314726.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7893887553141852451.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7893887553141852451.prop.
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 6
RANDOM walk for 40000 steps (5859 resets) in 364 ms. (109 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :40 after 117
BEST_FIRST walk for 4001 steps (366 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :117 after 230
SDD proceeding with computation,24 properties remain. new max is 1024
SDD size :230 after 487
BEST_FIRST walk for 4003 steps (379 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (365 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 2048
SDD size :487 after 1092
BEST_FIRST walk for 4001 steps (337 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (361 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (347 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
Invariant property MIN8 does not hold.
SDD proceeding with computation,23 properties remain. new max is 2048
SDD size :1092 after 9071
BEST_FIRST walk for 4000 steps (363 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (339 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (378 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 4096
SDD size :9071 after 19971
BEST_FIRST walk for 4002 steps (355 resets) in 54 ms. (72 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (379 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (366 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (372 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (374 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (379 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (357 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (365 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (367 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (350 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (362 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (370 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 8192
SDD size :19971 after 35060
BEST_FIRST walk for 4002 steps (374 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (372 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (350 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
SDD proceeding with computation,23 properties remain. new max is 16384
SDD size :35060 after 69163
SDD proceeding with computation,23 properties remain. new max is 32768
SDD size :69163 after 163863
Interrupted probabilistic random walk after 200139 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :1 out of 24
Probabilistic random walk after 200139 steps, saw 100088 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :1
[2026-05-25 04:59:03] [INFO ] Invariant cache hit.
[2026-05-25 04:59:03] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem MAX11 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 17/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 20/216 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 2/218 variables, 1/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 227/445 variables, 218/247 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 32/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 65536
SDD size :163863 after 349856
At refinement iteration 12 (OVERLAPS) 5/450 variables, 5/284 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 2/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 286 constraints, problems are : Problem set: 1 solved, 22 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 54/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 130/196 variables, 17/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 20/40 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 11/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 131072
SDD size :349856 after 736084
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 13/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 20/216 variables, 9/73 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 9/82 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 3/85 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 216/450 variables, and 85 constraints, problems are : Problem set: 1 solved, 22 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 26/27 constraints, State Equation: 0/223 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6351ms problems are : Problem set: 1 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 transition count 226
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 221 transition count 226
Applied a total of 4 rules in 12 ms. Remains 221 /223 variables (removed 2) and now considering 226/227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 221/223 places, 226/227 transitions.
RANDOM walk for 40000 steps (5730 resets) in 301 ms. (132 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (377 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (355 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (384 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (366 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (364 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (362 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (360 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (380 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (374 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (360 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (380 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (356 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (357 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (345 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (379 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (356 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (360 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (379 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (360 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (349 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (354 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (382 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 209619 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 22
Probabilistic random walk after 209619 steps, saw 104827 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16904520736069792924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13075959821537083189.kers'
[2026-05-25 04:59:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16904520736069792924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13075959821537083189.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 219 cols 1158 entries
Finished phase 1 with 151 SingleSign rule and 39 generalized
[2026-05-25 04:59:12] [INFO ] Computed 31 invariants in 2 ms
Computed 31 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13075959821537083189.kers
Total runtime 3 ms.
[2026-05-25 04:59:12] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 24/210 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 6/216 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 226/442 variables, 216/245 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 5/447 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/447 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 53/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 121/186 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 262144
SDD size :736084 after 1.27357e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 24/210 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/210 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/216 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,23 properties remain. new max is 524288
SDD size :1.27357e+08 after 4.97423e+08
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 10/252 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 226/442 variables, 216/468 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/442 variables, 35/503 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/442 variables, 22/525 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/442 variables, 3/528 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/442 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/442 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/442 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Detected timeout of ITS tools.
[2026-05-25 04:59:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 04:59:49] [INFO ] Applying decomposition
[2026-05-25 04:59:49] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14070529537639366320.txt' '-o' '/tmp/graph14070529537639366320.bin' '-w' '/tmp/graph14070529537639366320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14070529537639366320.bin' '-l' '-1' '-v' '-w' '/tmp/graph14070529537639366320.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:59:49] [INFO ] Decomposing Gal with order
[2026-05-25 04:59:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:59:49] [INFO ] Removed a total of 102 redundant transitions.
[2026-05-25 04:59:49] [INFO ] Flatten gal took : 15 ms
[2026-05-25 04:59:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 7 ms.
[2026-05-25 04:59:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2301372439898894002.gal : 4 ms
[2026-05-25 04:59:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4614328079268509990.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2301372439898894002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4614328079268509990.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4614328079268509990.prop.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,22 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,22 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,22 properties remain. new max is 32
SDD size :27 after 83
SDD proceeding with computation,22 properties remain. new max is 64
SDD size :83 after 1159
SDD proceeding with computation,22 properties remain. new max is 128
SDD size :1159 after 45046
At refinement iteration 29 (INCLUDED_ONLY) 0/442 variables, 7/539 constraints. Problems are: Problem set: 0 solved, 22 unsolved
SDD proceeding with computation,22 properties remain. new max is 256
SDD size :45046 after 221269
At refinement iteration 30 (INCLUDED_ONLY) 0/442 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/442 variables, 5/545 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/442 variables, 1/546 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/447 variables, and 546 constraints, problems are : Problem set: 0 solved, 22 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 216/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 232/232 constraints, Known Traps Along Path: 12/12 constraints]
After SMT, in 46380ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 10 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 221/221 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 221 /221 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2026-05-25 04:59:59] [INFO ] Invariant cache hit.
[2026-05-25 04:59:59] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-25 04:59:59] [INFO ] Invariant cache hit.
[2026-05-25 04:59:59] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-25 05:00:01] [INFO ] Implicit Places using invariants and state equation in 1957 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
[2026-05-25 05:00:01] [INFO ] Redundant transitions in 3 ms returned []
Running 225 sub problems to find dead transitions.
[2026-05-25 05:00:01] [INFO ] Invariant cache hit.
[2026-05-25 05:00:01] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/447 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 287 constraints, problems are : Problem set: 0 solved, 225 unsolved in 17718 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (OVERLAPS) 1/221 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (OVERLAPS) 226/447 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 35/287 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 225/512 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/447 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 225 unsolved
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :221269 after 589936
Detected timeout of ITS tools.
At refinement iteration 10 (INCLUDED_ONLY) 0/447 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 552 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 221/221 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47791ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 47792ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50085 ms. Remains : 221/221 places, 226/226 transitions.
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 170, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13822421033836858189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14503721639711970592.kers'
[2026-05-25 05:00:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13822421033836858189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14503721639711970592.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 221 cols 1153 entries
Finished phase 1 with 142 SingleSign rule and 50 generalized
[2026-05-25 05:00:49] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14503721639711970592.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 170, +inf]
RANDOM walk for 1000000 steps (143962 resets) in 983 ms. (1016 steps per ms)
BEST_FIRST walk for 13000004 steps (1189132 resets) in 8827 ms. (1472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 170, +inf]
[2026-05-25 05:00:59] [INFO ] Invariant cache hit.
[2026-05-25 05:00:59] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 05:00:59] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:00:59] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2026-05-25 05:00:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 05:00:59] [INFO ] [Real]Added 32 Read/Feed constraints in 117 ms returned sat
[2026-05-25 05:00:59] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 05:00:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:00:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:00:59] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:00:59] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2026-05-25 05:00:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 151 ms returned sat
[2026-05-25 05:00:59] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 05:01:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 395 ms
[2026-05-25 05:01:02] [INFO ] Added : 108 causal constraints over 23 iterations in 2379 ms. Result :sat
Minimization took 317 ms.
[2026-05-25 05:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 05:01:02] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:02] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2026-05-25 05:01:02] [INFO ] [Real]Added 32 Read/Feed constraints in 151 ms returned sat
[2026-05-25 05:01:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:02] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:02] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2026-05-25 05:01:03] [INFO ] [Nat]Added 32 Read/Feed constraints in 235 ms returned sat
[2026-05-25 05:01:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 565 ms
[2026-05-25 05:01:03] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 05:01:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1119 ms
[2026-05-25 05:01:08] [INFO ] Added : 190 causal constraints over 39 iterations in 4609 ms. Result :sat
Minimization took 897 ms.
[2026-05-25 05:01:09] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2026-05-25 05:01:09] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 8 ms returned sat
[2026-05-25 05:01:09] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-25 05:01:09] [INFO ] [Real]Added 32 Read/Feed constraints in 70 ms returned sat
[2026-05-25 05:01:09] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 05:01:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:09] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:09] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2026-05-25 05:01:09] [INFO ] [Nat]Added 32 Read/Feed constraints in 141 ms returned sat
[2026-05-25 05:01:09] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 05:01:14] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2052 ms
[2026-05-25 05:01:14] [INFO ] Added : 179 causal constraints over 37 iterations in 4501 ms. Result :sat
Minimization took 360 ms.
[2026-05-25 05:01:14] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 05:01:14] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:14] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-25 05:01:15] [INFO ] [Real]Added 32 Read/Feed constraints in 94 ms returned sat
[2026-05-25 05:01:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 05:01:15] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:15] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-25 05:01:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 268 ms returned sat
[2026-05-25 05:01:15] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 05:01:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 400 ms
[2026-05-25 05:01:17] [INFO ] Added : 118 causal constraints over 24 iterations in 1971 ms. Result :sat
Minimization took 278 ms.
[2026-05-25 05:01:17] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:17] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:17] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2026-05-25 05:01:18] [INFO ] [Real]Added 32 Read/Feed constraints in 89 ms returned sat
[2026-05-25 05:01:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 05:01:18] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:18] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2026-05-25 05:01:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 153 ms returned sat
[2026-05-25 05:01:18] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 14 ms.
[2026-05-25 05:01:20] [INFO ] Added : 147 causal constraints over 30 iterations in 2592 ms. Result :sat
Minimization took 319 ms.
[2026-05-25 05:01:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:21] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:21] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2026-05-25 05:01:21] [INFO ] [Real]Added 32 Read/Feed constraints in 70 ms returned sat
[2026-05-25 05:01:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:21] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:21] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-25 05:01:21] [INFO ] [Nat]Added 32 Read/Feed constraints in 169 ms returned sat
[2026-05-25 05:01:21] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 05:01:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1465 ms
[2026-05-25 05:01:26] [INFO ] Added : 186 causal constraints over 38 iterations in 4914 ms. Result :sat
Minimization took 735 ms.
[2026-05-25 05:01:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:27] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:27] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-25 05:01:27] [INFO ] [Real]Added 32 Read/Feed constraints in 100 ms returned sat
[2026-05-25 05:01:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 05:01:27] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:27] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-25 05:01:28] [INFO ] [Nat]Added 32 Read/Feed constraints in 227 ms returned sat
[2026-05-25 05:01:28] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 05:01:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2026-05-25 05:01:29] [INFO ] Added : 112 causal constraints over 23 iterations in 1745 ms. Result :sat
Minimization took 537 ms.
[2026-05-25 05:01:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:30] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:30] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-05-25 05:01:30] [INFO ] [Real]Added 32 Read/Feed constraints in 110 ms returned sat
[2026-05-25 05:01:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:30] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:30] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 05:01:31] [INFO ] [Nat]Added 32 Read/Feed constraints in 138 ms returned sat
[2026-05-25 05:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2026-05-25 05:01:31] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 13 ms.
[2026-05-25 05:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2026-05-25 05:01:32] [INFO ] Added : 77 causal constraints over 16 iterations in 1072 ms. Result :sat
Minimization took 233 ms.
[2026-05-25 05:01:32] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:32] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:32] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2026-05-25 05:01:32] [INFO ] [Real]Added 32 Read/Feed constraints in 100 ms returned sat
[2026-05-25 05:01:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:32] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:32] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2026-05-25 05:01:33] [INFO ] [Nat]Added 32 Read/Feed constraints in 145 ms returned sat
[2026-05-25 05:01:33] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 11 ms.
[2026-05-25 05:01:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2026-05-25 05:01:33] [INFO ] Added : 64 causal constraints over 14 iterations in 910 ms. Result :sat
Minimization took 243 ms.
[2026-05-25 05:01:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:34] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:34] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-25 05:01:34] [INFO ] [Real]Added 32 Read/Feed constraints in 63 ms returned sat
[2026-05-25 05:01:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:34] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:34] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2026-05-25 05:01:34] [INFO ] [Nat]Added 32 Read/Feed constraints in 108 ms returned sat
[2026-05-25 05:01:34] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 05:01:43] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 7444 ms
[2026-05-25 05:01:43] [INFO ] Added : 97 causal constraints over 21 iterations in 8690 ms. Result :sat
Minimization took 495 ms.
[2026-05-25 05:01:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:44] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:44] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-25 05:01:44] [INFO ] [Real]Added 32 Read/Feed constraints in 74 ms returned sat
[2026-05-25 05:01:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 05:01:44] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 7 ms returned sat
[2026-05-25 05:01:44] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2026-05-25 05:01:44] [INFO ] [Nat]Added 32 Read/Feed constraints in 141 ms returned sat
[2026-05-25 05:01:44] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 12 ms.
[2026-05-25 05:01:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3279 ms
[2026-05-25 05:01:50] [INFO ] Added : 141 causal constraints over 29 iterations in 6251 ms. Result :sat
Minimization took 357 ms.
[2026-05-25 05:01:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:51] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:01:51] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-25 05:01:51] [INFO ] [Real]Added 32 Read/Feed constraints in 121 ms returned sat
[2026-05-25 05:01:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:01:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:01:51] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:01:51] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-25 05:01:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 422 ms returned sat
[2026-05-25 05:02:00] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 8688 ms
[2026-05-25 05:02:00] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 9 ms.
[2026-05-25 05:02:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2026-05-25 05:02:02] [INFO ] Added : 135 causal constraints over 27 iterations in 2206 ms. Result :sat
Minimization took 454 ms.
[2026-05-25 05:02:03] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-25 05:02:03] [INFO ] [Real]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2026-05-25 05:02:03] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2026-05-25 05:02:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 05:02:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 05:02:03] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 6 ms returned sat
[2026-05-25 05:02:03] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2026-05-25 05:02:04] [INFO ] [Nat]Added 32 Read/Feed constraints in 645 ms returned sat
[2026-05-25 05:02:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2272 ms
[2026-05-25 05:02:06] [INFO ] Computed and/alt/rep : 193/1079/193 causal constraints (skipped 33 transitions) in 10 ms.
[2026-05-25 05:02:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2026-05-25 05:02:11] [INFO ] Added : 160 causal constraints over 33 iterations in 4535 ms. Result :sat
Minimization took 606 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 170, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, +inf, 1, 1, 170, +inf]
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 223/223 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 223 /223 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2026-05-25 05:02:53] [INFO ] Invariant cache hit.
[2026-05-25 05:02:53] [INFO ] Implicit Places using invariants in 413 ms returned []
[2026-05-25 05:02:53] [INFO ] Invariant cache hit.
[2026-05-25 05:02:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-25 05:02:55] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
[2026-05-25 05:02:55] [INFO ] Redundant transitions in 2 ms returned []
Running 226 sub problems to find dead transitions.
[2026-05-25 05:02:55] [INFO ] Invariant cache hit.
[2026-05-25 05:02:55] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (OVERLAPS) 227/450 variables, 223/293 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 32/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (OVERLAPS) 0/450 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 325 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 223/223 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/223 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 39/70 constraints. Problems are: Problem set: 0 solved, 226 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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695800885"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;