About the Execution of ITS-Tools for EisenbergMcGuire-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16199.987 | 3600000.00 | 5529231.00 | 107525.10 | FFFF?FFF?FFFFFFF | 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.r114-smll-177955740500260.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 EisenbergMcGuire-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740500260
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 12K Mar 7 05:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 05:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 09:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 09:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 05:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 05:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 7 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 753K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779774413109
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 05:46:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 05:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 05:46:55] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2026-05-26 05:46:55] [INFO ] Transformed 414 places.
[2026-05-26 05:46:55] [INFO ] Transformed 1296 transitions.
[2026-05-26 05:46:55] [INFO ] Found NUPN structural information;
[2026-05-26 05:46:55] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 393 transition count 1170
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 393 transition count 1170
Applied a total of 42 rules in 109 ms. Remains 393 /414 variables (removed 21) and now considering 1170/1296 (removed 126) transitions.
[2026-05-26 05:46:55] [INFO ] Flow matrix only has 576 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14548148083933392407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15819384864724845260.kers'
[2026-05-26 05:46:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14548148083933392407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15819384864724845260.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 576 rows 393 cols 1320 entries
Finished phase 1 with 368 SingleSign rule and 6 generalized
[2026-05-26 05:46:55] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15819384864724845260.kers
Total runtime 5 ms.
[2026-05-26 05:46:56] [INFO ] Implicit Places using invariants in 699 ms returned []
[2026-05-26 05:46:56] [INFO ] Flow matrix only has 576 transitions (discarded 594 similar events)
[2026-05-26 05:46:56] [INFO ] Invariant cache hit.
[2026-05-26 05:46:57] [INFO ] State equation strengthened by 209 read => feed constraints.
[2026-05-26 05:46:58] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2312 ms to find 0 implicit places.
Running 1164 sub problems to find dead transitions.
[2026-05-26 05:46:58] [INFO ] Flow matrix only has 576 transitions (discarded 594 similar events)
[2026-05-26 05:46:58] [INFO ] Invariant cache hit.
[2026-05-26 05:46:58] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/969 variables, and 59 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/393 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 1164/1164 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1164 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/969 variables, and 81 constraints, problems are : Problem set: 0 solved, 1164 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/393 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 0/1164 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60838ms problems are : Problem set: 0 solved, 1164 unsolved
Search for dead transitions found 0 dead transitions in 60881ms
Starting structural reductions in LTL mode, iteration 1 : 393/414 places, 1170/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63379 ms. Remains : 393/414 places, 1170/1296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Applied a total of 0 rules in 13 ms. Remains 393 /393 variables (removed 0) and now considering 1170/1170 (removed 0) transitions.
[2026-05-26 05:47:59] [INFO ] Flow matrix only has 576 transitions (discarded 594 similar events)
[2026-05-26 05:47:59] [INFO ] Invariant cache hit.
[2026-05-26 05:47:59] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-26 05:47:59] [INFO ] Flow matrix only has 576 transitions (discarded 594 similar events)
[2026-05-26 05:47:59] [INFO ] Invariant cache hit.
[2026-05-26 05:47:59] [INFO ] State equation strengthened by 209 read => feed constraints.
[2026-05-26 05:48:00] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1617 ms. Remains : 393/393 places, 1170/1170 transitions.
Support contains 57 out of 393 places after structural reductions.
[2026-05-26 05:48:01] [INFO ] Flatten gal took : 137 ms
[2026-05-26 05:48:01] [INFO ] Flatten gal took : 91 ms
[2026-05-26 05:48:01] [INFO ] Input system was already deterministic with 1170 transitions.
RANDOM walk for 40000 steps (8 resets) in 1778 ms. (22 steps per ms) remains 28/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
[2026-05-26 05:48:02] [INFO ] Flow matrix only has 576 transitions (discarded 594 similar events)
[2026-05-26 05:48:02] [INFO ] Invariant cache hit.
[2026-05-26 05:48:02] [INFO ] State equation strengthened by 209 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 237/285 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 108/393 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 13/32 constraints. Problems are: Problem set: 0 solved, 28 unsolved
SMT process timed out in 5127ms, After SMT, problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 393 transition count 1166
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 389 transition count 1166
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 8 place count 389 transition count 1058
Deduced a syphon composed of 108 places in 2 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 224 place count 281 transition count 1058
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 284 place count 251 transition count 1028
Applied a total of 284 rules in 163 ms. Remains 251 /393 variables (removed 142) and now considering 1028/1170 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 251/393 places, 1028/1170 transitions.
RANDOM walk for 40000 steps (8 resets) in 649 ms. (61 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 171885 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :10 out of 28
Probabilistic random walk after 171885 steps, saw 67906 distinct states, run finished after 3012 ms. (steps per millisecond=57 ) properties seen :10
[2026-05-26 05:48:11] [INFO ] Flow matrix only has 434 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11394978543130341388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9790738496135357791.kers'
[2026-05-26 05:48:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11394978543130341388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9790738496135357791.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 434 rows 251 cols 1036 entries
Finished phase 1 with 226 SingleSign rule and 6 generalized
[2026-05-26 05:48:11] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9790738496135357791.kers
Total runtime 2 ms.
[2026-05-26 05:48:11] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 167/202 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 49/251 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 434/685 variables, 251/292 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 209/501 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/685 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/685 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 685/685 variables, and 501 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6202 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 251/251 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 167/202 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 49/251 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 434/685 variables, 251/298 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/685 variables, 209/507 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 18/525 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/685 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/685 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 685/685 variables, and 525 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5354 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 251/251 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11585ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 2 properties in 2326 ms.
Support contains 34 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 1028/1028 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 251 transition count 1024
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 247 transition count 1024
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 15 place count 240 transition count 982
Iterating global reduction 0 with 7 rules applied. Total rules applied 22 place count 240 transition count 982
Applied a total of 22 rules in 61 ms. Remains 240 /251 variables (removed 11) and now considering 982/1028 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 240/251 places, 982/1028 transitions.
RANDOM walk for 40000 steps (8 resets) in 336 ms. (118 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 232015 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :1 out of 16
Probabilistic random walk after 232015 steps, saw 75972 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :1
[2026-05-26 05:48:28] [INFO ] Flow matrix only has 388 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12620487283603780216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4475484461614694708.kers'
[2026-05-26 05:48:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12620487283603780216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4475484461614694708.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 388 rows 240 cols 944 entries
Finished phase 1 with 215 SingleSign rule and 6 generalized
[2026-05-26 05:48:28] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4475484461614694708.kers
Total runtime 2 ms.
[2026-05-26 05:48:28] [INFO ] State equation strengthened by 174 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 165/198 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 42/240 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 388/628 variables, 240/277 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/628 variables, 174/451 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 1/452 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/628 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/628 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 453 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5383 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 240/240 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 165/198 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 42/240 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 388/628 variables, 240/281 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/628 variables, 174/455 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/628 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/628 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/628 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (OVERLAPS) 0/628 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 628/628 variables, and 472 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5723 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 240/240 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11134ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 2 properties in 15834 ms.
Support contains 28 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 982/982 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 238 transition count 970
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 238 transition count 970
Applied a total of 4 rules in 50 ms. Remains 238 /240 variables (removed 2) and now considering 970/982 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 238/240 places, 970/982 transitions.
RANDOM walk for 40000 steps (8 resets) in 286 ms. (139 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 268065 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :1 out of 13
Probabilistic random walk after 268065 steps, saw 80344 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :1
[2026-05-26 05:48:58] [INFO ] Flow matrix only has 376 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8342074693791459604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1954588256012488267.kers'
[2026-05-26 05:48:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8342074693791459604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1954588256012488267.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 376 rows 238 cols 920 entries
Finished phase 1 with 213 SingleSign rule and 6 generalized
[2026-05-26 05:48:58] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1954588256012488267.kers
Total runtime 2 ms.
[2026-05-26 05:48:58] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 169/196 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 42/238 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 376/614 variables, 238/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 164/441 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/614 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/614 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/614 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/614 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 442 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4662 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/238 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 169/196 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 42/238 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 376/614 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 164/447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 12/459 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/614 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 459 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3290 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/238 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7984ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 7635 ms.
Support contains 27 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 970/970 transitions.
Applied a total of 0 rules in 39 ms. Remains 238 /238 variables (removed 0) and now considering 970/970 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 238/238 places, 970/970 transitions.
RANDOM walk for 40000 steps (8 resets) in 401 ms. (99 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 224868 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 12
Probabilistic random walk after 224868 steps, saw 71133 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2026-05-26 05:49:18] [INFO ] Flow matrix only has 376 transitions (discarded 594 similar events)
[2026-05-26 05:49:18] [INFO ] Invariant cache hit.
[2026-05-26 05:49:18] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 169/196 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 42/238 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 376/614 variables, 238/277 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 164/441 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/614 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/614 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/614 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/614 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/614 variables, and 442 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5401 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/238 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 169/196 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 42/238 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 376/614 variables, 238/283 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 164/447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 12/459 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/614 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/614 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/614 variables, and 459 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3183 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/238 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8604ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 9035 ms.
Support contains 27 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 970/970 transitions.
Applied a total of 0 rules in 29 ms. Remains 238 /238 variables (removed 0) and now considering 970/970 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 238/238 places, 970/970 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 970/970 transitions.
Applied a total of 0 rules in 28 ms. Remains 238 /238 variables (removed 0) and now considering 970/970 (removed 0) transitions.
[2026-05-26 05:49:35] [INFO ] Flow matrix only has 376 transitions (discarded 594 similar events)
[2026-05-26 05:49:35] [INFO ] Invariant cache hit.
[2026-05-26 05:49:36] [INFO ] Implicit Places using invariants in 329 ms returned []
[2026-05-26 05:49:36] [INFO ] Flow matrix only has 376 transitions (discarded 594 similar events)
[2026-05-26 05:49:36] [INFO ] Invariant cache hit.
[2026-05-26 05:49:36] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 05:49:37] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2026-05-26 05:49:37] [INFO ] Redundant transitions in 71 ms returned []
Running 964 sub problems to find dead transitions.
[2026-05-26 05:49:37] [INFO ] Flow matrix only has 376 transitions (discarded 594 similar events)
[2026-05-26 05:49:37] [INFO ] Invariant cache hit.
[2026-05-26 05:49:37] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 964 unsolved
SMT process timed out in 30260ms, After SMT, problems are : Problem set: 0 solved, 964 unsolved
Search for dead transitions found 0 dead transitions in 30263ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31671 ms. Remains : 238/238 places, 970/970 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 393 transition count 1165
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 388 transition count 1165
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 388 transition count 1051
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 274 transition count 1051
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 247 place count 265 transition count 997
Iterating global reduction 2 with 9 rules applied. Total rules applied 256 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 316 place count 235 transition count 967
Applied a total of 316 rules in 127 ms. Remains 235 /393 variables (removed 158) and now considering 967/1170 (removed 203) transitions.
[2026-05-26 05:50:08] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6223417702469473046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9943224016905462720.kers'
[2026-05-26 05:50:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6223417702469473046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9943224016905462720.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 373 rows 235 cols 914 entries
Finished phase 1 with 210 SingleSign rule and 6 generalized
[2026-05-26 05:50:08] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9943224016905462720.kers
Total runtime 2 ms.
[2026-05-26 05:50:08] [INFO ] Implicit Places using invariants in 355 ms returned []
[2026-05-26 05:50:08] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2026-05-26 05:50:08] [INFO ] Invariant cache hit.
[2026-05-26 05:50:08] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 05:50:09] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2026-05-26 05:50:09] [INFO ] Redundant transitions in 18 ms returned []
Running 961 sub problems to find dead transitions.
[2026-05-26 05:50:09] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2026-05-26 05:50:09] [INFO ] Invariant cache hit.
[2026-05-26 05:50:09] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 75 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/112 constraints. Problems are: Problem set: 0 solved, 961 unsolved
SMT process timed out in 60332ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in SI_LTL mode, iteration 1 : 235/393 places, 967/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61839 ms. Remains : 235/393 places, 967/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 206 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 435 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-00 finished in 62575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&X(!p1)) U (G((!p0&&X(!p1)))||(!p0&&X(!p1)&&(X((p2||G(!p2))) U ((!p3&&X((p2||G(!p2))))||X(G((p2||G(!p2)))))))))))'
Support contains 7 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 386 transition count 1128
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 386 transition count 1128
Applied a total of 14 rules in 29 ms. Remains 386 /393 variables (removed 7) and now considering 1128/1170 (removed 42) transitions.
[2026-05-26 05:51:10] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5042121874799304185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10840184086648392542.kers'
[2026-05-26 05:51:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5042121874799304185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10840184086648392542.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 534 rows 386 cols 1236 entries
Finished phase 1 with 361 SingleSign rule and 6 generalized
[2026-05-26 05:51:10] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10840184086648392542.kers
Total runtime 3 ms.
[2026-05-26 05:51:10] [INFO ] Implicit Places using invariants in 480 ms returned []
[2026-05-26 05:51:10] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2026-05-26 05:51:10] [INFO ] Invariant cache hit.
[2026-05-26 05:51:11] [INFO ] State equation strengthened by 174 read => feed constraints.
[2026-05-26 05:51:12] [INFO ] Implicit Places using invariants and state equation in 1811 ms returned []
Implicit Place search using SMT with State Equation took 2300 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2026-05-26 05:51:12] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2026-05-26 05:51:12] [INFO ] Invariant cache hit.
[2026-05-26 05:51:12] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/920 variables, and 59 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/386 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 1122/1122 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 60273ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Starting structural reductions in LTL mode, iteration 1 : 386/393 places, 1128/1170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62611 ms. Remains : 386/393 places, 1128/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&X(!p1)) U (G((!p0&&X(!p1)))||(!p0&&X(!p1)&&(X((p2||G(!p2))) U ((!p3&&X((p2||G(!p2))))||X(G((p2||G(!p2)))))))))))'
Stuttering acceptance computed with spot in 493 ms :[true, (OR p0 p1), p1, p1, (OR p0 p1), false, false, false, false, (AND p1 p2), (AND p1 p2), p2]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 384 ms.
Product exploration explored 100000 steps with 0 reset in 472 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 16 factoid took 110 ms. Reduced automaton from 12 states, 45 edges and 4 AP (stutter sensitive) to 11 states, 32 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 584 ms. (68 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 143661 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :9 out of 16
Probabilistic random walk after 143661 steps, saw 92775 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :9
[2026-05-26 05:52:17] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2026-05-26 05:52:17] [INFO ] Invariant cache hit.
[2026-05-26 05:52:17] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 44/143 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf6 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 6 (OVERLAPS) 54/197 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 303/500 variables, 197/209 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 56/265 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/265 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 54/554 variables, 24/289 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 15/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 0/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 105/659 variables, 3/307 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/659 variables, 0/307 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/665 variables, 3/310 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 54/719 variables, 3/313 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/719 variables, 0/313 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 201/920 variables, 165/478 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/920 variables, 103/581 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/920 variables, 0/581 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/920 variables, 0/581 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 581 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1355 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 386/386 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 44/143 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 54/197 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 303/500 variables, 197/210 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 56/266 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 0/266 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 54/554 variables, 24/290 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 15/305 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 0/305 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 105/659 variables, 3/308 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/659 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/665 variables, 3/311 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/665 variables, 5/316 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 4/320 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 0/320 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 54/719 variables, 3/323 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/719 variables, 1/324 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/719 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 201/920 variables, 165/489 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/920 variables, 103/592 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/920 variables, 0/592 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/920 variables, 0/592 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 592 constraints, problems are : Problem set: 2 solved, 5 unsolved in 3282 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 386/386 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4654ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1086 ms.
Support contains 7 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 1128/1128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 386 transition count 1122
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 380 transition count 1122
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 380 transition count 1009
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 267 transition count 1009
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 237 transition count 979
Applied a total of 298 rules in 58 ms. Remains 237 /386 variables (removed 149) and now considering 979/1128 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 237/386 places, 979/1128 transitions.
RANDOM walk for 40000 steps (8 resets) in 280 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 280518 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 5
Probabilistic random walk after 280518 steps, saw 87545 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2026-05-26 05:52:27] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5648695033245880972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15711016311837247325.kers'
[2026-05-26 05:52:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5648695033245880972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15711016311837247325.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 385 rows 237 cols 938 entries
Finished phase 1 with 212 SingleSign rule and 6 generalized
[2026-05-26 05:52:27] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15711016311837247325.kers
Total runtime 2 ms.
[2026-05-26 05:52:27] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 65/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 21/123 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 229/352 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 56/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 54/406 variables, 24/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 18/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 63/469 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/475 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 21/496 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/496 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 126/622 variables, 90/331 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/622 variables, 100/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/622 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/622 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 431 constraints, problems are : Problem set: 0 solved, 5 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 237/237 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 65/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 21/123 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 229/352 variables, 123/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 56/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 54/406 variables, 24/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 18/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 63/469 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/469 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/475 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/475 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/475 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/475 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 21/496 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/496 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 126/622 variables, 90/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 100/444 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/622 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/622 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 622/622 variables, and 444 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2538 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 237/237 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3404ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 598 ms.
Support contains 7 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 979/979 transitions.
Applied a total of 0 rules in 27 ms. Remains 237 /237 variables (removed 0) and now considering 979/979 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 237/237 places, 979/979 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 979/979 transitions.
Applied a total of 0 rules in 27 ms. Remains 237 /237 variables (removed 0) and now considering 979/979 (removed 0) transitions.
[2026-05-26 05:52:31] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
[2026-05-26 05:52:31] [INFO ] Invariant cache hit.
[2026-05-26 05:52:31] [INFO ] Implicit Places using invariants in 393 ms returned []
[2026-05-26 05:52:31] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
[2026-05-26 05:52:31] [INFO ] Invariant cache hit.
[2026-05-26 05:52:31] [INFO ] State equation strengthened by 174 read => feed constraints.
[2026-05-26 05:52:32] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
[2026-05-26 05:52:32] [INFO ] Redundant transitions in 15 ms returned []
Running 973 sub problems to find dead transitions.
[2026-05-26 05:52:32] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
[2026-05-26 05:52:32] [INFO ] Invariant cache hit.
[2026-05-26 05:52:32] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 973 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 237/622 variables, and 60 constraints, problems are : Problem set: 0 solved, 973 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/237 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 973/973 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 973 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 973 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/622 variables, and 77 constraints, problems are : Problem set: 0 solved, 973 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/237 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 0/973 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 973 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61837 ms. Remains : 237/237 places, 979/979 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 859 edges and 237 vertex of which 36 / 237 are part of one of the 6 SCC in 3 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Ensure Unique test removed 580 transitions
Reduce isomorphic transitions removed 690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 207 transition count 243
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 161 transition count 243
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 93 place count 161 transition count 231
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 122 place count 144 transition count 231
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 238 place count 86 transition count 173
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 266 place count 86 transition count 145
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 278 place count 80 transition count 149
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 283 place count 80 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 292 place count 80 transition count 135
Free-agglomeration rule applied 27 times.
Iterating global reduction 4 with 27 rules applied. Total rules applied 319 place count 80 transition count 108
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 346 place count 53 transition count 108
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 353 place count 53 transition count 108
Applied a total of 353 rules in 48 ms. Remains 53 /237 variables (removed 184) and now considering 108/979 (removed 871) transitions.
Running SMT prover for 5 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8495190028015411348.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-807585911477981083.kers'
[2026-05-26 05:53:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8495190028015411348.kers, --Pflows, --basisKERS=/tmp/petrispot-output-807585911477981083.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 108 rows 48 cols 362 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-26 05:53:32] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-807585911477981083.kers
Total runtime 1 ms.
[2026-05-26 05:53:33] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-26 05:53:33] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 05:53:33] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2026-05-26 05:53:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-26 05:53:33] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 05:53:33] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2026-05-26 05:53:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 05:53:33] [INFO ] After 46ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2026-05-26 05:53:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
TRAPS : Iteration 1
[2026-05-26 05:53:33] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2026-05-26 05:53:33] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 616 ms.
Found 2 invariant AP formulas.
Knowledge based reduction with 18 factoid took 233 ms. Reduced automaton from 11 states, 32 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[true, p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, (AND p1 p2), (AND p1 p2)]
Knowledge-based reduction took 79707 ms.
Stuttering acceptance computed with spot in 381 ms :[true, p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, (AND p1 p2), (AND p1 p2)]
Support contains 7 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 1128/1128 transitions.
Applied a total of 0 rules in 24 ms. Remains 386 /386 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
[2026-05-26 05:53:34] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1776156152236846695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7877114534654908694.kers'
[2026-05-26 05:53:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1776156152236846695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7877114534654908694.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 534 rows 386 cols 1236 entries
Finished phase 1 with 361 SingleSign rule and 6 generalized
[2026-05-26 05:53:34] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7877114534654908694.kers
Total runtime 3 ms.
[2026-05-26 05:53:35] [INFO ] Implicit Places using invariants in 436 ms returned []
[2026-05-26 05:53:35] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2026-05-26 05:53:35] [INFO ] Invariant cache hit.
[2026-05-26 05:53:35] [INFO ] State equation strengthened by 174 read => feed constraints.
[2026-05-26 05:53:36] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2026-05-26 05:53:36] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2026-05-26 05:53:36] [INFO ] Invariant cache hit.
[2026-05-26 05:53:36] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/920 variables, and 59 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/386 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 1122/1122 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/920 variables, and 99 constraints, problems are : Problem set: 0 solved, 1122 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/386 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 0/1122 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Finished structural reductions in LTL mode , in 1 iterations and 62617 ms. Remains : 386/386 places, 1128/1128 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 444 ms. (89 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
[2026-05-26 05:54:37] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2026-05-26 05:54:37] [INFO ] Invariant cache hit.
[2026-05-26 05:54:37] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 44/143 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 54/197 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 303/500 variables, 197/208 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/500 variables, 56/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 54/554 variables, 24/288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 15/303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/554 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 105/659 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/659 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 6/665 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/665 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 54/719 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/719 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 201/920 variables, 165/477 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/920 variables, 103/580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/920 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 0/920 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 920/920 variables, and 580 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2158 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 386/386 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 92/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 44/143 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 54/197 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 303/500 variables, 197/210 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/500 variables, 56/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/500 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/500 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 54/554 variables, 24/291 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/554 variables, 15/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/554 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 105/659 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/659 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 6/665 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/665 variables, 8/320 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/665 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/665 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/665 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 54/719 variables, 3/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/719 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 201/920 variables, 165/492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/920 variables, 103/595 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/920 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 0/920 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 920/920 variables, and 595 constraints, problems are : Problem set: 0 solved, 9 unsolved in 4893 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 386/386 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7073ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 2 properties in 1925 ms.
Support contains 7 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 1128/1128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 386 transition count 1122
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 380 transition count 1122
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 380 transition count 1009
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 267 transition count 1009
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 237 transition count 979
Applied a total of 298 rules in 60 ms. Remains 237 /386 variables (removed 149) and now considering 979/1128 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 237/386 places, 979/1128 transitions.
RANDOM walk for 40000 steps (8 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 267036 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :2 out of 7
Probabilistic random walk after 267036 steps, saw 84011 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :2
[2026-05-26 05:54:50] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4468672575429655811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9973015218930992970.kers'
[2026-05-26 05:54:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4468672575429655811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9973015218930992970.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 385 rows 237 cols 938 entries
Finished phase 1 with 212 SingleSign rule and 6 generalized
[2026-05-26 05:54:50] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9973015218930992970.kers
Total runtime 3 ms.
[2026-05-26 05:54:50] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 65/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 21/123 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 229/352 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 56/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 54/406 variables, 24/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 18/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 63/469 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/475 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 21/496 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/496 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 126/622 variables, 90/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/622 variables, 100/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/622 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/622 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 432 constraints, problems are : Problem set: 0 solved, 5 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 237/237 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 65/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 21/123 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 229/352 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 56/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 54/406 variables, 24/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 18/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 63/469 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/475 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/475 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/475 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 21/496 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/496 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 126/622 variables, 90/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/622 variables, 100/443 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/622 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 622/622 variables, and 443 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2164 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 237/237 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3142ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 938 ms.
Support contains 7 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 979/979 transitions.
Applied a total of 0 rules in 30 ms. Remains 237 /237 variables (removed 0) and now considering 979/979 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 237/237 places, 979/979 transitions.
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 286363 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 5
Probabilistic random walk after 286363 steps, saw 89027 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2026-05-26 05:54:57] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
[2026-05-26 05:54:57] [INFO ] Invariant cache hit.
[2026-05-26 05:54:57] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 65/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 21/123 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 229/352 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 56/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 54/406 variables, 24/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 18/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 63/469 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/475 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 21/496 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/496 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 126/622 variables, 90/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/622 variables, 100/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/622 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/622 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 622/622 variables, and 432 constraints, problems are : Problem set: 0 solved, 5 unsolved in 892 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 237/237 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 65/72 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 30/102 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 21/123 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 229/352 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 56/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 54/406 variables, 24/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 18/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 63/469 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/475 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/475 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/475 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 21/496 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/496 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 126/622 variables, 90/343 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/622 variables, 100/443 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/622 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/622 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 622/622 variables, and 443 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2175 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 237/237 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3079ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 622 ms.
Support contains 7 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 979/979 transitions.
Applied a total of 0 rules in 26 ms. Remains 237 /237 variables (removed 0) and now considering 979/979 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 237/237 places, 979/979 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 979/979 transitions.
Applied a total of 0 rules in 24 ms. Remains 237 /237 variables (removed 0) and now considering 979/979 (removed 0) transitions.
[2026-05-26 05:55:01] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
[2026-05-26 05:55:01] [INFO ] Invariant cache hit.
[2026-05-26 05:55:01] [INFO ] Implicit Places using invariants in 449 ms returned []
[2026-05-26 05:55:01] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
[2026-05-26 05:55:01] [INFO ] Invariant cache hit.
[2026-05-26 05:55:01] [INFO ] State equation strengthened by 174 read => feed constraints.
[2026-05-26 05:55:02] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
[2026-05-26 05:55:02] [INFO ] Redundant transitions in 15 ms returned []
Running 973 sub problems to find dead transitions.
[2026-05-26 05:55:02] [INFO ] Flow matrix only has 385 transitions (discarded 594 similar events)
[2026-05-26 05:55:02] [INFO ] Invariant cache hit.
[2026-05-26 05:55:02] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 973 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 237/622 variables, and 72 constraints, problems are : Problem set: 0 solved, 973 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/237 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 973/973 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 973 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 53/72 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 973 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 13/105 constraints. Problems are: Problem set: 0 solved, 973 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/622 variables, and 106 constraints, problems are : Problem set: 0 solved, 973 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/237 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 0/973 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 973 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61925 ms. Remains : 237/237 places, 979/979 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 859 edges and 237 vertex of which 36 / 237 are part of one of the 6 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Ensure Unique test removed 580 transitions
Reduce isomorphic transitions removed 690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 207 transition count 243
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 161 transition count 243
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 93 place count 161 transition count 231
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 122 place count 144 transition count 231
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 238 place count 86 transition count 173
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 266 place count 86 transition count 145
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 278 place count 80 transition count 149
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 283 place count 80 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 292 place count 80 transition count 135
Free-agglomeration rule applied 27 times.
Iterating global reduction 4 with 27 rules applied. Total rules applied 319 place count 80 transition count 108
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 346 place count 53 transition count 108
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 353 place count 53 transition count 108
Applied a total of 353 rules in 26 ms. Remains 53 /237 variables (removed 184) and now considering 108/979 (removed 871) transitions.
Running SMT prover for 5 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1842010390764471720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12780129368225072285.kers'
[2026-05-26 05:56:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1842010390764471720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12780129368225072285.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 108 rows 48 cols 362 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-26 05:56:03] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12780129368225072285.kers
Total runtime 2 ms.
[2026-05-26 05:56:03] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2026-05-26 05:56:03] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 05:56:03] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2026-05-26 05:56:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2026-05-26 05:56:03] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 05:56:03] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2026-05-26 05:56:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 05:56:03] [INFO ] After 47ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2026-05-26 05:56:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2026-05-26 05:56:03] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2026-05-26 05:56:03] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 591 ms.
Knowledge based reduction with 1 factoid took 205 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 10 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[true, p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, (AND p1 p2), (AND p1 p2)]
Knowledge-based reduction took 87128 ms.
Stuttering acceptance computed with spot in 441 ms :[true, p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 448 ms :[true, p2, (AND p1 p2), (AND p1 p2), (AND p1 p2), false, false, false, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 0 reset in 298 ms.
Product exploration explored 100000 steps with 0 reset in 472 ms.
Spot run failed in 117 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
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)
Built C files in :
/tmp/ltsmin6391669555241050411
[2026-05-26 05:56:06] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6391669555241050411
Running compilation step : cd /tmp/ltsmin6391669555241050411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6391669555241050411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6391669555241050411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 1128/1128 transitions.
Applied a total of 0 rules in 8 ms. Remains 386 /386 variables (removed 0) and now considering 1128/1128 (removed 0) transitions.
[2026-05-26 05:56:09] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14496841593971719561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16785562688089861319.kers'
[2026-05-26 05:56:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14496841593971719561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16785562688089861319.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 534 rows 386 cols 1236 entries
Finished phase 1 with 361 SingleSign rule and 6 generalized
[2026-05-26 05:56:09] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16785562688089861319.kers
Total runtime 3 ms.
[2026-05-26 05:56:09] [INFO ] Implicit Places using invariants in 549 ms returned []
[2026-05-26 05:56:09] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2026-05-26 05:56:09] [INFO ] Invariant cache hit.
[2026-05-26 05:56:10] [INFO ] State equation strengthened by 174 read => feed constraints.
[2026-05-26 05:56:11] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 2589 ms to find 0 implicit places.
Running 1122 sub problems to find dead transitions.
[2026-05-26 05:56:11] [INFO ] Flow matrix only has 534 transitions (discarded 594 similar events)
[2026-05-26 05:56:11] [INFO ] Invariant cache hit.
[2026-05-26 05:56:11] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1122 unsolved
SMT process timed out in 30524ms, After SMT, problems are : Problem set: 0 solved, 1122 unsolved
Search for dead transitions found 0 dead transitions in 30528ms
Finished structural reductions in LTL mode , in 1 iterations and 33132 ms. Remains : 386/386 places, 1128/1128 transitions.
Built C files in :
/tmp/ltsmin7887422369354343896
[2026-05-26 05:56:42] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7887422369354343896
Running compilation step : cd /tmp/ltsmin7887422369354343896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7887422369354343896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7887422369354343896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 05:56:45] [INFO ] Flatten gal took : 59 ms
[2026-05-26 05:56:45] [INFO ] Flatten gal took : 49 ms
[2026-05-26 05:56:45] [INFO ] Time to serialize gal into /tmp/LTL10801980966328092394.gal : 14 ms
[2026-05-26 05:56:45] [INFO ] Time to serialize properties into /tmp/LTL12012667683583083088.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10801980966328092394.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15521727199927354309.hoa' '-atoms' '/tmp/LTL12012667683583083088.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12012667683583083088.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15521727199927354309.hoa
Detected timeout of ITS tools.
[2026-05-26 05:57:00] [INFO ] Flatten gal took : 44 ms
[2026-05-26 05:57:00] [INFO ] Flatten gal took : 56 ms
[2026-05-26 05:57:00] [INFO ] Time to serialize gal into /tmp/LTL14602281907996961759.gal : 12 ms
[2026-05-26 05:57:00] [INFO ] Time to serialize properties into /tmp/LTL1968672843086066384.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14602281907996961759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1968672843086066384.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(((!("((turn_5==1)&&(p10_5_3==1))"))&&(X(!("((turn_5==1)&&(p10_5_2==1))"))))U((G((!("((turn_5==1)&&(p10_5_3==1))"))&&(X(!("((turn_...591
Formula 0 simplified : X(("((turn_5==1)&&(p10_5_3==1))" | X"((turn_5==1)&&(p10_5_2==1))") M ("((turn_5==1)&&(p10_5_3==1))" | X"((turn_5==1)&&(p10_5_2==1))"...455
Detected timeout of ITS tools.
[2026-05-26 05:57:16] [INFO ] Flatten gal took : 40 ms
[2026-05-26 05:57:16] [INFO ] Applying decomposition
[2026-05-26 05:57:16] [INFO ] Flatten gal took : 39 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/graph10733634130835110348.txt' '-o' '/tmp/graph10733634130835110348.bin' '-w' '/tmp/graph10733634130835110348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10733634130835110348.bin' '-l' '-1' '-v' '-w' '/tmp/graph10733634130835110348.weights' '-q' '0' '-e' '0.001'
[2026-05-26 05:57:16] [INFO ] Decomposing Gal with order
[2026-05-26 05:57:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 05:57:16] [INFO ] Removed a total of 1907 redundant transitions.
[2026-05-26 05:57:16] [INFO ] Flatten gal took : 292 ms
[2026-05-26 05:57:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 76 ms.
[2026-05-26 05:57:16] [INFO ] Time to serialize gal into /tmp/LTL8349057994061893456.gal : 19 ms
[2026-05-26 05:57:16] [INFO ] Time to serialize properties into /tmp/LTL12074022853975551860.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8349057994061893456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12074022853975551860.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(((!("((i14.u88.turn_5==1)&&(i0.u24.p10_5_3==1))"))&&(X(!("((i14.u88.turn_5==1)&&(i0.u25.p10_5_2==1))"))))U((G((!("((i14.u88.turn_...837
Formula 0 simplified : X(("((i14.u88.turn_5==1)&&(i0.u24.p10_5_3==1))" | X"((i14.u88.turn_5==1)&&(i0.u25.p10_5_2==1))") M ("((i14.u88.turn_5==1)&&(i0.u24.p...671
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 381539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 1164
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 387 transition count 1164
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 387 transition count 1050
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 273 transition count 1050
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 247 place count 266 transition count 1008
Iterating global reduction 2 with 7 rules applied. Total rules applied 254 place count 266 transition count 1008
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 314 place count 236 transition count 978
Applied a total of 314 rules in 56 ms. Remains 236 /393 variables (removed 157) and now considering 978/1170 (removed 192) transitions.
[2026-05-26 05:57:32] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8646882894966050234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12958051000571345724.kers'
[2026-05-26 05:57:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8646882894966050234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12958051000571345724.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 236 cols 936 entries
Finished phase 1 with 211 SingleSign rule and 6 generalized
[2026-05-26 05:57:32] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12958051000571345724.kers
Total runtime 2 ms.
[2026-05-26 05:57:32] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-26 05:57:32] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2026-05-26 05:57:32] [INFO ] Invariant cache hit.
[2026-05-26 05:57:32] [INFO ] State equation strengthened by 174 read => feed constraints.
[2026-05-26 05:57:33] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2026-05-26 05:57:33] [INFO ] Redundant transitions in 16 ms returned []
Running 972 sub problems to find dead transitions.
[2026-05-26 05:57:33] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2026-05-26 05:57:33] [INFO ] Invariant cache hit.
[2026-05-26 05:57:33] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 972 unsolved
SMT process timed out in 30384ms, After SMT, problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 30387ms
Starting structural reductions in SI_LTL mode, iteration 1 : 236/393 places, 978/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31903 ms. Remains : 236/393 places, 978/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 329 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-02 finished in 32406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 384 transition count 1116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 384 transition count 1116
Applied a total of 18 rules in 20 ms. Remains 384 /393 variables (removed 9) and now considering 1116/1170 (removed 54) transitions.
[2026-05-26 05:58:04] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2222021655848535792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17862676483446922519.kers'
[2026-05-26 05:58:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2222021655848535792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17862676483446922519.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 522 rows 384 cols 1212 entries
Finished phase 1 with 359 SingleSign rule and 6 generalized
[2026-05-26 05:58:04] [INFO ] Computed 19 invariants in 4 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17862676483446922519.kers
Total runtime 5 ms.
[2026-05-26 05:58:05] [INFO ] Implicit Places using invariants in 726 ms returned []
[2026-05-26 05:58:05] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 05:58:05] [INFO ] Invariant cache hit.
[2026-05-26 05:58:05] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 05:58:06] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2026-05-26 05:58:06] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 05:58:06] [INFO ] Invariant cache hit.
[2026-05-26 05:58:06] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 86 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Starting structural reductions in LTL mode, iteration 1 : 384/393 places, 1116/1170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62878 ms. Remains : 384/393 places, 1116/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 266 ms.
Product exploration explored 100000 steps with 0 reset in 376 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 4 factoid took 48 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 516726 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 516726 steps, saw 267821 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2026-05-26 05:59:11] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 05:59:11] [INFO ] Invariant cache hit.
[2026-05-26 05:59:11] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/132 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/346 variables, 132/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 24/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/418 variables, 32/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 140/558 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/566 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 72/638 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/638 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 268/906 variables, 220/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 124/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/132 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/346 variables, 132/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 24/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/418 variables, 32/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 140/558 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/566 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 5/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/638 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/638 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 268/906 variables, 220/450 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 124/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/906 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/906 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 574 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1653ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 43 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 234/384 places, 966/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 583156 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 583156 steps, saw 145352 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2026-05-26 05:59:15] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10672631029302493920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12220401724682258292.kers'
[2026-05-26 05:59:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10672631029302493920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12220401724682258292.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 234 cols 912 entries
Finished phase 1 with 209 SingleSign rule and 6 generalized
[2026-05-26 05:59:15] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12220401724682258292.kers
Total runtime 3 ms.
[2026-05-26 05:59:15] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 84/402 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/410 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 28/438 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 120/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 84/402 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/410 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/438 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 168/606 variables, 120/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 120/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 1 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1551ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 29 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2026-05-26 05:59:17] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 05:59:17] [INFO ] Invariant cache hit.
[2026-05-26 05:59:17] [INFO ] Implicit Places using invariants in 366 ms returned []
[2026-05-26 05:59:17] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 05:59:17] [INFO ] Invariant cache hit.
[2026-05-26 05:59:18] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 05:59:18] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2026-05-26 05:59:18] [INFO ] Redundant transitions in 14 ms returned []
Running 960 sub problems to find dead transitions.
[2026-05-26 05:59:19] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 05:59:19] [INFO ] Invariant cache hit.
[2026-05-26 05:59:19] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 74 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 126 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 107/107 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61685 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 24 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10884171651245165477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1383689803797377975.kers'
[2026-05-26 06:00:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10884171651245165477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1383689803797377975.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 94 rows 39 cols 321 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-26 06:00:19] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1383689803797377975.kers
Total runtime 1 ms.
[2026-05-26 06:00:19] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-26 06:00:19] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 06:00:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2026-05-26 06:00:19] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 06:00:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 06:00:19] [INFO ] After 12ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 06:00:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2026-05-26 06:00:19] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 06:00:19] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 333 ms.
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Knowledge-based reduction took 71690 ms.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Support contains 3 out of 384 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 378 transition count 997
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 235 transition count 967
Applied a total of 298 rules in 46 ms. Remains 235 /384 variables (removed 149) and now considering 967/1116 (removed 149) transitions.
[2026-05-26 06:00:19] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7233729947477377358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17275286834499419331.kers'
[2026-05-26 06:00:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7233729947477377358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17275286834499419331.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 373 rows 235 cols 914 entries
Finished phase 1 with 210 SingleSign rule and 6 generalized
[2026-05-26 06:00:19] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17275286834499419331.kers
Total runtime 3 ms.
[2026-05-26 06:00:20] [INFO ] Implicit Places using invariants in 549 ms returned []
[2026-05-26 06:00:20] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2026-05-26 06:00:20] [INFO ] Invariant cache hit.
[2026-05-26 06:00:20] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:00:21] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
[2026-05-26 06:00:21] [INFO ] Redundant transitions in 16 ms returned []
Running 961 sub problems to find dead transitions.
[2026-05-26 06:00:21] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2026-05-26 06:00:21] [INFO ] Invariant cache hit.
[2026-05-26 06:00:21] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/608 variables, and 101 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60257ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 235/384 places, 967/1116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62145 ms. Remains : 235/384 places, 967/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 530236 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 1
Probabilistic random walk after 530236 steps, saw 135787 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2026-05-26 06:01:25] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2026-05-26 06:01:25] [INFO ] Invariant cache hit.
[2026-05-26 06:01:25] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 84/402 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/410 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 29/439 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/439 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 169/608 variables, 121/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 120/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 84/402 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/410 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 29/439 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/439 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 169/608 variables, 121/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/608 variables, 120/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/608 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/608 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 235 transition count 966
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 234 transition count 966
Applied a total of 2 rules in 25 ms. Remains 234 /235 variables (removed 1) and now considering 966/967 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 234/235 places, 966/967 transitions.
RANDOM walk for 40000 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 554953 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 554953 steps, saw 144719 distinct states, run finished after 3003 ms. (steps per millisecond=184 ) properties seen :0
[2026-05-26 06:01:29] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8130708655757411645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9297648305944943398.kers'
[2026-05-26 06:01:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8130708655757411645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9297648305944943398.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 234 cols 912 entries
Finished phase 1 with 209 SingleSign rule and 6 generalized
[2026-05-26 06:01:29] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9297648305944943398.kers
Total runtime 3 ms.
[2026-05-26 06:01:29] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 84/402 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/410 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 28/438 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 120/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/82 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/246 variables, 82/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/318 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 84/402 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/410 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/410 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/438 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 168/606 variables, 120/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 120/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1596ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 22 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 21 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2026-05-26 06:01:31] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:01:31] [INFO ] Invariant cache hit.
[2026-05-26 06:01:31] [INFO ] Implicit Places using invariants in 393 ms returned []
[2026-05-26 06:01:31] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:01:31] [INFO ] Invariant cache hit.
[2026-05-26 06:01:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:01:32] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2026-05-26 06:01:32] [INFO ] Redundant transitions in 15 ms returned []
Running 960 sub problems to find dead transitions.
[2026-05-26 06:01:32] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:01:32] [INFO ] Invariant cache hit.
[2026-05-26 06:01:32] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
SMT process timed out in 30251ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 30254ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31664 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 281 place count 75 transition count 136
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 286 place count 75 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 292 place count 75 transition count 125
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 323 place count 75 transition count 94
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 354 place count 44 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 360 place count 44 transition count 94
Applied a total of 360 rules in 20 ms. Remains 44 /234 variables (removed 190) and now considering 94/966 (removed 872) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4887469384331611216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10771764508707901066.kers'
[2026-05-26 06:02:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4887469384331611216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10771764508707901066.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 94 rows 39 cols 321 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-26 06:02:03] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10771764508707901066.kers
Total runtime 4 ms.
[2026-05-26 06:02:03] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2026-05-26 06:02:03] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 06:02:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2026-05-26 06:02:03] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 06:02:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 06:02:03] [INFO ] After 7ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 06:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
TRAPS : Iteration 1
[2026-05-26 06:02:03] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 06:02:03] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 229 ms.
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Knowledge-based reduction took 41415 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 217 ms.
Product exploration explored 100000 steps with 0 reset in 271 ms.
Built C files in :
/tmp/ltsmin14628582322020215368
[2026-05-26 06:02:03] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2026-05-26 06:02:03] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:02:03] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2026-05-26 06:02:03] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:02:04] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2026-05-26 06:02:04] [INFO ] Computation of Completed DNA matrix. took 48 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:02:04] [INFO ] Built C files in 251ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14628582322020215368
Running compilation step : cd /tmp/ltsmin14628582322020215368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14628582322020215368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14628582322020215368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 235 transition count 966
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 234 transition count 966
Applied a total of 2 rules in 23 ms. Remains 234 /235 variables (removed 1) and now considering 966/967 (removed 1) transitions.
[2026-05-26 06:02:07] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4929440037681363796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1521433112956755444.kers'
[2026-05-26 06:02:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4929440037681363796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1521433112956755444.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 234 cols 912 entries
Finished phase 1 with 209 SingleSign rule and 6 generalized
[2026-05-26 06:02:07] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1521433112956755444.kers
Total runtime 2 ms.
[2026-05-26 06:02:07] [INFO ] Implicit Places using invariants in 360 ms returned []
[2026-05-26 06:02:07] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:02:07] [INFO ] Invariant cache hit.
[2026-05-26 06:02:07] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:02:08] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
[2026-05-26 06:02:08] [INFO ] Redundant transitions in 19 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 234/235 places, 966/967 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1425 ms. Remains : 234/235 places, 966/967 transitions.
Built C files in :
/tmp/ltsmin1222224802972243673
[2026-05-26 06:02:08] [INFO ] Computing symmetric may disable matrix : 966 transitions.
[2026-05-26 06:02:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:02:08] [INFO ] Computing symmetric may enable matrix : 966 transitions.
[2026-05-26 06:02:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:02:08] [INFO ] Computing Do-Not-Accords matrix : 966 transitions.
[2026-05-26 06:02:08] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:02:08] [INFO ] Built C files in 213ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1222224802972243673
Running compilation step : cd /tmp/ltsmin1222224802972243673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1222224802972243673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1222224802972243673;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 06:02:11] [INFO ] Flatten gal took : 30 ms
[2026-05-26 06:02:11] [INFO ] Flatten gal took : 33 ms
[2026-05-26 06:02:11] [INFO ] Time to serialize gal into /tmp/LTL13380808959144641580.gal : 9 ms
[2026-05-26 06:02:11] [INFO ] Time to serialize properties into /tmp/LTL3100516228662159620.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13380808959144641580.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13860152760474449738.hoa' '-atoms' '/tmp/LTL3100516228662159620.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3100516228662159620.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13860152760474449738.hoa
Detected timeout of ITS tools.
[2026-05-26 06:02:27] [INFO ] Flatten gal took : 24 ms
[2026-05-26 06:02:27] [INFO ] Flatten gal took : 28 ms
[2026-05-26 06:02:27] [INFO ] Time to serialize gal into /tmp/LTL3237860881710111934.gal : 6 ms
[2026-05-26 06:02:27] [INFO ] Time to serialize properties into /tmp/LTL7347682352514700370.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3237860881710111934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7347682352514700370.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("((flag_0_waiting==1)&&(p09_5_0==1))"))||(F(G("(((turn_0!=1)||(flag_0_waiting!=1))||(p25_1_5!=1))"))))))
Formula 0 simplified : X(F!"((flag_0_waiting==1)&&(p09_5_0==1))" & GF!"(((turn_0!=1)||(flag_0_waiting!=1))||(p25_1_5!=1))")
Detected timeout of ITS tools.
[2026-05-26 06:02:42] [INFO ] Flatten gal took : 20 ms
[2026-05-26 06:02:42] [INFO ] Applying decomposition
[2026-05-26 06:02:42] [INFO ] Flatten gal took : 19 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/graph1166900055932708666.txt' '-o' '/tmp/graph1166900055932708666.bin' '-w' '/tmp/graph1166900055932708666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1166900055932708666.bin' '-l' '-1' '-v' '-w' '/tmp/graph1166900055932708666.weights' '-q' '0' '-e' '0.001'
[2026-05-26 06:02:42] [INFO ] Decomposing Gal with order
[2026-05-26 06:02:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 06:02:42] [INFO ] Removed a total of 1759 redundant transitions.
[2026-05-26 06:02:42] [INFO ] Flatten gal took : 96 ms
[2026-05-26 06:02:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 253 labels/synchronizations in 34 ms.
[2026-05-26 06:02:42] [INFO ] Time to serialize gal into /tmp/LTL6444143314139996235.gal : 9 ms
[2026-05-26 06:02:42] [INFO ] Time to serialize properties into /tmp/LTL13987763639819952856.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6444143314139996235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13987763639819952856.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G("((i12.i1.u4.flag_0_waiting==1)&&(u10.p09_5_0==1))"))||(F(G("(((i14.u43.turn_0!=1)||(i12.i1.u4.flag_0_waiting!=1))||(i0.u1.p25...171
Formula 0 simplified : X(F!"((i12.i1.u4.flag_0_waiting==1)&&(u10.p09_5_0==1))" & GF!"(((i14.u43.turn_0!=1)||(i12.i1.u4.flag_0_waiting!=1))||(i0.u1.p25_1_5!...161
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-04 finished in 293174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0))||(G(p1) U p2))) U p3))'
Support contains 10 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 384 transition count 1116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 384 transition count 1116
Applied a total of 18 rules in 11 ms. Remains 384 /393 variables (removed 9) and now considering 1116/1170 (removed 54) transitions.
[2026-05-26 06:02:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8604448940176896533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14358198113108270333.kers'
[2026-05-26 06:02:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8604448940176896533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14358198113108270333.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 522 rows 384 cols 1212 entries
Finished phase 1 with 359 SingleSign rule and 6 generalized
[2026-05-26 06:02:57] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14358198113108270333.kers
Total runtime 4 ms.
[2026-05-26 06:02:57] [INFO ] Implicit Places using invariants in 401 ms returned []
[2026-05-26 06:02:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:02:57] [INFO ] Invariant cache hit.
[2026-05-26 06:02:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:02:59] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2026-05-26 06:02:59] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:02:59] [INFO ] Invariant cache hit.
[2026-05-26 06:02:59] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
SMT process timed out in 60489ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Starting structural reductions in LTL mode, iteration 1 : 384/393 places, 1116/1170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62493 ms. Remains : 384/393 places, 1116/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0))||(G(p1) U p2))) U p3))'
Stuttering acceptance computed with spot in 363 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-06 finished in 62926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 3 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 1164
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 387 transition count 1164
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 387 transition count 1050
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 273 transition count 1050
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 249 place count 264 transition count 996
Iterating global reduction 2 with 9 rules applied. Total rules applied 258 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 318 place count 234 transition count 966
Applied a total of 318 rules in 47 ms. Remains 234 /393 variables (removed 159) and now considering 966/1170 (removed 204) transitions.
[2026-05-26 06:04:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11017034899030445557.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2530470053906749606.kers'
[2026-05-26 06:04:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11017034899030445557.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2530470053906749606.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 234 cols 912 entries
Finished phase 1 with 209 SingleSign rule and 6 generalized
[2026-05-26 06:04:00] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2530470053906749606.kers
Total runtime 3 ms.
[2026-05-26 06:04:00] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-26 06:04:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:04:00] [INFO ] Invariant cache hit.
[2026-05-26 06:04:01] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:04:01] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2026-05-26 06:04:01] [INFO ] Redundant transitions in 15 ms returned []
Running 960 sub problems to find dead transitions.
[2026-05-26 06:04:01] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:04:01] [INFO ] Invariant cache hit.
[2026-05-26 06:04:01] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 77 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 58/77 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 960 unsolved
SMT process timed out in 60395ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60399ms
Starting structural reductions in SI_LTL mode, iteration 1 : 234/393 places, 966/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61911 ms. Remains : 234/393 places, 966/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 209 ms.
Product exploration explored 100000 steps with 0 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 583331 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 583331 steps, saw 145386 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2026-05-26 06:05:06] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:05:06] [INFO ] Invariant cache hit.
[2026-05-26 06:05:06] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/82 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/402 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/410 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 28/438 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 120/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/82 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/402 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/410 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 9/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/438 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 168/606 variables, 120/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 120/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/606 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/606 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1432 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1876ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 59 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 8 ms.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 3 factoid took 33 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 5039 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-07 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-07 finished in 67516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 5 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 384 transition count 1116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 384 transition count 1116
Applied a total of 18 rules in 12 ms. Remains 384 /393 variables (removed 9) and now considering 1116/1170 (removed 54) transitions.
[2026-05-26 06:05:07] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8571132047295480807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-287483345822021956.kers'
[2026-05-26 06:05:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8571132047295480807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-287483345822021956.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 522 rows 384 cols 1212 entries
Finished phase 1 with 359 SingleSign rule and 6 generalized
[2026-05-26 06:05:07] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-287483345822021956.kers
Total runtime 3 ms.
[2026-05-26 06:05:08] [INFO ] Implicit Places using invariants in 470 ms returned []
[2026-05-26 06:05:08] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:05:08] [INFO ] Invariant cache hit.
[2026-05-26 06:05:08] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:05:10] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 2119 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2026-05-26 06:05:10] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:05:10] [INFO ] Invariant cache hit.
[2026-05-26 06:05:10] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 81 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60293ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LTL mode, iteration 1 : 384/393 places, 1116/1170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62431 ms. Remains : 384/393 places, 1116/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||p1)))'
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 321 ms.
Product exploration explored 100000 steps with 0 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 225 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 470827 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 1
Probabilistic random walk after 470827 steps, saw 249898 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2026-05-26 06:06:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:06:14] [INFO ] Invariant cache hit.
[2026-05-26 06:06:14] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/96 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/132 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/346 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/418 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 140/558 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/566 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 72/638 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/638 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 268/906 variables, 220/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 124/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/906 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 569 constraints, problems are : Problem set: 0 solved, 1 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/96 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/132 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/346 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/418 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 140/558 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/566 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/638 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/638 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 268/906 variables, 220/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 124/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/906 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/906 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1906 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2546ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 149 ms.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 62 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 234/384 places, 966/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 518714 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 518714 steps, saw 133934 distinct states, run finished after 3001 ms. (steps per millisecond=172 ) properties seen :0
[2026-05-26 06:06:20] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1726030377344688611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9980654545060449030.kers'
[2026-05-26 06:06:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1726030377344688611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9980654545060449030.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 234 cols 912 entries
Finished phase 1 with 209 SingleSign rule and 6 generalized
[2026-05-26 06:06:20] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9980654545060449030.kers
Total runtime 3 ms.
[2026-05-26 06:06:20] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/82 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/402 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/410 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 28/438 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 120/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 558 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/82 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/402 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/410 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/438 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 168/606 variables, 120/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 120/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2049ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2026-05-26 06:06:22] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:06:22] [INFO ] Invariant cache hit.
[2026-05-26 06:06:22] [INFO ] Implicit Places using invariants in 551 ms returned []
[2026-05-26 06:06:22] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:06:22] [INFO ] Invariant cache hit.
[2026-05-26 06:06:23] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:06:24] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
[2026-05-26 06:06:24] [INFO ] Redundant transitions in 14 ms returned []
Running 960 sub problems to find dead transitions.
[2026-05-26 06:06:24] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:06:24] [INFO ] Invariant cache hit.
[2026-05-26 06:06:24] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 62 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 43/62 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 18/80 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 97 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 78/78 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62507 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 283 place count 74 transition count 136
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 289 place count 74 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 296 place count 74 transition count 123
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 327 place count 74 transition count 92
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 358 place count 43 transition count 92
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 364 place count 43 transition count 92
Applied a total of 364 rules in 15 ms. Remains 43 /234 variables (removed 191) and now considering 92/966 (removed 874) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-178089786754679870.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17677137708545837176.kers'
[2026-05-26 06:07:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-178089786754679870.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17677137708545837176.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 92 rows 37 cols 312 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-26 06:07:24] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17677137708545837176.kers
Total runtime 0 ms.
[2026-05-26 06:07:24] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-26 06:07:24] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 06:07:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-26 06:07:25] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 06:07:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-26 06:07:25] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 06:07:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2026-05-26 06:07:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 2
[2026-05-26 06:07:25] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 06:07:25] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 267 ms.
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 74089 ms.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 384 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 6 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2026-05-26 06:07:25] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1777288131562462205.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11600561349971236595.kers'
[2026-05-26 06:07:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1777288131562462205.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11600561349971236595.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 522 rows 384 cols 1212 entries
Finished phase 1 with 359 SingleSign rule and 6 generalized
[2026-05-26 06:07:25] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11600561349971236595.kers
Total runtime 3 ms.
[2026-05-26 06:07:25] [INFO ] Implicit Places using invariants in 441 ms returned []
[2026-05-26 06:07:25] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:07:25] [INFO ] Invariant cache hit.
[2026-05-26 06:07:26] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:07:27] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2026-05-26 06:07:27] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:07:27] [INFO ] Invariant cache hit.
[2026-05-26 06:07:27] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 86 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60271ms
Finished structural reductions in LTL mode , in 1 iterations and 62345 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 496972 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 1
Probabilistic random walk after 496972 steps, saw 261022 distinct states, run finished after 3005 ms. (steps per millisecond=165 ) properties seen :0
[2026-05-26 06:08:30] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:08:30] [INFO ] Invariant cache hit.
[2026-05-26 06:08:30] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/96 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/132 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/346 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/418 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 140/558 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/566 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 72/638 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/638 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 268/906 variables, 220/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 124/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/906 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 569 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/96 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/132 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 214/346 variables, 132/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 24/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/418 variables, 32/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 140/558 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/566 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 6/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/638 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/638 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 268/906 variables, 220/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 124/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/906 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/906 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1942ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 40 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 234/384 places, 966/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 554169 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 554169 steps, saw 140498 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2026-05-26 06:08:36] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2881719499238057110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13763674051545694540.kers'
[2026-05-26 06:08:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2881719499238057110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13763674051545694540.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 234 cols 912 entries
Finished phase 1 with 209 SingleSign rule and 6 generalized
[2026-05-26 06:08:36] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13763674051545694540.kers
Total runtime 4 ms.
[2026-05-26 06:08:36] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/82 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/402 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/410 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 28/438 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 168/606 variables, 120/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 120/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/68 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/82 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/246 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 72/318 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/402 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/410 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/410 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/410 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 28/438 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/438 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 168/606 variables, 120/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 120/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/606 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 425 constraints, problems are : Problem set: 0 solved, 1 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1349ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2026-05-26 06:08:37] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:08:37] [INFO ] Invariant cache hit.
[2026-05-26 06:08:37] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-26 06:08:37] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:08:37] [INFO ] Invariant cache hit.
[2026-05-26 06:08:38] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:08:38] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2026-05-26 06:08:38] [INFO ] Redundant transitions in 14 ms returned []
Running 960 sub problems to find dead transitions.
[2026-05-26 06:08:38] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2026-05-26 06:08:38] [INFO ] Invariant cache hit.
[2026-05-26 06:08:38] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
SMT process timed out in 30335ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 30337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31814 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 283 place count 74 transition count 136
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 289 place count 74 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 296 place count 74 transition count 123
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 327 place count 74 transition count 92
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 358 place count 43 transition count 92
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 364 place count 43 transition count 92
Applied a total of 364 rules in 13 ms. Remains 43 /234 variables (removed 191) and now considering 92/966 (removed 874) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14524044228778731939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5500324566552376657.kers'
[2026-05-26 06:09:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14524044228778731939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5500324566552376657.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 92 rows 37 cols 312 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-26 06:09:09] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5500324566552376657.kers
Total runtime 0 ms.
[2026-05-26 06:09:09] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-26 06:09:09] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 06:09:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2026-05-26 06:09:09] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 06:09:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-26 06:09:09] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 06:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
TRAPS : Iteration 1
[2026-05-26 06:09:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
TRAPS : Iteration 2
[2026-05-26 06:09:09] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 06:09:09] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 241 ms.
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 41848 ms.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 323 ms.
Spot run failed in 59 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
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)
Built C files in :
/tmp/ltsmin381886693182239380
[2026-05-26 06:09:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin381886693182239380
Running compilation step : cd /tmp/ltsmin381886693182239380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin381886693182239380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin381886693182239380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 8 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2026-05-26 06:09:13] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11256331812740700450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7883125396559524409.kers'
[2026-05-26 06:09:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11256331812740700450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7883125396559524409.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 522 rows 384 cols 1212 entries
Finished phase 1 with 359 SingleSign rule and 6 generalized
[2026-05-26 06:09:13] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7883125396559524409.kers
Total runtime 4 ms.
[2026-05-26 06:09:14] [INFO ] Implicit Places using invariants in 507 ms returned []
[2026-05-26 06:09:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:09:14] [INFO ] Invariant cache hit.
[2026-05-26 06:09:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:09:15] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2172 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2026-05-26 06:09:15] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:09:15] [INFO ] Invariant cache hit.
[2026-05-26 06:09:15] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 81 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60283ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in LTL mode , in 1 iterations and 62469 ms. Remains : 384/384 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin9889061813018309662
[2026-05-26 06:10:16] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9889061813018309662
Running compilation step : cd /tmp/ltsmin9889061813018309662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9889061813018309662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9889061813018309662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-26 06:10:19] [INFO ] Flatten gal took : 37 ms
[2026-05-26 06:10:19] [INFO ] Flatten gal took : 36 ms
[2026-05-26 06:10:19] [INFO ] Time to serialize gal into /tmp/LTL2278875903171043599.gal : 8 ms
[2026-05-26 06:10:19] [INFO ] Time to serialize properties into /tmp/LTL7591448079293067136.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2278875903171043599.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5959219450785542024.hoa' '-atoms' '/tmp/LTL7591448079293067136.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7591448079293067136.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5959219450785542024.hoa
Detected timeout of ITS tools.
[2026-05-26 06:10:34] [INFO ] Flatten gal took : 23 ms
[2026-05-26 06:10:34] [INFO ] Flatten gal took : 23 ms
[2026-05-26 06:10:34] [INFO ] Time to serialize gal into /tmp/LTL4482274504532209435.gal : 8 ms
[2026-05-26 06:10:34] [INFO ] Time to serialize properties into /tmp/LTL2135994834503262794.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4482274504532209435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2135994834503262794.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(((turn_5!=1)||(flag_5_idle!=1))||(p25_0_2!=1))")))||("((flag_0_idle==1)&&(p09_1_0==1))"))))
Formula 0 simplified : X(!"((flag_0_idle==1)&&(p09_1_0==1))" & XF!"(((turn_5!=1)||(flag_5_idle!=1))||(p25_0_2!=1))")
Detected timeout of ITS tools.
[2026-05-26 06:10:49] [INFO ] Flatten gal took : 21 ms
[2026-05-26 06:10:49] [INFO ] Applying decomposition
[2026-05-26 06:10:49] [INFO ] Flatten gal took : 38 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/graph606148578055611311.txt' '-o' '/tmp/graph606148578055611311.bin' '-w' '/tmp/graph606148578055611311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph606148578055611311.bin' '-l' '-1' '-v' '-w' '/tmp/graph606148578055611311.weights' '-q' '0' '-e' '0.001'
[2026-05-26 06:10:49] [INFO ] Decomposing Gal with order
[2026-05-26 06:10:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 06:10:49] [INFO ] Removed a total of 1882 redundant transitions.
[2026-05-26 06:10:49] [INFO ] Flatten gal took : 88 ms
[2026-05-26 06:10:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 365 labels/synchronizations in 43 ms.
[2026-05-26 06:10:49] [INFO ] Time to serialize gal into /tmp/LTL4787734117169560350.gal : 12 ms
[2026-05-26 06:10:49] [INFO ] Time to serialize properties into /tmp/LTL16519682031559185587.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4787734117169560350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16519682031559185587.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(((i0.u1.turn_5!=1)||(i13.i0.u90.flag_5_idle!=1))||(i14.i1.u0.p25_0_2!=1))")))||("((i10.i1.u62.flag_0_idle==1)&&(i2.u23.p09...169
Formula 0 simplified : X(!"((i10.i1.u62.flag_0_idle==1)&&(i2.u23.p09_1_0==1))" & XF!"(((i0.u1.turn_5!=1)||(i13.i0.u90.flag_5_idle!=1))||(i14.i1.u0.p25_0_2!...161
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-08 finished in 356781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U ((p1 U (p0||F(p2))) U p0)))'
Support contains 7 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 384 transition count 1116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 384 transition count 1116
Applied a total of 18 rules in 11 ms. Remains 384 /393 variables (removed 9) and now considering 1116/1170 (removed 54) transitions.
[2026-05-26 06:11:04] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:11:04] [INFO ] Invariant cache hit.
[2026-05-26 06:11:05] [INFO ] Implicit Places using invariants in 463 ms returned []
[2026-05-26 06:11:05] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:11:05] [INFO ] Invariant cache hit.
[2026-05-26 06:11:05] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:11:06] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 2202 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 384/393 places, 1116/1170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2213 ms. Remains : 384/393 places, 1116/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0))) U ((p1 U (F(p2)||p0)) U p0)))'
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 361 ms.
Stack based approach found an accepted trace after 64 steps with 0 reset with depth 65 and stack size 65 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-09 finished in 2931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U (X(F(p3))&&p2)))'
Support contains 8 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 385 transition count 1122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 385 transition count 1122
Applied a total of 16 rules in 11 ms. Remains 385 /393 variables (removed 8) and now considering 1122/1170 (removed 48) transitions.
[2026-05-26 06:11:07] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7738790657894698529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-513829428173595782.kers'
[2026-05-26 06:11:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7738790657894698529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-513829428173595782.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 528 rows 385 cols 1224 entries
Finished phase 1 with 360 SingleSign rule and 6 generalized
[2026-05-26 06:11:07] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-513829428173595782.kers
Total runtime 3 ms.
[2026-05-26 06:11:08] [INFO ] Implicit Places using invariants in 481 ms returned []
[2026-05-26 06:11:08] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2026-05-26 06:11:08] [INFO ] Invariant cache hit.
[2026-05-26 06:11:08] [INFO ] State equation strengthened by 169 read => feed constraints.
[2026-05-26 06:11:09] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2026-05-26 06:11:09] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2026-05-26 06:11:09] [INFO ] Invariant cache hit.
[2026-05-26 06:11:09] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 385/913 variables, and 59 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 1116/1116 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/913 variables, and 100 constraints, problems are : Problem set: 0 solved, 1116 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/385 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/1116 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 60310ms
Starting structural reductions in LTL mode, iteration 1 : 385/393 places, 1122/1170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62484 ms. Remains : 385/393 places, 1122/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||p1) U (X(F(p3))&&p2)))'
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 362 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-10 finished in 63019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 1164
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 387 transition count 1164
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 387 transition count 1050
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 273 transition count 1050
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 247 place count 266 transition count 1008
Iterating global reduction 2 with 7 rules applied. Total rules applied 254 place count 266 transition count 1008
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 314 place count 236 transition count 978
Applied a total of 314 rules in 44 ms. Remains 236 /393 variables (removed 157) and now considering 978/1170 (removed 192) transitions.
[2026-05-26 06:12:10] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3224120948470114574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17389607677942864562.kers'
[2026-05-26 06:12:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3224120948470114574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17389607677942864562.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 236 cols 936 entries
Finished phase 1 with 211 SingleSign rule and 6 generalized
[2026-05-26 06:12:10] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17389607677942864562.kers
Total runtime 2 ms.
[2026-05-26 06:12:11] [INFO ] Implicit Places using invariants in 395 ms returned []
[2026-05-26 06:12:11] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2026-05-26 06:12:11] [INFO ] Invariant cache hit.
[2026-05-26 06:12:11] [INFO ] State equation strengthened by 174 read => feed constraints.
[2026-05-26 06:12:12] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
[2026-05-26 06:12:12] [INFO ] Redundant transitions in 15 ms returned []
Running 972 sub problems to find dead transitions.
[2026-05-26 06:12:12] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2026-05-26 06:12:12] [INFO ] Invariant cache hit.
[2026-05-26 06:12:12] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 972 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/620 variables, and 71 constraints, problems are : Problem set: 0 solved, 972 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/174 constraints, PredecessorRefiner: 972/972 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 972 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 52/71 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 10/97 constraints. Problems are: Problem set: 0 solved, 972 unsolved
SMT process timed out in 60358ms, After SMT, problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 236/393 places, 978/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61883 ms. Remains : 236/393 places, 978/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-11 finished in 62209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F((p0||G(p1)))||(p2&&G(p3))) U X(X(p4)))))'
Support contains 10 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 384 transition count 1116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 384 transition count 1116
Applied a total of 18 rules in 12 ms. Remains 384 /393 variables (removed 9) and now considering 1116/1170 (removed 54) transitions.
[2026-05-26 06:13:12] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18005507436527252583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6508232154474885644.kers'
[2026-05-26 06:13:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18005507436527252583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6508232154474885644.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 522 rows 384 cols 1212 entries
Finished phase 1 with 359 SingleSign rule and 6 generalized
[2026-05-26 06:13:12] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6508232154474885644.kers
Total runtime 4 ms.
[2026-05-26 06:13:13] [INFO ] Implicit Places using invariants in 461 ms returned []
[2026-05-26 06:13:13] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:13:13] [INFO ] Invariant cache hit.
[2026-05-26 06:13:13] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:13:14] [INFO ] Implicit Places using invariants and state equation in 1436 ms returned []
Implicit Place search using SMT with State Equation took 1898 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2026-05-26 06:13:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:13:14] [INFO ] Invariant cache hit.
[2026-05-26 06:13:14] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 86 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 67/67 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Starting structural reductions in LTL mode, iteration 1 : 384/393 places, 1116/1170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62202 ms. Remains : 384/393 places, 1116/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F((p0||G(p1)))||(p2&&G(p3))) U X(X(p4)))))'
Stuttering acceptance computed with spot in 502 ms :[(NOT p4), (NOT p4), (NOT p4), (AND (NOT p0) (NOT p4) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p4) (NOT p1)), (NOT p4), (AND (NOT p0) (NOT p4) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p4) (NOT p1)), (AND (NOT p0) (NOT p4) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p4) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12
Product exploration explored 100000 steps with 1900 reset in 324 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 63113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(X(p0)) U p1)&&X(p2)&&(F(p3)||p4))))'
Support contains 8 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 384 transition count 1116
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 384 transition count 1116
Applied a total of 18 rules in 12 ms. Remains 384 /393 variables (removed 9) and now considering 1116/1170 (removed 54) transitions.
[2026-05-26 06:14:16] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:14:16] [INFO ] Invariant cache hit.
[2026-05-26 06:14:16] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-05-26 06:14:16] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2026-05-26 06:14:16] [INFO ] Invariant cache hit.
[2026-05-26 06:14:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:14:18] [INFO ] Implicit Places using invariants and state equation in 1747 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 384/393 places, 1116/1170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2239 ms. Remains : 384/393 places, 1116/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(X(p0)) U p1)&&X(p2)&&(F(p3)||p4))))'
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p2), (NOT p3), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 2524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 1164
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 387 transition count 1164
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 387 transition count 1050
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 273 transition count 1050
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 247 place count 266 transition count 1008
Iterating global reduction 2 with 7 rules applied. Total rules applied 254 place count 266 transition count 1008
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 314 place count 236 transition count 978
Applied a total of 314 rules in 53 ms. Remains 236 /393 variables (removed 157) and now considering 978/1170 (removed 192) transitions.
[2026-05-26 06:14:18] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16198588601925797434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-120655437119185970.kers'
[2026-05-26 06:14:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16198588601925797434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-120655437119185970.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 236 cols 936 entries
Finished phase 1 with 211 SingleSign rule and 6 generalized
[2026-05-26 06:14:18] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-120655437119185970.kers
Total runtime 2 ms.
[2026-05-26 06:14:18] [INFO ] Implicit Places using invariants in 369 ms returned []
[2026-05-26 06:14:18] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2026-05-26 06:14:18] [INFO ] Invariant cache hit.
[2026-05-26 06:14:19] [INFO ] State equation strengthened by 174 read => feed constraints.
[2026-05-26 06:14:19] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
[2026-05-26 06:14:19] [INFO ] Redundant transitions in 16 ms returned []
Running 972 sub problems to find dead transitions.
[2026-05-26 06:14:19] [INFO ] Flow matrix only has 384 transitions (discarded 594 similar events)
[2026-05-26 06:14:19] [INFO ] Invariant cache hit.
[2026-05-26 06:14:19] [INFO ] State equation strengthened by 174 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 972 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 972 unsolved
SMT process timed out in 30378ms, After SMT, problems are : Problem set: 0 solved, 972 unsolved
Search for dead transitions found 0 dead transitions in 30381ms
Starting structural reductions in SI_LTL mode, iteration 1 : 236/393 places, 978/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31816 ms. Remains : 236/393 places, 978/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 220 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 32108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)||(!p0&&F(!p1))) U p2))'
Support contains 8 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 1170/1170 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 1164
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 387 transition count 1164
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 387 transition count 1051
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 274 transition count 1051
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 247 place count 265 transition count 997
Iterating global reduction 2 with 9 rules applied. Total rules applied 256 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 316 place count 235 transition count 967
Applied a total of 316 rules in 44 ms. Remains 235 /393 variables (removed 158) and now considering 967/1170 (removed 203) transitions.
[2026-05-26 06:14:50] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14868070672025421412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7171746251329066459.kers'
[2026-05-26 06:14:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14868070672025421412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7171746251329066459.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 373 rows 235 cols 914 entries
Finished phase 1 with 210 SingleSign rule and 6 generalized
[2026-05-26 06:14:50] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7171746251329066459.kers
Total runtime 2 ms.
[2026-05-26 06:14:51] [INFO ] Implicit Places using invariants in 394 ms returned []
[2026-05-26 06:14:51] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2026-05-26 06:14:51] [INFO ] Invariant cache hit.
[2026-05-26 06:14:51] [INFO ] State equation strengthened by 164 read => feed constraints.
[2026-05-26 06:14:52] [INFO ] Implicit Places using invariants and state equation in 1090 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
[2026-05-26 06:14:52] [INFO ] Redundant transitions in 15 ms returned []
Running 961 sub problems to find dead transitions.
[2026-05-26 06:14:52] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2026-05-26 06:14:52] [INFO ] Invariant cache hit.
[2026-05-26 06:14:52] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
SMT process timed out in 30308ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 30310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 235/393 places, 967/1170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31865 ms. Remains : 235/393 places, 967/1170 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)||(!p0&&F(!p1))) U p2))'
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), true, (AND p1 p0), p1]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-15
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-15 finished in 32024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&X(!p1)) U (G((!p0&&X(!p1)))||(!p0&&X(!p1)&&(X((p2||G(!p2))) U ((!p3&&X((p2||G(!p2))))||X(G((p2||G(!p2)))))))))))'
Spot run failed in 57 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Spot run failed in 51 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Spot run failed in 50 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 06:15:22] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10893939562377617429
[2026-05-26 06:15:22] [INFO ] Computing symmetric may disable matrix : 1170 transitions.
[2026-05-26 06:15:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:15:22] [INFO ] Applying decomposition
[2026-05-26 06:15:22] [INFO ] Computing symmetric may enable matrix : 1170 transitions.
[2026-05-26 06:15:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:15:22] [INFO ] Flatten gal took : 24 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/graph5731734524877189289.txt' '-o' '/tmp/graph5731734524877189289.bin' '-w' '/tmp/graph5731734524877189289.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5731734524877189289.bin' '-l' '-1' '-v' '-w' '/tmp/graph5731734524877189289.weights' '-q' '0' '-e' '0.001'
[2026-05-26 06:15:23] [INFO ] Decomposing Gal with order
[2026-05-26 06:15:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 06:15:23] [INFO ] Removed a total of 2034 redundant transitions.
[2026-05-26 06:15:23] [INFO ] Flatten gal took : 85 ms
[2026-05-26 06:15:23] [INFO ] Computing Do-Not-Accords matrix : 1170 transitions.
[2026-05-26 06:15:23] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 06:15:23] [INFO ] Built C files in 274ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10893939562377617429
Running compilation step : cd /tmp/ltsmin10893939562377617429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 06:15:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 351 labels/synchronizations in 45 ms.
[2026-05-26 06:15:23] [INFO ] Time to serialize gal into /tmp/LTLFireability12987606269690404750.gal : 14 ms
[2026-05-26 06:15:23] [INFO ] Time to serialize properties into /tmp/LTLFireability9402547517973716137.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12987606269690404750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9402547517973716137.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(((!("((i11.u6.turn_5==1)&&(i3.u29.p10_5_3==1))"))&&(X(!("((i11.u6.turn_5==1)&&(i3.u24.p10_5_2==1))"))))U((G((!("((i11.u6.turn_5==...801
Formula 0 simplified : X(("((i11.u6.turn_5==1)&&(i3.u29.p10_5_3==1))" | X"((i11.u6.turn_5==1)&&(i3.u24.p10_5_2==1))") M ("((i11.u6.turn_5==1)&&(i3.u29.p10_...637
Compilation finished in 6220 ms.
Running link step : cd /tmp/ltsmin10893939562377617429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin10893939562377617429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((!(LTLAPp0==true)&&X(!(LTLAPp1==true))) U ([]((!(LTLAPp0==true)&&X(!(LTLAPp1==true))))||(!(LTLAPp0==true)&&X(!(LTLAPp1==true))&&(X(((LTLAPp2==true)||[](!(LTLAPp2==true)))) U ((!(LTLAPp3==true)&&X(((LTLAPp2==true)||[](!(LTLAPp2==true)))))||X([](((LTLAPp2==true)||[](!(LTLAPp2==true)))))))))))' '--buchi-type=spotba'
LTSmin run took 492 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin10893939562377617429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(([]((LTLAPp4==true))||<>([]((LTLAPp5==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin10893939562377617429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(([]((LTLAPp4==true))||<>([]((LTLAPp5==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10893939562377617429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp6==true)||X([]((LTLAPp7==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin10893939562377617429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(((LTLAPp6==true)||X([]((LTLAPp7==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin10893939562377617429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(([]((LTLAPp4==true))||<>([]((LTLAPp5==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 06:44:55] [INFO ] Applying decomposition
[2026-05-26 06:44:56] [INFO ] Flatten gal took : 793 ms
[2026-05-26 06:44:57] [INFO ] Decomposing Gal with order
[2026-05-26 06:44:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 06:45:00] [INFO ] Removed a total of 2173 redundant transitions.
[2026-05-26 06:45:01] [INFO ] Flatten gal took : 3328 ms
[2026-05-26 06:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 120 ms.
[2026-05-26 06:45:01] [INFO ] Time to serialize gal into /tmp/LTLFireability16808793326037475925.gal : 71 ms
[2026-05-26 06:45:01] [INFO ] Time to serialize properties into /tmp/LTLFireability1540286452573232765.ltl : 13 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16808793326037475925.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1540286452573232765.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X((G("((u9.flag_0_waiting==1)&&(u2.p09_5_0==1))"))||(F(G("(((u8.turn_0!=1)||(u9.flag_0_waiting!=1))||(u4.p25_1_5!=1))"))))))
Formula 0 simplified : X(F!"((u9.flag_0_waiting==1)&&(u2.p09_5_0==1))" & GF!"(((u8.turn_0!=1)||(u9.flag_0_waiting!=1))||(u4.p25_1_5!=1))")
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="EisenbergMcGuire-PT-06"
export BK_EXAMINATION="LTLFireability"
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 EisenbergMcGuire-PT-06, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-177955740500260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-06.tgz
mv EisenbergMcGuire-PT-06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;