About the Execution of ITS-Tools for EisenbergMcGuire-PT-07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6133.663 | 1353997.00 | 1880930.00 | 3768.10 | FFFFFFFFFFFTTFTF | 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-177955740500268.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-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740500268
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 09:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 7 05:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 7 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:48 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 1.2M 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-07-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-07-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779785204080
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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 08:46:46] [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 08:46:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 08:46:47] [INFO ] Load time of PNML (sax parser for PT used): 415 ms
[2026-05-26 08:46:47] [INFO ] Transformed 553 places.
[2026-05-26 08:46:47] [INFO ] Transformed 1960 transitions.
[2026-05-26 08:46:47] [INFO ] Found NUPN structural information;
[2026-05-26 08:46:47] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 657 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 518 transition count 1715
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 518 transition count 1715
Applied a total of 70 rules in 205 ms. Remains 518 /553 variables (removed 35) and now considering 1715/1960 (removed 245) transitions.
[2026-05-26 08:46:47] [INFO ] Flow matrix only has 756 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14822342520385908856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8648650770224309736.kers'
[2026-05-26 08:46:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14822342520385908856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8648650770224309736.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 756 rows 518 cols 1736 entries
Finished phase 1 with 489 SingleSign rule and 7 generalized
[2026-05-26 08:46:48] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8648650770224309736.kers
Total runtime 6 ms.
[2026-05-26 08:46:49] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2026-05-26 08:46:49] [INFO ] Flow matrix only has 756 transitions (discarded 959 similar events)
[2026-05-26 08:46:49] [INFO ] Invariant cache hit.
[2026-05-26 08:46:50] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-26 08:46:53] [INFO ] Implicit Places using invariants and state equation in 3902 ms returned []
Implicit Place search using SMT with State Equation took 5286 ms to find 0 implicit places.
Running 1708 sub problems to find dead transitions.
[2026-05-26 08:46:53] [INFO ] Flow matrix only has 756 transitions (discarded 959 similar events)
[2026-05-26 08:46:53] [INFO ] Invariant cache hit.
[2026-05-26 08:46:53] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1708 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1274 variables, and 32 constraints, problems are : Problem set: 0 solved, 1708 unsolved in 30092 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/518 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1708/1708 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1708 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 1708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 1708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1274 variables, and 72 constraints, problems are : Problem set: 0 solved, 1708 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/518 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 0/1708 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61248ms problems are : Problem set: 0 solved, 1708 unsolved
Search for dead transitions found 0 dead transitions in 61348ms
Starting structural reductions in LTL mode, iteration 1 : 518/553 places, 1715/1960 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66946 ms. Remains : 518/553 places, 1715/1960 transitions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Applied a total of 0 rules in 38 ms. Remains 518 /518 variables (removed 0) and now considering 1715/1715 (removed 0) transitions.
[2026-05-26 08:47:54] [INFO ] Flow matrix only has 756 transitions (discarded 959 similar events)
[2026-05-26 08:47:54] [INFO ] Invariant cache hit.
[2026-05-26 08:47:55] [INFO ] Implicit Places using invariants in 597 ms returned []
[2026-05-26 08:47:55] [INFO ] Flow matrix only has 756 transitions (discarded 959 similar events)
[2026-05-26 08:47:55] [INFO ] Invariant cache hit.
[2026-05-26 08:47:55] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-26 08:47:57] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 3255 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3296 ms. Remains : 518/518 places, 1715/1715 transitions.
Support contains 46 out of 518 places after structural reductions.
[2026-05-26 08:47:58] [INFO ] Flatten gal took : 204 ms
[2026-05-26 08:47:58] [INFO ] Flatten gal took : 148 ms
[2026-05-26 08:47:58] [INFO ] Input system was already deterministic with 1715 transitions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 40000 steps (8 resets) in 2418 ms. (16 steps per ms) remains 25/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
[2026-05-26 08:47:59] [INFO ] Flow matrix only has 756 transitions (discarded 959 similar events)
[2026-05-26 08:47:59] [INFO ] Invariant cache hit.
[2026-05-26 08:47:59] [INFO ] State equation strengthened by 262 read => feed constraints.
Problem AtomicPropp15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 325/368 variables, 13/14 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/368 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 2/370 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 148/518 variables, 7/22 constraints. Problems are: Problem set: 1 solved, 24 unsolved
SMT process timed out in 5165ms, After SMT, problems are : Problem set: 1 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 1715/1715 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 518 transition count 1710
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 513 transition count 1710
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 10 place count 513 transition count 1558
Deduced a syphon composed of 152 places in 3 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 314 place count 361 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 315 place count 360 transition count 1551
Iterating global reduction 2 with 1 rules applied. Total rules applied 316 place count 360 transition count 1551
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 400 place count 318 transition count 1509
Applied a total of 400 rules in 273 ms. Remains 318 /518 variables (removed 200) and now considering 1509/1715 (removed 206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 318/518 places, 1509/1715 transitions.
RANDOM walk for 40000 steps (8 resets) in 742 ms. (53 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 150104 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :8 out of 24
Probabilistic random walk after 150104 steps, saw 83463 distinct states, run finished after 3008 ms. (steps per millisecond=49 ) properties seen :8
[2026-05-26 08:48:08] [INFO ] Flow matrix only has 550 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13907168649172052762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11305607861168478056.kers'
[2026-05-26 08:48:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13907168649172052762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11305607861168478056.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 550 rows 318 cols 1324 entries
Finished phase 1 with 289 SingleSign rule and 7 generalized
[2026-05-26 08:48:08] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11305607861168478056.kers
Total runtime 5 ms.
[2026-05-26 08:48:08] [INFO ] State equation strengthened by 256 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 225/256 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/258 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 60/318 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 550/868 variables, 318/358 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/868 variables, 256/614 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/868 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/868 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 868/868 variables, and 614 constraints, problems are : Problem set: 0 solved, 16 unsolved in 6993 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 318/318 constraints, ReadFeed: 256/256 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 225/256 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 8/22 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/258 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 6/29 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/29 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 60/318 variables, 7/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 4/40 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 5/45 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 550/868 variables, 318/364 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/868 variables, 256/620 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/868 variables, 15/635 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/868 variables, 7/642 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/868 variables, 1/643 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/868 variables, 1/644 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/868 variables, 1/645 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/868 variables, 1/646 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/868 variables, 0/646 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 21 (OVERLAPS) 0/868 variables, 0/646 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 868/868 variables, and 646 constraints, problems are : Problem set: 1 solved, 15 unsolved in 17000 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 318/318 constraints, ReadFeed: 256/256 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24029ms problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 11724 ms.
Support contains 28 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 1509/1509 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 318 transition count 1506
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 315 transition count 1506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 310 transition count 1471
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 310 transition count 1471
Applied a total of 16 rules in 68 ms. Remains 310 /318 variables (removed 8) and now considering 1471/1509 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 310/318 places, 1471/1509 transitions.
RANDOM walk for 40000 steps (8 resets) in 381 ms. (104 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 178304 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 15
Probabilistic random walk after 178304 steps, saw 92840 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2026-05-26 08:48:47] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2503884927645783616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5506327047659474692.kers'
[2026-05-26 08:48:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2503884927645783616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5506327047659474692.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 512 rows 310 cols 1248 entries
Finished phase 1 with 281 SingleSign rule and 7 generalized
[2026-05-26 08:48:47] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5506327047659474692.kers
Total runtime 4 ms.
[2026-05-26 08:48:47] [INFO ] State equation strengthened by 226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 224/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/254 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 56/310 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 512/822 variables, 310/348 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/822 variables, 226/574 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/822 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 574 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5731 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 310/310 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 16/16 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/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 224/252 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/254 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 56/310 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 512/822 variables, 310/356 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/822 variables, 226/582 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 15/597 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 7/604 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/822 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/822 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (OVERLAPS) 0/822 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 608 constraints, problems are : Problem set: 0 solved, 15 unsolved in 16603 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 310/310 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22367ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 14802 ms.
Support contains 28 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1471/1471 transitions.
Applied a total of 0 rules in 48 ms. Remains 310 /310 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 310/310 places, 1471/1471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1471/1471 transitions.
Applied a total of 0 rules in 48 ms. Remains 310 /310 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
[2026-05-26 08:49:25] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2026-05-26 08:49:25] [INFO ] Invariant cache hit.
[2026-05-26 08:49:25] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-26 08:49:25] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2026-05-26 08:49:25] [INFO ] Invariant cache hit.
[2026-05-26 08:49:25] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:49:27] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2210 ms to find 0 implicit places.
[2026-05-26 08:49:27] [INFO ] Redundant transitions in 147 ms returned []
Running 1464 sub problems to find dead transitions.
[2026-05-26 08:49:27] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2026-05-26 08:49:27] [INFO ] Invariant cache hit.
[2026-05-26 08:49:27] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
SMT process timed out in 30940ms, After SMT, problems are : Problem set: 0 solved, 1464 unsolved
Search for dead transitions found 0 dead transitions in 30949ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33373 ms. Remains : 310/310 places, 1471/1471 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(((F(p2)||p1)&&p0))))'
Support contains 8 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 518 transition count 1708
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 511 transition count 1708
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 511 transition count 1554
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 357 transition count 1554
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 328 place count 351 transition count 1512
Iterating global reduction 2 with 6 rules applied. Total rules applied 334 place count 351 transition count 1512
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 418 place count 309 transition count 1470
Applied a total of 418 rules in 210 ms. Remains 309 /518 variables (removed 209) and now considering 1470/1715 (removed 245) transitions.
[2026-05-26 08:49:58] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6870701997862956819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8996557663868080392.kers'
[2026-05-26 08:49:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6870701997862956819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8996557663868080392.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 511 rows 309 cols 1246 entries
Finished phase 1 with 280 SingleSign rule and 7 generalized
[2026-05-26 08:49:58] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8996557663868080392.kers
Total runtime 3 ms.
[2026-05-26 08:49:59] [INFO ] Implicit Places using invariants in 441 ms returned []
[2026-05-26 08:49:59] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2026-05-26 08:49:59] [INFO ] Invariant cache hit.
[2026-05-26 08:49:59] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:50:01] [INFO ] Implicit Places using invariants and state equation in 1689 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2026-05-26 08:50:01] [INFO ] Redundant transitions in 104 ms returned []
Running 1463 sub problems to find dead transitions.
[2026-05-26 08:50:01] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2026-05-26 08:50:01] [INFO ] Invariant cache hit.
[2026-05-26 08:50:01] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/820 variables, and 46 constraints, problems are : Problem set: 0 solved, 1463 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/309 constraints, ReadFeed: 0/226 constraints, PredecessorRefiner: 1463/1463 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
SMT process timed out in 60515ms, After SMT, problems are : Problem set: 0 solved, 1463 unsolved
Search for dead transitions found 0 dead transitions in 60521ms
Starting structural reductions in SI_LTL mode, iteration 1 : 309/518 places, 1470/1715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62982 ms. Remains : 309/518 places, 1470/1715 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(((F(p2)||p1)&&p0))))'
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 688 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 2 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-00 finished in 64132 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||X((F(G(p1))||(X(G(p0)) U G(p0)))))))'
Support contains 4 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 511 transition count 1666
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 511 transition count 1666
Applied a total of 14 rules in 35 ms. Remains 511 /518 variables (removed 7) and now considering 1666/1715 (removed 49) transitions.
[2026-05-26 08:51:02] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15193713067319594731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2682660287828754286.kers'
[2026-05-26 08:51:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15193713067319594731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2682660287828754286.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 511 cols 1638 entries
Finished phase 1 with 482 SingleSign rule and 7 generalized
[2026-05-26 08:51:02] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2682660287828754286.kers
Total runtime 6 ms.
[2026-05-26 08:51:03] [INFO ] Implicit Places using invariants in 748 ms returned []
[2026-05-26 08:51:03] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 08:51:03] [INFO ] Invariant cache hit.
[2026-05-26 08:51:04] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 08:51:06] [INFO ] Implicit Places using invariants and state equation in 3204 ms returned []
Implicit Place search using SMT with State Equation took 3954 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2026-05-26 08:51:06] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 08:51:06] [INFO ] Invariant cache hit.
[2026-05-26 08:51:06] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
SMT process timed out in 31001ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 31009ms
Starting structural reductions in LTL mode, iteration 1 : 511/518 places, 1666/1715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35006 ms. Remains : 511/518 places, 1666/1715 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||X((F(G(p1))||(X(G(p0)) U G(p0)))))))'
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 471 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 1 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-01 finished in 35712 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((p0&&X(p1)))&&G((p1||X(X(p2))))))'
Support contains 5 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 513 transition count 1680
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 513 transition count 1680
Applied a total of 10 rules in 34 ms. Remains 513 /518 variables (removed 5) and now considering 1680/1715 (removed 35) transitions.
[2026-05-26 08:51:38] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9911471104742651657.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10408860423880084168.kers'
[2026-05-26 08:51:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9911471104742651657.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10408860423880084168.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 721 rows 513 cols 1666 entries
Finished phase 1 with 484 SingleSign rule and 7 generalized
[2026-05-26 08:51:38] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10408860423880084168.kers
Total runtime 6 ms.
[2026-05-26 08:51:39] [INFO ] Implicit Places using invariants in 783 ms returned []
[2026-05-26 08:51:39] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2026-05-26 08:51:39] [INFO ] Invariant cache hit.
[2026-05-26 08:51:39] [INFO ] State equation strengthened by 232 read => feed constraints.
[2026-05-26 08:51:43] [INFO ] Implicit Places using invariants and state equation in 4069 ms returned []
Implicit Place search using SMT with State Equation took 4855 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2026-05-26 08:51:43] [INFO ] Flow matrix only has 721 transitions (discarded 959 similar events)
[2026-05-26 08:51:43] [INFO ] Invariant cache hit.
[2026-05-26 08:51:43] [INFO ] State equation strengthened by 232 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/513 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/513 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1673 unsolved
SMT process timed out in 30637ms, After SMT, problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 30641ms
Starting structural reductions in LTL mode, iteration 1 : 513/518 places, 1680/1715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35535 ms. Remains : 513/518 places, 1680/1715 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&&X(p1)))&&G((p1||X(X(p2))))))'
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p2), true]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-02 finished in 35858 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 2 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 518 transition count 1708
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 511 transition count 1708
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 511 transition count 1554
Deduced a syphon composed of 154 places in 3 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 357 transition count 1554
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 328 place count 351 transition count 1512
Iterating global reduction 2 with 6 rules applied. Total rules applied 334 place count 351 transition count 1512
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 418 place count 309 transition count 1470
Applied a total of 418 rules in 159 ms. Remains 309 /518 variables (removed 209) and now considering 1470/1715 (removed 245) transitions.
[2026-05-26 08:52:14] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8500749609700207946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4036358872513039072.kers'
[2026-05-26 08:52:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8500749609700207946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4036358872513039072.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 511 rows 309 cols 1246 entries
Finished phase 1 with 280 SingleSign rule and 7 generalized
[2026-05-26 08:52:14] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4036358872513039072.kers
Total runtime 4 ms.
[2026-05-26 08:52:15] [INFO ] Implicit Places using invariants in 777 ms returned []
[2026-05-26 08:52:15] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2026-05-26 08:52:15] [INFO ] Invariant cache hit.
[2026-05-26 08:52:15] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:52:17] [INFO ] Implicit Places using invariants and state equation in 2048 ms returned []
Implicit Place search using SMT with State Equation took 2839 ms to find 0 implicit places.
[2026-05-26 08:52:17] [INFO ] Redundant transitions in 79 ms returned []
Running 1463 sub problems to find dead transitions.
[2026-05-26 08:52:17] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2026-05-26 08:52:17] [INFO ] Invariant cache hit.
[2026-05-26 08:52:17] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/820 variables, and 53 constraints, problems are : Problem set: 0 solved, 1463 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/309 constraints, ReadFeed: 0/226 constraints, PredecessorRefiner: 1463/1463 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 31/53 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 1463 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/820 variables, and 78 constraints, problems are : Problem set: 0 solved, 1463 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/309 constraints, ReadFeed: 0/226 constraints, PredecessorRefiner: 0/1463 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60681ms problems are : Problem set: 0 solved, 1463 unsolved
Search for dead transitions found 0 dead transitions in 60686ms
Starting structural reductions in SI_LTL mode, iteration 1 : 309/518 places, 1470/1715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63780 ms. Remains : 309/518 places, 1470/1715 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 55 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 266 ms.
Product exploration explored 100000 steps with 0 reset in 436 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 97 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 392 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16366 steps, run visited all 1 properties in 117 ms. (steps per millisecond=139 )
Probabilistic random walk after 16366 steps, saw 11677 distinct states, run finished after 123 ms. (steps per millisecond=133 ) properties seen :1
Knowledge based reduction with 3 factoid took 78 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 48 ms :[(NOT p0)]
Knowledge-based reduction took 586 ms.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 1470/1470 transitions.
Applied a total of 0 rules in 41 ms. Remains 309 /309 variables (removed 0) and now considering 1470/1470 (removed 0) transitions.
[2026-05-26 08:53:19] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2026-05-26 08:53:19] [INFO ] Invariant cache hit.
[2026-05-26 08:53:20] [INFO ] Implicit Places using invariants in 565 ms returned []
[2026-05-26 08:53:20] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2026-05-26 08:53:20] [INFO ] Invariant cache hit.
[2026-05-26 08:53:20] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:53:22] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 2700 ms to find 0 implicit places.
[2026-05-26 08:53:22] [INFO ] Redundant transitions in 33 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2781 ms. Remains : 309/309 places, 1470/1470 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 46 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 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16366 steps, run visited all 1 properties in 173 ms. (steps per millisecond=94 )
Probabilistic random walk after 16366 steps, saw 11677 distinct states, run finished after 174 ms. (steps per millisecond=94 ) properties seen :1
Knowledge based reduction with 3 factoid took 62 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 37 ms :[(NOT p0)]
Knowledge-based reduction took 416 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 393 ms.
Built C files in :
/tmp/ltsmin16149595116213019119
[2026-05-26 08:53:23] [INFO ] Computing symmetric may disable matrix : 1470 transitions.
[2026-05-26 08:53:23] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:53:23] [INFO ] Computing symmetric may enable matrix : 1470 transitions.
[2026-05-26 08:53:23] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:53:24] [INFO ] Computing Do-Not-Accords matrix : 1470 transitions.
[2026-05-26 08:53:24] [INFO ] Computation of Completed DNA matrix. took 87 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:53:24] [INFO ] Built C files in 614ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16149595116213019119
Running compilation step : cd /tmp/ltsmin16149595116213019119;'/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/ltsmin16149595116213019119;'/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/ltsmin16149595116213019119;'/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 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 1470/1470 transitions.
Applied a total of 0 rules in 41 ms. Remains 309 /309 variables (removed 0) and now considering 1470/1470 (removed 0) transitions.
[2026-05-26 08:53:27] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2026-05-26 08:53:27] [INFO ] Invariant cache hit.
[2026-05-26 08:53:28] [INFO ] Implicit Places using invariants in 693 ms returned []
[2026-05-26 08:53:28] [INFO ] Flow matrix only has 511 transitions (discarded 959 similar events)
[2026-05-26 08:53:28] [INFO ] Invariant cache hit.
[2026-05-26 08:53:28] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:53:30] [INFO ] Implicit Places using invariants and state equation in 2211 ms returned []
Implicit Place search using SMT with State Equation took 2906 ms to find 0 implicit places.
[2026-05-26 08:53:30] [INFO ] Redundant transitions in 32 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2988 ms. Remains : 309/309 places, 1470/1470 transitions.
Built C files in :
/tmp/ltsmin3682157619041856034
[2026-05-26 08:53:30] [INFO ] Computing symmetric may disable matrix : 1470 transitions.
[2026-05-26 08:53:30] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:53:30] [INFO ] Computing symmetric may enable matrix : 1470 transitions.
[2026-05-26 08:53:30] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:53:30] [INFO ] Computing Do-Not-Accords matrix : 1470 transitions.
[2026-05-26 08:53:31] [INFO ] Computation of Completed DNA matrix. took 66 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:53:31] [INFO ] Built C files in 723ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3682157619041856034
Running compilation step : cd /tmp/ltsmin3682157619041856034;'/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/ltsmin3682157619041856034;'/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/ltsmin3682157619041856034;'/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 08:53:34] [INFO ] Flatten gal took : 87 ms
[2026-05-26 08:53:34] [INFO ] Flatten gal took : 82 ms
[2026-05-26 08:53:34] [INFO ] Time to serialize gal into /tmp/LTL5572200356278938031.gal : 25 ms
[2026-05-26 08:53:34] [INFO ] Time to serialize properties into /tmp/LTL8467759669443497723.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/LTL5572200356278938031.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5526967944818548976.hoa' '-atoms' '/tmp/LTL8467759669443497723.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/LTL8467759669443497723.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5526967944818548976.hoa
Detected timeout of ITS tools.
[2026-05-26 08:53:49] [INFO ] Flatten gal took : 55 ms
[2026-05-26 08:53:49] [INFO ] Flatten gal took : 54 ms
[2026-05-26 08:53:49] [INFO ] Time to serialize gal into /tmp/LTL1433810270331327923.gal : 20 ms
[2026-05-26 08:53:49] [INFO ] Time to serialize properties into /tmp/LTL10878507641849301793.ltl : 7 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/LTL1433810270331327923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10878507641849301793.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 : !((F(G("((turn_1!=1)||(p10_4_6!=1))"))))
Formula 0 simplified : GF!"((turn_1!=1)||(p10_4_6!=1))"
Detected timeout of ITS tools.
[2026-05-26 08:54:04] [INFO ] Flatten gal took : 43 ms
[2026-05-26 08:54:04] [INFO ] Applying decomposition
[2026-05-26 08:54:04] [INFO ] Flatten gal took : 54 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/graph878520836783356966.txt' '-o' '/tmp/graph878520836783356966.bin' '-w' '/tmp/graph878520836783356966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph878520836783356966.bin' '-l' '-1' '-v' '-w' '/tmp/graph878520836783356966.weights' '-q' '0' '-e' '0.001'
[2026-05-26 08:54:05] [INFO ] Decomposing Gal with order
[2026-05-26 08:54:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 08:54:05] [INFO ] Removed a total of 2819 redundant transitions.
[2026-05-26 08:54:05] [INFO ] Flatten gal took : 566 ms
[2026-05-26 08:54:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 496 labels/synchronizations in 125 ms.
[2026-05-26 08:54:06] [INFO ] Time to serialize gal into /tmp/LTL17300729889846184392.gal : 39 ms
[2026-05-26 08:54:06] [INFO ] Time to serialize properties into /tmp/LTL11817495680900142293.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/LTL17300729889846184392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11817495680900142293.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i13.u5.turn_1!=1)||(u9.p10_4_6!=1))"))))
Formula 0 simplified : GF!"((i13.u5.turn_1!=1)||(u9.p10_4_6!=1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-04 finished in 126954 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((X(p1)&&p0))))'
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 511 transition count 1666
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 511 transition count 1666
Applied a total of 14 rules in 24 ms. Remains 511 /518 variables (removed 7) and now considering 1666/1715 (removed 49) transitions.
[2026-05-26 08:54:21] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2512186090311291287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9216192075543891124.kers'
[2026-05-26 08:54:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2512186090311291287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9216192075543891124.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 511 cols 1638 entries
Finished phase 1 with 482 SingleSign rule and 7 generalized
[2026-05-26 08:54:21] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9216192075543891124.kers
Total runtime 4 ms.
[2026-05-26 08:54:22] [INFO ] Implicit Places using invariants in 702 ms returned []
[2026-05-26 08:54:22] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 08:54:22] [INFO ] Invariant cache hit.
[2026-05-26 08:54:22] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 08:54:25] [INFO ] Implicit Places using invariants and state equation in 3113 ms returned []
Implicit Place search using SMT with State Equation took 3819 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2026-05-26 08:54:25] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 08:54:25] [INFO ] Invariant cache hit.
[2026-05-26 08:54:25] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/1218 variables, and 41 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/511 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1659/1659 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/1218 variables, and 80 constraints, problems are : Problem set: 0 solved, 1659 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/511 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1659 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60730ms problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 60737ms
Starting structural reductions in LTL mode, iteration 1 : 511/518 places, 1666/1715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64590 ms. Remains : 511/518 places, 1666/1715 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((X(p1)&&p0))))'
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-05 finished in 64809 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((p0||G(p1)))) U (p2||X(G(!p3)))))'
Support contains 8 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 512 transition count 1673
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 512 transition count 1673
Applied a total of 12 rules in 34 ms. Remains 512 /518 variables (removed 6) and now considering 1673/1715 (removed 42) transitions.
[2026-05-26 08:55:26] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18077319880386687029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4515724583483589355.kers'
[2026-05-26 08:55:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18077319880386687029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4515724583483589355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 714 rows 512 cols 1652 entries
Finished phase 1 with 483 SingleSign rule and 7 generalized
[2026-05-26 08:55:26] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4515724583483589355.kers
Total runtime 6 ms.
[2026-05-26 08:55:27] [INFO ] Implicit Places using invariants in 1047 ms returned []
[2026-05-26 08:55:27] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2026-05-26 08:55:27] [INFO ] Invariant cache hit.
[2026-05-26 08:55:27] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:55:31] [INFO ] Implicit Places using invariants and state equation in 4114 ms returned []
Implicit Place search using SMT with State Equation took 5189 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2026-05-26 08:55:31] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2026-05-26 08:55:31] [INFO ] Invariant cache hit.
[2026-05-26 08:55:31] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
SMT process timed out in 30751ms, After SMT, problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 30757ms
Starting structural reductions in LTL mode, iteration 1 : 512/518 places, 1673/1715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35987 ms. Remains : 512/518 places, 1673/1715 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))) U (X(G(!p2))||p3)))'
Stuttering acceptance computed with spot in 322 ms :[(AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), true, (NOT p0), p2, (AND (NOT p0) p2)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 395 ms.
Product exploration explored 100000 steps with 0 reset in 573 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 17 factoid took 103 ms. Reduced automaton from 8 states, 20 edges and 4 AP (stutter sensitive) to 8 states, 20 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1810 ms. (22 steps per ms) remains 13/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
[2026-05-26 08:56:04] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2026-05-26 08:56:04] [INFO ] Invariant cache hit.
[2026-05-26 08:56:04] [INFO ] State equation strengthened by 226 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/212 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 84/296 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 447/743 variables, 296/310 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/743 variables, 84/394 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 60/803 variables, 27/421 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/803 variables, 18/439 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/803 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 120/923 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/923 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 6/929 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/929 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 63/992 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/992 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 234/1226 variables, 189/637 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1226 variables, 124/761 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1226 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 0/1226 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1226/1226 variables, and 761 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4416 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 512/512 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 200/208 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/212 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 84/296 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 447/743 variables, 296/313 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/743 variables, 84/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/743 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/743 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 60/803 variables, 27/425 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/803 variables, 18/443 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/803 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/803 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 120/923 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 923/1226 variables, and 449 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 4/7 constraints, State Equation: 323/512 constraints, ReadFeed: 102/226 constraints, PredecessorRefiner: 4/13 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9457ms problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 512/512 places, 1673/1673 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 512 transition count 1666
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 505 transition count 1666
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 505 transition count 1513
Deduced a syphon composed of 153 places in 2 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 352 transition count 1513
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 404 place count 310 transition count 1471
Applied a total of 404 rules in 133 ms. Remains 310 /512 variables (removed 202) and now considering 1471/1673 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 310/512 places, 1471/1673 transitions.
RANDOM walk for 40000 steps (8 resets) in 463 ms. (86 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 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 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 185072 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :7 out of 13
Probabilistic random walk after 185072 steps, saw 94493 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :7
[2026-05-26 08:56:17] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11586573885693840602.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7990614661165244942.kers'
[2026-05-26 08:56:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11586573885693840602.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7990614661165244942.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 512 rows 310 cols 1248 entries
Finished phase 1 with 281 SingleSign rule and 7 generalized
[2026-05-26 08:56:17] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7990614661165244942.kers
Total runtime 4 ms.
[2026-05-26 08:56:17] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 138/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/149 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 32/181 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 332/513 variables, 181/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 84/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 60/573 variables, 27/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 21/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 72/645 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/645 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/651 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/651 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 24/675 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/675 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 147/822 variables, 102/438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/822 variables, 121/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/822 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/822 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 559 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 310/310 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 138/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/149 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 32/181 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 332/513 variables, 181/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 84/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 60/573 variables, 27/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 21/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 72/645 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/645 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/651 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/651 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/651 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/651 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 24/675 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/675 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 147/822 variables, 102/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/822 variables, 121/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/822 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/822 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 573 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6317 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 310/310 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8077ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1333 ms.
Support contains 7 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1471/1471 transitions.
Applied a total of 0 rules in 41 ms. Remains 310 /310 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 310/310 places, 1471/1471 transitions.
RANDOM walk for 40000 steps (8 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 186640 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 6
Probabilistic random walk after 186640 steps, saw 95288 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
[2026-05-26 08:56:30] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2026-05-26 08:56:30] [INFO ] Invariant cache hit.
[2026-05-26 08:56:30] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 138/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/149 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 32/181 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 332/513 variables, 181/195 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 84/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 60/573 variables, 27/306 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 21/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 72/645 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/645 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/651 variables, 3/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/651 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 24/675 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/675 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 147/822 variables, 102/438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/822 variables, 121/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/822 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/822 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 559 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 310/310 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 138/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/149 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 32/181 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 332/513 variables, 181/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/513 variables, 84/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 60/573 variables, 27/308 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/573 variables, 21/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/573 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 72/645 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/645 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/651 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/651 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/651 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/651 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 24/675 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/675 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 147/822 variables, 102/452 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/822 variables, 121/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/822 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/822 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 573 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5868 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 310/310 constraints, ReadFeed: 226/226 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7229ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1213 ms.
Support contains 7 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1471/1471 transitions.
Applied a total of 0 rules in 39 ms. Remains 310 /310 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 310/310 places, 1471/1471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1471/1471 transitions.
Applied a total of 0 rules in 41 ms. Remains 310 /310 variables (removed 0) and now considering 1471/1471 (removed 0) transitions.
[2026-05-26 08:56:38] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2026-05-26 08:56:38] [INFO ] Invariant cache hit.
[2026-05-26 08:56:39] [INFO ] Implicit Places using invariants in 701 ms returned []
[2026-05-26 08:56:39] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2026-05-26 08:56:39] [INFO ] Invariant cache hit.
[2026-05-26 08:56:39] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:56:41] [INFO ] Implicit Places using invariants and state equation in 1992 ms returned []
Implicit Place search using SMT with State Equation took 2696 ms to find 0 implicit places.
[2026-05-26 08:56:41] [INFO ] Redundant transitions in 57 ms returned []
Running 1464 sub problems to find dead transitions.
[2026-05-26 08:56:41] [INFO ] Flow matrix only has 512 transitions (discarded 959 similar events)
[2026-05-26 08:56:41] [INFO ] Invariant cache hit.
[2026-05-26 08:56:41] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/822 variables, and 44 constraints, problems are : Problem set: 0 solved, 1464 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/226 constraints, PredecessorRefiner: 1464/1464 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 22/44 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/822 variables, and 64 constraints, problems are : Problem set: 0 solved, 1464 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/310 constraints, ReadFeed: 0/226 constraints, PredecessorRefiner: 0/1464 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 1464 unsolved
Search for dead transitions found 0 dead transitions in 60633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63444 ms. Remains : 310/310 places, 1471/1471 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1327 edges and 310 vertex of which 49 / 310 are part of one of the 7 SCC in 7 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 159 transitions
Ensure Unique test removed 930 transitions
Reduce isomorphic transitions removed 1089 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 268 transition count 322
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 208 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 207 transition count 321
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 123 place count 207 transition count 307
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 157 place count 187 transition count 307
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 321 place count 105 transition count 225
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 361 place count 105 transition count 185
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 4 with 10 rules applied. Total rules applied 371 place count 100 transition count 185
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 376 place count 100 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 383 place count 100 transition count 173
Free-agglomeration rule applied 44 times.
Iterating global reduction 5 with 44 rules applied. Total rules applied 427 place count 100 transition count 129
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 5 with 44 rules applied. Total rules applied 471 place count 56 transition count 129
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 477 place count 56 transition count 129
Applied a total of 477 rules in 85 ms. Remains 56 /310 variables (removed 254) and now considering 129/1471 (removed 1342) transitions.
Running SMT prover for 6 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11073728980911335212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11458862774070769860.kers'
[2026-05-26 08:57:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11073728980911335212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11458862774070769860.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 129 rows 51 cols 452 entries
Finished phase 1 with 37 SingleSign rule and 3 generalized
[2026-05-26 08:57:42] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11458862774070769860.kers
Total runtime 2 ms.
[2026-05-26 08:57:42] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2026-05-26 08:57:42] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 08:57:42] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-26 08:57:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2026-05-26 08:57:42] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-26 08:57:42] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2026-05-26 08:57:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-26 08:57:42] [INFO ] After 92ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-26 08:57:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2026-05-26 08:57:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
TRAPS : Iteration 1
[2026-05-26 08:57:43] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-26 08:57:43] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 1104 ms.
Negative knowledge disproves property using: (G (OR p0 (NOT p2)))
Knowledge based reduction with 17 factoid took 109 ms. Proved property starting from automaton with 8 states, 20 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 100014 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-06 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-06 finished in 137362 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(p0))'
Support contains 3 out of 518 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 518 transition count 1708
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 511 transition count 1708
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 511 transition count 1554
Deduced a syphon composed of 154 places in 2 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 357 transition count 1554
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 329 place count 350 transition count 1505
Iterating global reduction 2 with 7 rules applied. Total rules applied 336 place count 350 transition count 1505
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 420 place count 308 transition count 1463
Applied a total of 420 rules in 179 ms. Remains 308 /518 variables (removed 210) and now considering 1463/1715 (removed 252) transitions.
[2026-05-26 08:57:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9100755628017153221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5770823576372020026.kers'
[2026-05-26 08:57:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9100755628017153221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5770823576372020026.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 504 rows 308 cols 1232 entries
Finished phase 1 with 279 SingleSign rule and 7 generalized
[2026-05-26 08:57:43] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5770823576372020026.kers
Total runtime 4 ms.
[2026-05-26 08:57:44] [INFO ] Implicit Places using invariants in 741 ms returned []
[2026-05-26 08:57:44] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2026-05-26 08:57:44] [INFO ] Invariant cache hit.
[2026-05-26 08:57:44] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 08:57:46] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2545 ms to find 0 implicit places.
[2026-05-26 08:57:46] [INFO ] Redundant transitions in 62 ms returned []
Running 1456 sub problems to find dead transitions.
[2026-05-26 08:57:46] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2026-05-26 08:57:46] [INFO ] Invariant cache hit.
[2026-05-26 08:57:46] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 43 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
SMT process timed out in 60772ms, After SMT, problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60777ms
Starting structural reductions in SI_LTL mode, iteration 1 : 308/518 places, 1463/1715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63580 ms. Remains : 308/518 places, 1463/1715 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 54 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 682 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-08 finished in 64364 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)) U ((!p1 U p2)&&X(X(!p1)))))'
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 512 transition count 1673
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 512 transition count 1673
Applied a total of 12 rules in 48 ms. Remains 512 /518 variables (removed 6) and now considering 1673/1715 (removed 42) transitions.
[2026-05-26 08:58:47] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2260006170377746872.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11672509826337972688.kers'
[2026-05-26 08:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2260006170377746872.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11672509826337972688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 714 rows 512 cols 1652 entries
Finished phase 1 with 483 SingleSign rule and 7 generalized
[2026-05-26 08:58:47] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11672509826337972688.kers
Total runtime 7 ms.
[2026-05-26 08:58:48] [INFO ] Implicit Places using invariants in 861 ms returned []
[2026-05-26 08:58:48] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2026-05-26 08:58:48] [INFO ] Invariant cache hit.
[2026-05-26 08:58:49] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:58:53] [INFO ] Implicit Places using invariants and state equation in 4531 ms returned []
Implicit Place search using SMT with State Equation took 5397 ms to find 0 implicit places.
Running 1666 sub problems to find dead transitions.
[2026-05-26 08:58:53] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2026-05-26 08:58:53] [INFO ] Invariant cache hit.
[2026-05-26 08:58:53] [INFO ] State equation strengthened by 226 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1666 unsolved
SMT process timed out in 30783ms, After SMT, problems are : Problem set: 0 solved, 1666 unsolved
Search for dead transitions found 0 dead transitions in 30789ms
Starting structural reductions in LTL mode, iteration 1 : 512/518 places, 1673/1715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36241 ms. Remains : 512/518 places, 1673/1715 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)) U ((!p1 U p2)&&X(X(!p1)))))'
Stuttering acceptance computed with spot in 466 ms :[(OR (NOT p2) p1), (NOT p0), (NOT p2), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), p1, p1]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-09
Product exploration explored 100000 steps with 355 reset in 846 ms.
Stack based approach found an accepted trace after 61 steps with 1 reset with depth 59 and stack size 59 in 2 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-09 finished in 37635 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((X(X(p0))&&(G(p1) U p2)))))'
Support contains 7 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 512 transition count 1673
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 512 transition count 1673
Applied a total of 12 rules in 41 ms. Remains 512 /518 variables (removed 6) and now considering 1673/1715 (removed 42) transitions.
[2026-05-26 08:59:25] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3626684014075515675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5169091327403333819.kers'
[2026-05-26 08:59:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3626684014075515675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5169091327403333819.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 714 rows 512 cols 1652 entries
Finished phase 1 with 483 SingleSign rule and 7 generalized
[2026-05-26 08:59:25] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5169091327403333819.kers
Total runtime 7 ms.
[2026-05-26 08:59:26] [INFO ] Implicit Places using invariants in 788 ms returned []
[2026-05-26 08:59:26] [INFO ] Flow matrix only has 714 transitions (discarded 959 similar events)
[2026-05-26 08:59:26] [INFO ] Invariant cache hit.
[2026-05-26 08:59:26] [INFO ] State equation strengthened by 226 read => feed constraints.
[2026-05-26 08:59:29] [INFO ] Implicit Places using invariants and state equation in 3341 ms returned []
Implicit Place search using SMT with State Equation took 4133 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 512/518 places, 1673/1715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4174 ms. Remains : 512/518 places, 1673/1715 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((X(X(p0))&&(G(p1) U p2)))))'
Stuttering acceptance computed with spot in 562 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 486 ms.
Stack based approach found an accepted trace after 61 steps with 0 reset with depth 62 and stack size 62 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-10 finished in 5298 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((X(X(p1))||(X(G(p3))&&p2))))))'
Support contains 4 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 511 transition count 1666
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 511 transition count 1666
Applied a total of 14 rules in 33 ms. Remains 511 /518 variables (removed 7) and now considering 1666/1715 (removed 49) transitions.
[2026-05-26 08:59:30] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16249376528898706038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3448825873384250296.kers'
[2026-05-26 08:59:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16249376528898706038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3448825873384250296.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 511 cols 1638 entries
Finished phase 1 with 482 SingleSign rule and 7 generalized
[2026-05-26 08:59:30] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3448825873384250296.kers
Total runtime 7 ms.
[2026-05-26 08:59:31] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2026-05-26 08:59:31] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 08:59:31] [INFO ] Invariant cache hit.
[2026-05-26 08:59:32] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 08:59:36] [INFO ] Implicit Places using invariants and state equation in 4120 ms returned []
Implicit Place search using SMT with State Equation took 5203 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2026-05-26 08:59:36] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 08:59:36] [INFO ] Invariant cache hit.
[2026-05-26 08:59:36] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
SMT process timed out in 31159ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 31165ms
Starting structural reductions in LTL mode, iteration 1 : 511/518 places, 1666/1715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36409 ms. Remains : 511/518 places, 1666/1715 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((X(X(p1))||(X(G(p3))&&p2))))))'
Stuttering acceptance computed with spot in 451 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p3), (NOT p1), true]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-12
Product exploration explored 100000 steps with 20000 reset in 785 ms.
Product exploration explored 100000 steps with 20000 reset in 585 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 68 ms. Reduced automaton from 9 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 351696 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 351696 steps, saw 233720 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2026-05-26 09:00:12] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 09:00:12] [INFO ] Invariant cache hit.
[2026-05-26 09:00:12] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/109 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/151 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 262/413 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 28/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/513 variables, 45/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 18/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/713 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/713 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/723 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/723 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/828 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/828 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 390/1218 variables, 315/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1218 variables, 174/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1218 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1218 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1218/1218 variables, and 753 constraints, problems are : Problem set: 0 solved, 1 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 511/511 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 56/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/109 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/151 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 262/413 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 28/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/513 variables, 45/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 18/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/713 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/713 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/723 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/723 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/723 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/723 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 105/828 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/828 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 390/1218 variables, 315/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1218 variables, 174/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1218 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1218 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 762 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2831 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 511/511 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3672ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 148 ms.
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1666/1666 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 511 transition count 1660
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 505 transition count 1660
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 12 place count 505 transition count 1506
Deduced a syphon composed of 154 places in 2 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 320 place count 351 transition count 1506
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 404 place count 309 transition count 1464
Applied a total of 404 rules in 119 ms. Remains 309 /511 variables (removed 202) and now considering 1464/1666 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 309/511 places, 1464/1666 transitions.
RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 368448 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :0 out of 1
Probabilistic random walk after 368448 steps, saw 158649 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
[2026-05-26 09:00:19] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11681955549084546934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7638870027589860715.kers'
[2026-05-26 09:00:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11681955549084546934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7638870027589860715.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 505 rows 309 cols 1234 entries
Finished phase 1 with 280 SingleSign rule and 7 generalized
[2026-05-26 09:00:19] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7638870027589860715.kers
Total runtime 4 ms.
[2026-05-26 09:00:19] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/78 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/299 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/399 variables, 45/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 22/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/519 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/529 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/569 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 245/814 variables, 170/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/814 variables, 170/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/814 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/814 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 309/309 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/78 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/94 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 205/299 variables, 94/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 28/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/399 variables, 45/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 22/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 120/519 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/529 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 11/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 40/569 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/569 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/569 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 245/814 variables, 170/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/814 variables, 170/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/814 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/814 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3790 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 309/309 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4331ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 66 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 70 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2026-05-26 09:00:23] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-26 09:00:23] [INFO ] Invariant cache hit.
[2026-05-26 09:00:24] [INFO ] Implicit Places using invariants in 623 ms returned []
[2026-05-26 09:00:24] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-26 09:00:24] [INFO ] Invariant cache hit.
[2026-05-26 09:00:24] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:00:26] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 2480 ms to find 0 implicit places.
[2026-05-26 09:00:26] [INFO ] Redundant transitions in 34 ms returned []
Running 1457 sub problems to find dead transitions.
[2026-05-26 09:00:26] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-26 09:00:26] [INFO ] Invariant cache hit.
[2026-05-26 09:00:26] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/814 variables, and 46 constraints, problems are : Problem set: 0 solved, 1457 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/309 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1457/1457 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/814 variables, and 66 constraints, problems are : Problem set: 0 solved, 1457 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/309 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1457 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60566ms problems are : Problem set: 0 solved, 1457 unsolved
Search for dead transitions found 0 dead transitions in 60569ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63162 ms. Remains : 309/309 places, 1464/1464 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 309 vertex of which 49 / 309 are part of one of the 7 SCC in 4 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 267 transition count 317
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 100 transition count 219
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 369 place count 100 transition count 178
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 381 place count 94 transition count 178
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 387 place count 94 transition count 172
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 393 place count 94 transition count 166
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 435 place count 94 transition count 124
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 477 place count 52 transition count 124
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 484 place count 52 transition count 124
Applied a total of 484 rules in 49 ms. Remains 52 /309 variables (removed 257) and now considering 124/1464 (removed 1340) 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-14284403315427941539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7192867761201244735.kers'
[2026-05-26 09:01:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14284403315427941539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7192867761201244735.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 124 rows 46 cols 430 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-26 09:01:27] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7192867761201244735.kers
Total runtime 3 ms.
[2026-05-26 09:01:27] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 09:01:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2026-05-26 09:01:27] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 09:01:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-26 09:01:27] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 09:01:27] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 09:01:27] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 213 ms.
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Knowledge-based reduction took 78455 ms.
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 3 out of 511 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Applied a total of 0 rules in 18 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2026-05-26 09:01:27] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12643116806361745511.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13807907396336125188.kers'
[2026-05-26 09:01:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12643116806361745511.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13807907396336125188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 511 cols 1638 entries
Finished phase 1 with 482 SingleSign rule and 7 generalized
[2026-05-26 09:01:27] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13807907396336125188.kers
Total runtime 5 ms.
[2026-05-26 09:01:28] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2026-05-26 09:01:28] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 09:01:28] [INFO ] Invariant cache hit.
[2026-05-26 09:01:29] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:01:32] [INFO ] Implicit Places using invariants and state equation in 3863 ms returned []
Implicit Place search using SMT with State Equation took 4994 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2026-05-26 09:01:32] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 09:01:32] [INFO ] Invariant cache hit.
[2026-05-26 09:01:32] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
SMT process timed out in 31281ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 31286ms
Finished structural reductions in LTL mode , in 1 iterations and 36306 ms. Remains : 511/511 places, 1666/1666 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 72 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 357880 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 357880 steps, saw 237423 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2026-05-26 09:02:07] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 09:02:07] [INFO ] Invariant cache hit.
[2026-05-26 09:02:07] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/109 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/151 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 262/413 variables, 151/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 28/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/513 variables, 45/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/513 variables, 18/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/713 variables, 5/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/713 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/723 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/723 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 105/828 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/828 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 390/1218 variables, 315/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1218 variables, 174/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1218 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1218 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1218/1218 variables, and 753 constraints, problems are : Problem set: 0 solved, 1 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 511/511 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 56/59 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/109 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/151 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 262/413 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 28/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/513 variables, 45/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/513 variables, 18/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/513 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/513 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/713 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/713 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/723 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/723 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/723 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/723 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 105/828 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/828 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 390/1218 variables, 315/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1218 variables, 174/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1218 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1218 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 762 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2594 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 511/511 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3459ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 149 ms.
Support contains 3 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1666/1666 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 511 transition count 1660
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 505 transition count 1660
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 12 place count 505 transition count 1506
Deduced a syphon composed of 154 places in 2 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 320 place count 351 transition count 1506
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 404 place count 309 transition count 1464
Applied a total of 404 rules in 116 ms. Remains 309 /511 variables (removed 202) and now considering 1464/1666 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 309/511 places, 1464/1666 transitions.
RANDOM walk for 40000 steps (8 resets) in 236 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355472 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355472 steps, saw 154318 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
[2026-05-26 09:02:14] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16514320638628505984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17481065361061138946.kers'
[2026-05-26 09:02:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16514320638628505984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17481065361061138946.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 505 rows 309 cols 1234 entries
Finished phase 1 with 280 SingleSign rule and 7 generalized
[2026-05-26 09:02:14] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17481065361061138946.kers
Total runtime 3 ms.
[2026-05-26 09:02:14] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/78 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/94 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/299 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 28/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 100/399 variables, 45/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 22/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/519 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/519 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/529 variables, 5/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 40/569 variables, 5/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 245/814 variables, 170/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/814 variables, 170/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/814 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/814 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 309/309 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 41/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/78 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/94 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 205/299 variables, 94/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 28/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 100/399 variables, 45/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 22/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 120/519 variables, 5/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/519 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/529 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 11/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 40/569 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/569 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/569 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 245/814 variables, 170/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/814 variables, 170/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/814 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/814 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3335 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 309/309 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3789ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 125 ms.
Support contains 3 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 61 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 60 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2026-05-26 09:02:18] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-26 09:02:18] [INFO ] Invariant cache hit.
[2026-05-26 09:02:18] [INFO ] Implicit Places using invariants in 636 ms returned []
[2026-05-26 09:02:18] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-26 09:02:18] [INFO ] Invariant cache hit.
[2026-05-26 09:02:19] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:02:21] [INFO ] Implicit Places using invariants and state equation in 2284 ms returned []
Implicit Place search using SMT with State Equation took 2923 ms to find 0 implicit places.
[2026-05-26 09:02:21] [INFO ] Redundant transitions in 53 ms returned []
Running 1457 sub problems to find dead transitions.
[2026-05-26 09:02:21] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-26 09:02:21] [INFO ] Invariant cache hit.
[2026-05-26 09:02:21] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
SMT process timed out in 30733ms, After SMT, problems are : Problem set: 0 solved, 1457 unsolved
Search for dead transitions found 0 dead transitions in 30739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33790 ms. Remains : 309/309 places, 1464/1464 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 309 vertex of which 49 / 309 are part of one of the 7 SCC in 6 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 267 transition count 317
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 100 transition count 219
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 369 place count 100 transition count 178
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 381 place count 94 transition count 178
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 387 place count 94 transition count 172
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 393 place count 94 transition count 166
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 435 place count 94 transition count 124
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 477 place count 52 transition count 124
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 484 place count 52 transition count 124
Applied a total of 484 rules in 48 ms. Remains 52 /309 variables (removed 257) and now considering 124/1464 (removed 1340) 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-18323574535270217487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2856158263066705699.kers'
[2026-05-26 09:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18323574535270217487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2856158263066705699.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 124 rows 46 cols 430 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-26 09:02:51] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2856158263066705699.kers
Total runtime 3 ms.
[2026-05-26 09:02:51] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 09:02:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2026-05-26 09:02:52] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 09:02:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-26 09:02:52] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 09:02:52] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 09:02:52] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 279 ms.
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Knowledge-based reduction took 48385 ms.
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 745 ms.
Product exploration explored 100000 steps with 20000 reset in 793 ms.
Spot run failed in 115 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/ltsmin6546798461896902034
[2026-05-26 09:02:54] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6546798461896902034
Running compilation step : cd /tmp/ltsmin6546798461896902034;'/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/ltsmin6546798461896902034;'/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/ltsmin6546798461896902034;'/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 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 1666/1666 transitions.
Applied a total of 0 rules in 17 ms. Remains 511 /511 variables (removed 0) and now considering 1666/1666 (removed 0) transitions.
[2026-05-26 09:02:57] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16370259447418339757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14779952299000456285.kers'
[2026-05-26 09:02:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16370259447418339757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14779952299000456285.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 511 cols 1638 entries
Finished phase 1 with 482 SingleSign rule and 7 generalized
[2026-05-26 09:02:57] [INFO ] Computed 22 invariants in 5 ms
Computed 22 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14779952299000456285.kers
Total runtime 8 ms.
[2026-05-26 09:02:58] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2026-05-26 09:02:58] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 09:02:58] [INFO ] Invariant cache hit.
[2026-05-26 09:02:59] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:03:02] [INFO ] Implicit Places using invariants and state equation in 4093 ms returned []
Implicit Place search using SMT with State Equation took 5169 ms to find 0 implicit places.
Running 1659 sub problems to find dead transitions.
[2026-05-26 09:03:02] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 09:03:02] [INFO ] Invariant cache hit.
[2026-05-26 09:03:02] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1659 unsolved
SMT process timed out in 31145ms, After SMT, problems are : Problem set: 0 solved, 1659 unsolved
Search for dead transitions found 0 dead transitions in 31152ms
Finished structural reductions in LTL mode , in 1 iterations and 36345 ms. Remains : 511/511 places, 1666/1666 transitions.
Built C files in :
/tmp/ltsmin17753804399111750565
[2026-05-26 09:03:34] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17753804399111750565
Running compilation step : cd /tmp/ltsmin17753804399111750565;'/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/ltsmin17753804399111750565;'/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/ltsmin17753804399111750565;'/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 09:03:37] [INFO ] Flatten gal took : 77 ms
[2026-05-26 09:03:37] [INFO ] Flatten gal took : 74 ms
[2026-05-26 09:03:37] [INFO ] Time to serialize gal into /tmp/LTL4510280099953027436.gal : 11 ms
[2026-05-26 09:03:37] [INFO ] Time to serialize properties into /tmp/LTL10635299466323152459.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/LTL4510280099953027436.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2056703525405985185.hoa' '-atoms' '/tmp/LTL10635299466323152459.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...318
Loading property file /tmp/LTL10635299466323152459.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2056703525405985185.hoa
Detected timeout of ITS tools.
[2026-05-26 09:03:52] [INFO ] Flatten gal took : 44 ms
[2026-05-26 09:03:52] [INFO ] Flatten gal took : 76 ms
[2026-05-26 09:03:52] [INFO ] Time to serialize gal into /tmp/LTL7732416553837590912.gal : 15 ms
[2026-05-26 09:03:52] [INFO ] Time to serialize properties into /tmp/LTL11170298923854727552.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/LTL7732416553837590912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11170298923854727552.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(("(p12_1_4==1)")||(X((X(X("(((turn_4==0)||(flag_4_active==0))||(p25_3_7==0))")))||(("((turn_4==1)&&(flag_4_active==1))")&&(("(p25...233
Formula 0 simplified : X(!"(p12_1_4==1)" & X(XX!"(((turn_4==0)||(flag_4_active==0))||(p25_3_7==0))" & (!"((turn_4==1)&&(flag_4_active==1))" | !"(p25_3_7==1...217
Detected timeout of ITS tools.
[2026-05-26 09:04:07] [INFO ] Flatten gal took : 38 ms
[2026-05-26 09:04:07] [INFO ] Applying decomposition
[2026-05-26 09:04:07] [INFO ] Flatten gal took : 41 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/graph6750719337040822093.txt' '-o' '/tmp/graph6750719337040822093.bin' '-w' '/tmp/graph6750719337040822093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6750719337040822093.bin' '-l' '-1' '-v' '-w' '/tmp/graph6750719337040822093.weights' '-q' '0' '-e' '0.001'
[2026-05-26 09:04:07] [INFO ] Decomposing Gal with order
[2026-05-26 09:04:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 09:04:08] [INFO ] Removed a total of 3021 redundant transitions.
[2026-05-26 09:04:08] [INFO ] Flatten gal took : 210 ms
[2026-05-26 09:04:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 450 labels/synchronizations in 104 ms.
[2026-05-26 09:04:08] [INFO ] Time to serialize gal into /tmp/LTL10839264453471849844.gal : 26 ms
[2026-05-26 09:04:08] [INFO ] Time to serialize properties into /tmp/LTL3596188253259700277.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/LTL10839264453471849844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3596188253259700277.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(("(i4.u12.p12_1_4==1)")||(X((X(X("(((i0.u0.turn_4==0)||(i14.i0.i0.u5.flag_4_active==0))||(i15.u3.p25_3_7==0))")))||(("((i0.u0.tur...318
Formula 0 simplified : X(!"(i4.u12.p12_1_4==1)" & X(XX!"(((i0.u0.turn_4==0)||(i14.i0.i0.u5.flag_4_active==0))||(i15.u3.p25_3_7==0))" & (!"((i0.u0.turn_4==1...302
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-12 finished in 292672 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(p0)&&X(X(F(p1)))))'
Support contains 4 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 1715/1715 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 511 transition count 1666
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 511 transition count 1666
Applied a total of 14 rules in 36 ms. Remains 511 /518 variables (removed 7) and now considering 1666/1715 (removed 49) transitions.
[2026-05-26 09:04:23] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 09:04:23] [INFO ] Invariant cache hit.
[2026-05-26 09:04:24] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2026-05-26 09:04:24] [INFO ] Flow matrix only has 707 transitions (discarded 959 similar events)
[2026-05-26 09:04:24] [INFO ] Invariant cache hit.
[2026-05-26 09:04:25] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-26 09:04:28] [INFO ] Implicit Places using invariants and state equation in 3981 ms returned []
Implicit Place search using SMT with State Equation took 5087 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 511/518 places, 1666/1715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5125 ms. Remains : 511/518 places, 1666/1715 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)&&X(X(F(p1)))))'
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-07-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 401 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 0 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-07-LTLFireability-13 finished in 5777 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)))'
Spot run failed in 86 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((X(X(p1))||(X(G(p3))&&p2))))))'
Spot run failed in 78 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 09:04:29] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15726510060725676850
[2026-05-26 09:04:29] [INFO ] Too many transitions (1715) to apply POR reductions. Disabling POR matrices.
[2026-05-26 09:04:29] [INFO ] Applying decomposition
[2026-05-26 09:04:29] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15726510060725676850
Running compilation step : cd /tmp/ltsmin15726510060725676850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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 09:04:29] [INFO ] Flatten gal took : 80 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/graph474893251436465008.txt' '-o' '/tmp/graph474893251436465008.bin' '-w' '/tmp/graph474893251436465008.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph474893251436465008.bin' '-l' '-1' '-v' '-w' '/tmp/graph474893251436465008.weights' '-q' '0' '-e' '0.001'
[2026-05-26 09:04:29] [INFO ] Decomposing Gal with order
[2026-05-26 09:04:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 09:04:30] [INFO ] Removed a total of 3107 redundant transitions.
[2026-05-26 09:04:30] [INFO ] Flatten gal took : 196 ms
[2026-05-26 09:04:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 411 labels/synchronizations in 72 ms.
[2026-05-26 09:04:30] [INFO ] Time to serialize gal into /tmp/LTLFireability17618777176214660119.gal : 27 ms
[2026-05-26 09:04:30] [INFO ] Time to serialize properties into /tmp/LTLFireability6469966286887914515.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/LTLFireability17618777176214660119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6469966286887914515.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 : !((F(G("((i12.i0.u1.turn_1!=1)||(i0.i0.u35.p10_4_6!=1))"))))
Formula 0 simplified : GF!"((i12.i0.u1.turn_1!=1)||(i0.i0.u35.p10_4_6!=1))"
Compilation finished in 6342 ms.
Running link step : cd /tmp/ltsmin15726510060725676850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin15726510060725676850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 281418 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin15726510060725676850;'/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(((LTLAPp1==true)||X((X(X((LTLAPp2==true)))||(X([]((LTLAPp4==true)))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 225 ms.
FORMULA EisenbergMcGuire-PT-07-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1351540 ms.
BK_STOP 1779786558077
--------------------
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-07"
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-07, 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-177955740500268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 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 ;