About the Execution of ITS-Tools for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16189.415 | 3600000.00 | 5504314.00 | 27509.00 | FFTTTF?F?TFFFF?F | 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-177955740500292.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740500292
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 8.6K Mar 7 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 7 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K 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.2K Mar 15 09:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 09:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 05:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 05:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 05:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:49 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 3.1M 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-10-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779817612293
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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 17:46:54] [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 17:46:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 17:46:55] [INFO ] Load time of PNML (sax parser for PT used): 716 ms
[2026-05-26 17:46:55] [INFO ] Transformed 1090 places.
[2026-05-26 17:46:55] [INFO ] Transformed 5200 transitions.
[2026-05-26 17:46:55] [INFO ] Found NUPN structural information;
[2026-05-26 17:46:55] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 969 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 1090 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 1004 transition count 4340
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 1004 transition count 4340
Applied a total of 172 rules in 406 ms. Remains 1004 /1090 variables (removed 86) and now considering 4340/5200 (removed 860) transitions.
[2026-05-26 17:46:56] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11960607617045087379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7617111297016749930.kers'
[2026-05-26 17:46:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11960607617045087379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7617111297016749930.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1470 rows 1004 cols 3380 entries
Finished phase 1 with 963 SingleSign rule and 10 generalized
[2026-05-26 17:46:56] [INFO ] Computed 31 invariants in 10 ms
Computed 31 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-7617111297016749930.kers
Total runtime 13 ms.
[2026-05-26 17:46:59] [INFO ] Implicit Places using invariants in 2953 ms returned []
[2026-05-26 17:46:59] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2026-05-26 17:46:59] [INFO ] Invariant cache hit.
[2026-05-26 17:47:01] [INFO ] State equation strengthened by 472 read => feed constraints.
[2026-05-26 17:47:14] [INFO ] Implicit Places using invariants and state equation in 14485 ms returned []
Implicit Place search using SMT with State Equation took 17510 ms to find 0 implicit places.
Running 4330 sub problems to find dead transitions.
[2026-05-26 17:47:14] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2026-05-26 17:47:14] [INFO ] Invariant cache hit.
[2026-05-26 17:47:14] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1004 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4330 unsolved
SMT process timed out in 33392ms, After SMT, problems are : Problem set: 0 solved, 4330 unsolved
Search for dead transitions found 0 dead transitions in 33510ms
Starting structural reductions in LTL mode, iteration 1 : 1004/1090 places, 4340/5200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51551 ms. Remains : 1004/1090 places, 4340/5200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Applied a total of 0 rules in 74 ms. Remains 1004 /1004 variables (removed 0) and now considering 4340/4340 (removed 0) transitions.
[2026-05-26 17:47:47] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2026-05-26 17:47:47] [INFO ] Invariant cache hit.
[2026-05-26 17:47:49] [INFO ] Implicit Places using invariants in 1764 ms returned []
[2026-05-26 17:47:49] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2026-05-26 17:47:49] [INFO ] Invariant cache hit.
[2026-05-26 17:47:50] [INFO ] State equation strengthened by 472 read => feed constraints.
[2026-05-26 17:48:03] [INFO ] Implicit Places using invariants and state equation in 13835 ms returned []
Implicit Place search using SMT with State Equation took 15604 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 15682 ms. Remains : 1004/1004 places, 4340/4340 transitions.
Support contains 59 out of 1004 places after structural reductions.
[2026-05-26 17:48:04] [INFO ] Flatten gal took : 688 ms
[2026-05-26 17:48:04] [INFO ] Flatten gal took : 280 ms
[2026-05-26 17:48:05] [INFO ] Input system was already deterministic with 4340 transitions.
RANDOM walk for 40000 steps (8 resets) in 3048 ms. (13 steps per ms) remains 29/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
[2026-05-26 17:48:06] [INFO ] Flow matrix only has 1470 transitions (discarded 2870 similar events)
[2026-05-26 17:48:06] [INFO ] Invariant cache hit.
[2026-05-26 17:48:06] [INFO ] State equation strengthened by 472 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 648/702 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
SMT process timed out in 5127ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 1004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1004 transition count 4332
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 996 transition count 4332
Performed 306 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 306 Pre rules applied. Total rules applied 16 place count 996 transition count 4026
Deduced a syphon composed of 306 places in 8 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 2 with 612 rules applied. Total rules applied 628 place count 690 transition count 4026
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 630 place count 688 transition count 4006
Iterating global reduction 2 with 2 rules applied. Total rules applied 632 place count 688 transition count 4006
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 8 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 812 place count 598 transition count 3916
Applied a total of 812 rules in 847 ms. Remains 598 /1004 variables (removed 406) and now considering 3916/4340 (removed 424) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 848 ms. Remains : 598/1004 places, 3916/4340 transitions.
RANDOM walk for 40000 steps (8 resets) in 1049 ms. (38 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
Interrupted probabilistic random walk after 103587 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :4 out of 29
Probabilistic random walk after 103587 steps, saw 76445 distinct states, run finished after 3009 ms. (steps per millisecond=34 ) properties seen :4
[2026-05-26 17:48:15] [INFO ] Flow matrix only has 1046 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5550221639763395725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18045442704846524610.kers'
[2026-05-26 17:48:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5550221639763395725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18045442704846524610.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1046 rows 598 cols 2532 entries
Finished phase 1 with 557 SingleSign rule and 10 generalized
[2026-05-26 17:48:15] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18045442704846524610.kers
Total runtime 6 ms.
[2026-05-26 17:48:16] [INFO ] State equation strengthened by 454 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 396/444 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 44/488 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 110/598 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 1046/1644 variables, 598/641 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1644 variables, 454/1095 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1644 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/1644 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1644/1644 variables, and 1095 constraints, problems are : Problem set: 0 solved, 25 unsolved in 11905 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 598/598 constraints, ReadFeed: 454/454 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 396/444 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 44/488 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 110/598 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 1046/1644 variables, 598/663 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1644 variables, 454/1117 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1644 variables, 25/1142 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1644 variables, 2/1144 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1644 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1644 variables, 2/1147 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1644 variables, 3/1150 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1644/1644 variables, and 1150 constraints, problems are : Problem set: 0 solved, 25 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 598/598 constraints, ReadFeed: 454/454 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56971ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 3916/3916 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 598 transition count 3912
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 594 transition count 3912
Applied a total of 8 rules in 266 ms. Remains 594 /598 variables (removed 4) and now considering 3912/3916 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 594/598 places, 3912/3916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1051 ms. (38 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 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 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 13 ms. (286 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 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 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 10 ms. (364 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 16 ms. (235 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
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 109043 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 25
Probabilistic random walk after 109043 steps, saw 80101 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2026-05-26 17:49:16] [INFO ] Flow matrix only has 1042 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11482297450006128839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7427137632867242555.kers'
[2026-05-26 17:49:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11482297450006128839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7427137632867242555.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1042 rows 594 cols 2524 entries
Finished phase 1 with 553 SingleSign rule and 10 generalized
[2026-05-26 17:49:16] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-7427137632867242555.kers
Total runtime 8 ms.
[2026-05-26 17:49:16] [INFO ] State equation strengthened by 454 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 392/440 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 44/484 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 110/594 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 1042/1636 variables, 594/625 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1636 variables, 454/1079 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1636 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/1636 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1636/1636 variables, and 1079 constraints, problems are : Problem set: 0 solved, 25 unsolved in 7244 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 594/594 constraints, ReadFeed: 454/454 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 392/440 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 44/484 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 110/594 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/594 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/594 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/594 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/594 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 1042/1636 variables, 594/665 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1636 variables, 454/1119 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1636 variables, 25/1144 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1636 variables, 2/1146 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1636 variables, 1/1147 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1636 variables, 1/1148 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1636 variables, 1/1149 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1636 variables, 4/1153 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 0/1153 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1636/1636 variables, and 1153 constraints, problems are : Problem set: 0 solved, 25 unsolved in 75015 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 594/594 constraints, ReadFeed: 454/454 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 82309ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 3912/3912 transitions.
Applied a total of 0 rules in 314 ms. Remains 594 /594 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 594/594 places, 3912/3912 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 3912/3912 transitions.
Applied a total of 0 rules in 297 ms. Remains 594 /594 variables (removed 0) and now considering 3912/3912 (removed 0) transitions.
[2026-05-26 17:50:39] [INFO ] Flow matrix only has 1042 transitions (discarded 2870 similar events)
[2026-05-26 17:50:39] [INFO ] Invariant cache hit.
[2026-05-26 17:50:40] [INFO ] Implicit Places using invariants in 1142 ms returned []
[2026-05-26 17:50:40] [INFO ] Flow matrix only has 1042 transitions (discarded 2870 similar events)
[2026-05-26 17:50:40] [INFO ] Invariant cache hit.
[2026-05-26 17:50:41] [INFO ] State equation strengthened by 454 read => feed constraints.
[2026-05-26 17:50:47] [INFO ] Implicit Places using invariants and state equation in 6927 ms returned []
Implicit Place search using SMT with State Equation took 8073 ms to find 0 implicit places.
[2026-05-26 17:50:48] [INFO ] Redundant transitions in 416 ms returned []
Running 3902 sub problems to find dead transitions.
[2026-05-26 17:50:48] [INFO ] Flow matrix only has 1042 transitions (discarded 2870 similar events)
[2026-05-26 17:50:48] [INFO ] Invariant cache hit.
[2026-05-26 17:50:48] [INFO ] State equation strengthened by 454 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
SMT process timed out in 31877ms, After SMT, problems are : Problem set: 0 solved, 3902 unsolved
Search for dead transitions found 0 dead transitions in 31892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40699 ms. Remains : 594/594 places, 3912/3912 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(((p2 U p3)&&p1))))'
Support contains 10 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1004 transition count 4331
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 995 transition count 4331
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 18 place count 995 transition count 4022
Deduced a syphon composed of 309 places in 7 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 636 place count 686 transition count 4022
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 639 place count 683 transition count 3992
Iterating global reduction 2 with 3 rules applied. Total rules applied 642 place count 683 transition count 3992
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 7 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 822 place count 593 transition count 3902
Applied a total of 822 rules in 958 ms. Remains 593 /1004 variables (removed 411) and now considering 3902/4340 (removed 438) transitions.
[2026-05-26 17:51:21] [INFO ] Flow matrix only has 1032 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9571681366526911226.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14311091690435459636.kers'
[2026-05-26 17:51:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9571681366526911226.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14311091690435459636.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1032 rows 593 cols 2504 entries
Finished phase 1 with 552 SingleSign rule and 10 generalized
[2026-05-26 17:51:21] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14311091690435459636.kers
Total runtime 10 ms.
[2026-05-26 17:51:23] [INFO ] Implicit Places using invariants in 2003 ms returned []
[2026-05-26 17:51:23] [INFO ] Flow matrix only has 1032 transitions (discarded 2870 similar events)
[2026-05-26 17:51:23] [INFO ] Invariant cache hit.
[2026-05-26 17:51:24] [INFO ] State equation strengthened by 445 read => feed constraints.
[2026-05-26 17:51:31] [INFO ] Implicit Places using invariants and state equation in 8541 ms returned []
Implicit Place search using SMT with State Equation took 10553 ms to find 0 implicit places.
[2026-05-26 17:51:32] [INFO ] Redundant transitions in 397 ms returned []
Running 3892 sub problems to find dead transitions.
[2026-05-26 17:51:32] [INFO ] Flow matrix only has 1032 transitions (discarded 2870 similar events)
[2026-05-26 17:51:32] [INFO ] Invariant cache hit.
[2026-05-26 17:51:32] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/593 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3892 unsolved
SMT process timed out in 32141ms, After SMT, problems are : Problem set: 0 solved, 3892 unsolved
Search for dead transitions found 0 dead transitions in 32170ms
Starting structural reductions in SI_LTL mode, iteration 1 : 593/1004 places, 3902/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44107 ms. Remains : 593/1004 places, 3902/4340 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' '!((!p0 U G(((p2 U p3)&&p1))))'
Stuttering acceptance computed with spot in 584 ms :[(OR (NOT p1) (NOT p3)), true, (NOT p3), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 189 steps with 0 reset in 15 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-01 finished in 44902 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((X(!p0)||(!p1&&F(!p2)))) U X(X(!p1))))'
Support contains 8 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 133 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2026-05-26 17:52:05] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9194164693008879769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18287193910296071716.kers'
[2026-05-26 17:52:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9194164693008879769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18287193910296071716.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1430 rows 1000 cols 3300 entries
Finished phase 1 with 959 SingleSign rule and 10 generalized
[2026-05-26 17:52:05] [INFO ] Computed 31 invariants in 12 ms
Computed 31 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-18287193910296071716.kers
Total runtime 30 ms.
[2026-05-26 17:52:07] [INFO ] Implicit Places using invariants in 2407 ms returned []
[2026-05-26 17:52:07] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:52:07] [INFO ] Invariant cache hit.
[2026-05-26 17:52:08] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:52:24] [INFO ] Implicit Places using invariants and state equation in 16832 ms returned []
Implicit Place search using SMT with State Equation took 19244 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2026-05-26 17:52:24] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:52:24] [INFO ] Invariant cache hit.
[2026-05-26 17:52:24] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 32195ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 32208ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51605 ms. Remains : 1000/1004 places, 4300/4340 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((X(!p0)||(!p1&&F(!p2)))) U X(X(!p1))))'
Stuttering acceptance computed with spot in 531 ms :[p1, p1, (AND p1 p2 p0), false, p1, (AND p2 p0 p1), false, (AND p2 p0 p1), false, (AND p2 p0), (AND p2 p0 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 1363 ms.
Product exploration explored 100000 steps with 33333 reset in 989 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 21 ms. Proved property starting from automaton with 11 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 49 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-03 finished in 54640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 102 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2026-05-26 17:52:59] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:52:59] [INFO ] Invariant cache hit.
[2026-05-26 17:53:02] [INFO ] Implicit Places using invariants in 2451 ms returned []
[2026-05-26 17:53:02] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:53:02] [INFO ] Invariant cache hit.
[2026-05-26 17:53:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:53:19] [INFO ] Implicit Places using invariants and state equation in 17598 ms returned []
Implicit Place search using SMT with State Equation took 20057 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20162 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 1145 ms.
Product exploration explored 100000 steps with 25000 reset in 1083 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 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 185603 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 1
Probabilistic random walk after 185603 steps, saw 147444 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2026-05-26 17:53:25] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:53:25] [INFO ] Invariant cache hit.
[2026-05-26 17:53:25] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 305/414 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 234/648 variables, 108/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 25/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 495/1143 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1143 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/1161 variables, 9/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1161 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 270/1431 variables, 9/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1431 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 999/2430 variables, 783/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2430 variables, 397/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 305/414 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 234/648 variables, 108/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 495/1143 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1143 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/1161 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1161 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 6714ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 990 transition count 3980
Deduced a syphon composed of 310 places in 7 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 7 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 590 transition count 3890
Applied a total of 820 rules in 484 ms. Remains 590 /1000 variables (removed 410) and now considering 3890/4300 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 590/1000 places, 3890/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 203676 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 1
Probabilistic random walk after 203676 steps, saw 141316 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2026-05-26 17:53:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15100888023584503037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8819406686811021517.kers'
[2026-05-26 17:53:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15100888023584503037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8819406686811021517.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1020 rows 590 cols 2480 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:53:36] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8819406686811021517.kers
Total runtime 5 ms.
[2026-05-26 17:53:36] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 264/332 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 297/863 variables, 9/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/863 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/881 variables, 9/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/881 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 99/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1126 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 264/332 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 297/863 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/863 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/881 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/881 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/881 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/881 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 99/980 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/980 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 630/1610 variables, 414/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 389/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10224 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11378ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 610 ms.
Support contains 2 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 287 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 275 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-26 17:53:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:53:48] [INFO ] Invariant cache hit.
[2026-05-26 17:53:50] [INFO ] Implicit Places using invariants in 1881 ms returned []
[2026-05-26 17:53:50] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:53:50] [INFO ] Invariant cache hit.
[2026-05-26 17:53:51] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:53:58] [INFO ] Implicit Places using invariants and state equation in 8298 ms returned []
Implicit Place search using SMT with State Equation took 10183 ms to find 0 implicit places.
[2026-05-26 17:53:59] [INFO ] Redundant transitions in 773 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-26 17:53:59] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:53:59] [INFO ] Invariant cache hit.
[2026-05-26 17:53:59] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32045ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43320 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3659 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 5 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 738 place count 171 transition count 342
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 758 place count 161 transition count 342
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 768 place count 161 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 778 place count 161 transition count 322
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 868 place count 161 transition count 232
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 123 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) 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-9155833505371381152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6564889862715042786.kers'
[2026-05-26 17:54:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9155833505371381152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6564889862715042786.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 232 rows 61 cols 836 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-26 17:54:31] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6564889862715042786.kers
Total runtime 2 ms.
[2026-05-26 17:54:31] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2026-05-26 17:54:31] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 17:54:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2026-05-26 17:54:32] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 17:54:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-26 17:54:32] [INFO ] After 21ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 17:54:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
TRAPS : Iteration 1
[2026-05-26 17:54:32] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 17:54:32] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 631 ms.
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 70033 ms.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 50 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2026-05-26 17:54:32] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16504583429763053946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13795625791908445261.kers'
[2026-05-26 17:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16504583429763053946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13795625791908445261.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1430 rows 1000 cols 3300 entries
Finished phase 1 with 959 SingleSign rule and 10 generalized
[2026-05-26 17:54:32] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13795625791908445261.kers
Total runtime 9 ms.
[2026-05-26 17:54:35] [INFO ] Implicit Places using invariants in 2720 ms returned []
[2026-05-26 17:54:35] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:54:35] [INFO ] Invariant cache hit.
[2026-05-26 17:54:36] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:54:51] [INFO ] Implicit Places using invariants and state equation in 16367 ms returned []
Implicit Place search using SMT with State Equation took 19091 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2026-05-26 17:54:51] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:54:51] [INFO ] Invariant cache hit.
[2026-05-26 17:54:51] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 32461ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 32472ms
Finished structural reductions in LTL mode , in 1 iterations and 51629 ms. Remains : 1000/1000 places, 4300/4300 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 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 320 ms. (124 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 191664 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 191664 steps, saw 152265 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2026-05-26 17:55:27] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:55:27] [INFO ] Invariant cache hit.
[2026-05-26 17:55:27] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 305/414 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 234/648 variables, 108/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/648 variables, 25/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 495/1143 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1143 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/1161 variables, 9/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1161 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 270/1431 variables, 9/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1431 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 999/2430 variables, 783/1070 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2430 variables, 397/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/109 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 305/414 variables, 109/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 234/648 variables, 108/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 25/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 495/1143 variables, 9/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1143 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/1161 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1161 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 7147ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 990 transition count 3980
Deduced a syphon composed of 310 places in 6 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 590 transition count 3890
Applied a total of 820 rules in 478 ms. Remains 590 /1000 variables (removed 410) and now considering 3890/4300 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 590/1000 places, 3890/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 210276 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 210276 steps, saw 145461 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2026-05-26 17:55:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6479740038230764799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16371167099080779911.kers'
[2026-05-26 17:55:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6479740038230764799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16371167099080779911.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1020 rows 590 cols 2480 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 17:55:38] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16371167099080779911.kers
Total runtime 6 ms.
[2026-05-26 17:55:38] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 264/332 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 234/566 variables, 108/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 33/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 297/863 variables, 9/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/863 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/881 variables, 9/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/881 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 99/980 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/980 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 630/1610 variables, 414/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1610 variables, 389/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 1 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/57 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/68 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 264/332 variables, 68/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/332 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 234/566 variables, 108/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 33/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 297/863 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/863 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/881 variables, 9/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/881 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/881 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/881 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 99/980 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/980 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/980 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 630/1610 variables, 414/691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 389/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1610 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7939 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8707ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 298 ms.
Support contains 2 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 206 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 201 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-26 17:55:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:55:47] [INFO ] Invariant cache hit.
[2026-05-26 17:55:49] [INFO ] Implicit Places using invariants in 1507 ms returned []
[2026-05-26 17:55:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:55:49] [INFO ] Invariant cache hit.
[2026-05-26 17:55:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:55:57] [INFO ] Implicit Places using invariants and state equation in 7990 ms returned []
Implicit Place search using SMT with State Equation took 9500 ms to find 0 implicit places.
[2026-05-26 17:55:57] [INFO ] Redundant transitions in 326 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-26 17:55:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 17:55:57] [INFO ] Invariant cache hit.
[2026-05-26 17:55:57] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32550ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32561ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42614 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3659 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 2 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 350 transition count 610
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 738 place count 171 transition count 342
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 758 place count 161 transition count 342
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 768 place count 161 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 778 place count 161 transition count 322
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 868 place count 161 transition count 232
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 88 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) 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-2129479219239829682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10698736551621107517.kers'
[2026-05-26 17:56:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2129479219239829682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10698736551621107517.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 232 rows 61 cols 836 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-26 17:56:30] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10698736551621107517.kers
Total runtime 3 ms.
[2026-05-26 17:56:30] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-26 17:56:30] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 17:56:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-26 17:56:30] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 17:56:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-26 17:56:30] [INFO ] After 27ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 17:56:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
TRAPS : Iteration 1
[2026-05-26 17:56:30] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 17:56:30] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 662 ms.
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 66829 ms.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1107 ms.
Product exploration explored 100000 steps with 25000 reset in 1180 ms.
Spot run failed in 153 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/ltsmin6632891188444495533
[2026-05-26 17:56:34] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6632891188444495533
Running compilation step : cd /tmp/ltsmin6632891188444495533;'/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/ltsmin6632891188444495533;'/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/ltsmin6632891188444495533;'/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 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 73 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2026-05-26 17:56:37] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7448954827973871571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2311213605765640313.kers'
[2026-05-26 17:56:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7448954827973871571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2311213605765640313.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1430 rows 1000 cols 3300 entries
Finished phase 1 with 959 SingleSign rule and 10 generalized
[2026-05-26 17:56:37] [INFO ] Computed 31 invariants in 10 ms
Computed 31 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-2311213605765640313.kers
Total runtime 14 ms.
[2026-05-26 17:56:40] [INFO ] Implicit Places using invariants in 3028 ms returned []
[2026-05-26 17:56:40] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:56:40] [INFO ] Invariant cache hit.
[2026-05-26 17:56:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:56:56] [INFO ] Implicit Places using invariants and state equation in 16550 ms returned []
Implicit Place search using SMT with State Equation took 19582 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2026-05-26 17:56:56] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:56:56] [INFO ] Invariant cache hit.
[2026-05-26 17:56:56] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 32485ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 32496ms
Finished structural reductions in LTL mode , in 1 iterations and 52161 ms. Remains : 1000/1000 places, 4300/4300 transitions.
Built C files in :
/tmp/ltsmin12692010477380355947
[2026-05-26 17:57:29] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12692010477380355947
Running compilation step : cd /tmp/ltsmin12692010477380355947;'/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/ltsmin12692010477380355947;'/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/ltsmin12692010477380355947;'/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 17:57:33] [INFO ] Flatten gal took : 662 ms
[2026-05-26 17:57:33] [INFO ] Flatten gal took : 189 ms
[2026-05-26 17:57:33] [INFO ] Time to serialize gal into /tmp/LTL7571419590349169559.gal : 75 ms
[2026-05-26 17:57:33] [INFO ] Time to serialize properties into /tmp/LTL6470164843434631224.prop : 3 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/LTL7571419590349169559.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5690489956422754021.hoa' '-atoms' '/tmp/LTL6470164843434631224.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/LTL6470164843434631224.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5690489956422754021.hoa
Detected timeout of ITS tools.
[2026-05-26 17:57:49] [INFO ] Flatten gal took : 145 ms
[2026-05-26 17:57:49] [INFO ] Flatten gal took : 145 ms
[2026-05-26 17:57:49] [INFO ] Time to serialize gal into /tmp/LTL5384643925999509808.gal : 21 ms
[2026-05-26 17:57:49] [INFO ] Time to serialize properties into /tmp/LTL11868234828894559349.ltl : 3 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/LTL5384643925999509808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11868234828894559349.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(X(X(F("((turn_8!=1)||(p27_3!=1))"))))))
Formula 0 simplified : XXXG!"((turn_8!=1)||(p27_3!=1))"
Detected timeout of ITS tools.
[2026-05-26 17:58:04] [INFO ] Flatten gal took : 126 ms
[2026-05-26 17:58:04] [INFO ] Applying decomposition
[2026-05-26 17:58:04] [INFO ] Flatten gal took : 129 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/graph12996696802410102112.txt' '-o' '/tmp/graph12996696802410102112.bin' '-w' '/tmp/graph12996696802410102112.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12996696802410102112.bin' '-l' '-1' '-v' '-w' '/tmp/graph12996696802410102112.weights' '-q' '0' '-e' '0.001'
[2026-05-26 17:58:05] [INFO ] Decomposing Gal with order
[2026-05-26 17:58:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 17:58:06] [INFO ] Removed a total of 8885 redundant transitions.
[2026-05-26 17:58:06] [INFO ] Flatten gal took : 908 ms
[2026-05-26 17:58:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 865 labels/synchronizations in 265 ms.
[2026-05-26 17:58:06] [INFO ] Time to serialize gal into /tmp/LTL17894523752577647812.gal : 40 ms
[2026-05-26 17:58:06] [INFO ] Time to serialize properties into /tmp/LTL8286731493006290448.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/LTL17894523752577647812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8286731493006290448.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((i3.u3.turn_8!=1)||(i3.u251.p27_3!=1))"))))))
Formula 0 simplified : XXXG!"((i3.u3.turn_8!=1)||(i3.u251.p27_3!=1))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-04 finished in 322003 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||G(p1))))'
Support contains 5 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 100 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2026-05-26 17:58:21] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:58:21] [INFO ] Invariant cache hit.
[2026-05-26 17:58:24] [INFO ] Implicit Places using invariants in 2954 ms returned []
[2026-05-26 17:58:24] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:58:24] [INFO ] Invariant cache hit.
[2026-05-26 17:58:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:58:41] [INFO ] Implicit Places using invariants and state equation in 16895 ms returned []
Implicit Place search using SMT with State Equation took 19868 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19977 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p1)))'
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-05 finished in 20204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(X(X(p1)))))))'
Support contains 7 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 119 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2026-05-26 17:58:42] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:58:42] [INFO ] Invariant cache hit.
[2026-05-26 17:58:44] [INFO ] Implicit Places using invariants in 2087 ms returned []
[2026-05-26 17:58:44] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:58:44] [INFO ] Invariant cache hit.
[2026-05-26 17:58:45] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:59:00] [INFO ] Implicit Places using invariants and state equation in 16247 ms returned []
Implicit Place search using SMT with State Equation took 18340 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18459 ms. Remains : 1000/1004 places, 4300/4340 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(X(p0)))&&p1))))'
Stuttering acceptance computed with spot in 451 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 20014 reset in 1511 ms.
Product exploration explored 100000 steps with 20060 reset in 1610 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 74 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1331 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 495 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 130141 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :2 out of 4
Probabilistic random walk after 130141 steps, saw 104842 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :2
[2026-05-26 17:59:08] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 17:59:08] [INFO ] Invariant cache hit.
[2026-05-26 17:59:08] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 275/282 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/286 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 120/406 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 680/1086 variables, 406/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1086 variables, 90/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 156/1242 variables, 72/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1242 variables, 36/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 330/1572 variables, 6/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1572 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/1584 variables, 6/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1584 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 180/1764 variables, 6/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1764 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 666/2430 variables, 522/1157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2430 variables, 310/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2489 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 275/282 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/286 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 120/406 variables, 4/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 680/1086 variables, 406/422 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1086 variables, 90/512 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1086 variables, 0/512 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 156/1242 variables, 72/584 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1242 variables, 36/620 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1242 variables, 0/620 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 330/1572 variables, 6/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1572 variables, 0/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/1584 variables, 6/632 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1584 variables, 1/633 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1584 variables, 4/637 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1584 variables, 1/638 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1584 variables, 2/640 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1584 variables, 0/640 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 180/1764 variables, 6/646 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1764 variables, 0/646 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 666/2430 variables, 522/1168 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2430 variables, 310/1478 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2430 variables, 1/1479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2430 variables, 0/1479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2430/2430 variables, and 1479 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7524ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1000 transition count 4291
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 991 transition count 4291
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 18 place count 991 transition count 3981
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 638 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 591 transition count 3891
Applied a total of 818 rules in 467 ms. Remains 591 /1000 variables (removed 409) and now considering 3891/4300 (removed 409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 468 ms. Remains : 591/1000 places, 3891/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 191950 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 191950 steps, saw 132882 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2026-05-26 17:59:19] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16527581838859813563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18357951297288517147.kers'
[2026-05-26 17:59:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16527581838859813563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18357951297288517147.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 17:59:19] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18357951297288517147.kers
Total runtime 7 ms.
[2026-05-26 17:59:19] [INFO ] State equation strengthened by 436 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) 46/105 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/127 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/476 variables, 127/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 34/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/684 variables, 96/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 37/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 264/948 variables, 8/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/948 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/964 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/964 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 88/1052 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 560/1612 variables, 368/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 365/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 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) 46/105 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/127 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 349/476 variables, 127/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 34/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 208/684 variables, 96/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 37/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/684 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 264/948 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/948 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/964 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/964 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/964 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 88/1052 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1052 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 560/1612 variables, 368/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1612 variables, 365/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1612 variables, 6/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1612 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1612 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1612 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1612 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4711 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5542ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 278 ms.
Support contains 3 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 323 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 317 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2026-05-26 17:59:25] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 17:59:25] [INFO ] Invariant cache hit.
[2026-05-26 17:59:27] [INFO ] Implicit Places using invariants in 1925 ms returned []
[2026-05-26 17:59:27] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 17:59:27] [INFO ] Invariant cache hit.
[2026-05-26 17:59:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 17:59:35] [INFO ] Implicit Places using invariants and state equation in 7840 ms returned []
Implicit Place search using SMT with State Equation took 9768 ms to find 0 implicit places.
[2026-05-26 17:59:36] [INFO ] Redundant transitions in 695 ms returned []
Running 3881 sub problems to find dead transitions.
[2026-05-26 17:59:36] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 17:59:36] [INFO ] Invariant cache hit.
[2026-05-26 17:59:36] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 32404ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 32414ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43230 ms. Remains : 591/591 places, 3891/3891 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 591 vertex of which 100 / 591 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 501 transition count 632
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 172 transition count 432
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 738 place count 172 transition count 343
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 756 place count 163 transition count 343
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 765 place count 163 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 774 place count 163 transition count 325
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 864 place count 163 transition count 235
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 954 place count 73 transition count 235
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 964 place count 73 transition count 235
Applied a total of 964 rules in 62 ms. Remains 73 /591 variables (removed 518) and now considering 235/3891 (removed 3656) 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-5593917180435555864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9154293904350111656.kers'
[2026-05-26 18:00:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5593917180435555864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9154293904350111656.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 235 rows 64 cols 847 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-26 18:00:08] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9154293904350111656.kers
Total runtime 2 ms.
[2026-05-26 18:00:08] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 18:00:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-26 18:00:08] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 18:00:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-26 18:00:08] [INFO ] After 26ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 18:00:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
TRAPS : Iteration 1
[2026-05-26 18:00:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
TRAPS : Iteration 2
[2026-05-26 18:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 3
[2026-05-26 18:00:09] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 18:00:09] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 683 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 65580 ms.
Stuttering acceptance computed with spot in 463 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 60 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2026-05-26 18:00:10] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16125967463390015175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5512727193169425859.kers'
[2026-05-26 18:00:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16125967463390015175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5512727193169425859.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1430 rows 1000 cols 3300 entries
Finished phase 1 with 959 SingleSign rule and 10 generalized
[2026-05-26 18:00:10] [INFO ] Computed 31 invariants in 10 ms
Computed 31 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-5512727193169425859.kers
Total runtime 12 ms.
[2026-05-26 18:00:13] [INFO ] Implicit Places using invariants in 2868 ms returned []
[2026-05-26 18:00:13] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:00:13] [INFO ] Invariant cache hit.
[2026-05-26 18:00:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:00:29] [INFO ] Implicit Places using invariants and state equation in 16527 ms returned []
Implicit Place search using SMT with State Equation took 19408 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2026-05-26 18:00:29] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:00:29] [INFO ] Invariant cache hit.
[2026-05-26 18:00:29] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 32909ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 32921ms
Finished structural reductions in LTL mode , in 1 iterations and 52403 ms. Remains : 1000/1000 places, 4300/4300 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 82 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 292 ms. (136 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 206151 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :1 out of 2
Probabilistic random walk after 206151 steps, saw 163026 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :1
[2026-05-26 18:01:05] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:01:05] [INFO ] Invariant cache hit.
[2026-05-26 18:01:05] [INFO ] State equation strengthened by 436 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) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/148 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/208 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 430/638 variables, 208/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 34/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/846 variables, 96/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 30/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/846 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 440/1286 variables, 8/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1286 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/1302 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1302 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 240/1542 variables, 8/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1542 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 888/2430 variables, 696/1095 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2430 variables, 372/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/2430 variables, 0/1467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1563 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 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) 77/80 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/148 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/208 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 430/638 variables, 208/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 34/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 208/846 variables, 96/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/846 variables, 30/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 440/1286 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1286 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/1302 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1302 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 6749ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1000 transition count 4291
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 991 transition count 4291
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 18 place count 991 transition count 3981
Deduced a syphon composed of 310 places in 6 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 638 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 591 transition count 3891
Applied a total of 818 rules in 428 ms. Remains 591 /1000 variables (removed 409) and now considering 3891/4300 (removed 409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 591/1000 places, 3891/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 360 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 206866 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 1
Probabilistic random walk after 206866 steps, saw 142898 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2026-05-26 18:01:16] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7543327633938299735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17593807694192035472.kers'
[2026-05-26 18:01:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7543327633938299735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17593807694192035472.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 18:01:16] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17593807694192035472.kers
Total runtime 5 ms.
[2026-05-26 18:01:16] [INFO ] State equation strengthened by 436 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) 46/105 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/127 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 349/476 variables, 127/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 34/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 208/684 variables, 96/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 37/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 264/948 variables, 8/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/948 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/964 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/964 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 88/1052 variables, 8/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1052 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 560/1612 variables, 368/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 365/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1058 constraints, problems are : Problem set: 0 solved, 1 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 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) 46/105 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/127 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 349/476 variables, 127/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 34/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 208/684 variables, 96/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 37/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/684 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 264/948 variables, 8/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/948 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 16/964 variables, 8/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/964 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/964 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 88/1052 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1052 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 560/1612 variables, 368/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1612 variables, 365/1061 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1612 variables, 6/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1612 variables, 0/1067 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1612 variables, 1/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1612 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1612 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 1068 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4563 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5362ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 255 ms.
Support contains 3 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 216 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 310 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2026-05-26 18:01:22] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:01:22] [INFO ] Invariant cache hit.
[2026-05-26 18:01:24] [INFO ] Implicit Places using invariants in 1639 ms returned []
[2026-05-26 18:01:24] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:01:24] [INFO ] Invariant cache hit.
[2026-05-26 18:01:24] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:01:32] [INFO ] Implicit Places using invariants and state equation in 8650 ms returned []
Implicit Place search using SMT with State Equation took 10295 ms to find 0 implicit places.
[2026-05-26 18:01:33] [INFO ] Redundant transitions in 540 ms returned []
Running 3881 sub problems to find dead transitions.
[2026-05-26 18:01:33] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:01:33] [INFO ] Invariant cache hit.
[2026-05-26 18:01:33] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 32271ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 32285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43446 ms. Remains : 591/591 places, 3891/3891 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3642 edges and 591 vertex of which 100 / 591 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 501 transition count 632
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 291 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 649 place count 172 transition count 432
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 738 place count 172 transition count 343
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 756 place count 163 transition count 343
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 765 place count 163 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 774 place count 163 transition count 325
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 864 place count 163 transition count 235
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 954 place count 73 transition count 235
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 964 place count 73 transition count 235
Applied a total of 964 rules in 50 ms. Remains 73 /591 variables (removed 518) and now considering 235/3891 (removed 3656) 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-14499294408143256342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15450390269697712068.kers'
[2026-05-26 18:02:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14499294408143256342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15450390269697712068.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 235 rows 64 cols 847 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-26 18:02:05] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15450390269697712068.kers
Total runtime 3 ms.
[2026-05-26 18:02:05] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 18:02:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-26 18:02:05] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 18:02:05] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-26 18:02:05] [INFO ] After 23ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 18:02:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
TRAPS : Iteration 1
[2026-05-26 18:02:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
TRAPS : Iteration 2
[2026-05-26 18:02:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
TRAPS : Iteration 3
[2026-05-26 18:02:06] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 18:02:06] [INFO ] After 528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 640 ms.
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 9 states, 15 edges and 2 AP (stutter sensitive) to 9 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 421 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 64100 ms.
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19970 reset in 942 ms.
Product exploration explored 100000 steps with 20051 reset in 986 ms.
Spot run failed in 85 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/ltsmin16039195593090912626
[2026-05-26 18:02:09] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16039195593090912626
Running compilation step : cd /tmp/ltsmin16039195593090912626;'/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/ltsmin16039195593090912626;'/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/ltsmin16039195593090912626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Applied a total of 0 rules in 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 4300/4300 (removed 0) transitions.
[2026-05-26 18:02:12] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2610303052622742627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8182877468299902711.kers'
[2026-05-26 18:02:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2610303052622742627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8182877468299902711.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1430 rows 1000 cols 3300 entries
Finished phase 1 with 959 SingleSign rule and 10 generalized
[2026-05-26 18:02:12] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8182877468299902711.kers
Total runtime 7 ms.
[2026-05-26 18:02:15] [INFO ] Implicit Places using invariants in 2605 ms returned []
[2026-05-26 18:02:15] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:02:15] [INFO ] Invariant cache hit.
[2026-05-26 18:02:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:02:31] [INFO ] Implicit Places using invariants and state equation in 15861 ms returned []
Implicit Place search using SMT with State Equation took 18469 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2026-05-26 18:02:31] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:02:31] [INFO ] Invariant cache hit.
[2026-05-26 18:02:31] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 32794ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 32813ms
Finished structural reductions in LTL mode , in 1 iterations and 51335 ms. Remains : 1000/1000 places, 4300/4300 transitions.
Built C files in :
/tmp/ltsmin3348327215192243260
[2026-05-26 18:03:04] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3348327215192243260
Running compilation step : cd /tmp/ltsmin3348327215192243260;'/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/ltsmin3348327215192243260;'/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/ltsmin3348327215192243260;'/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 18:03:07] [INFO ] Flatten gal took : 112 ms
[2026-05-26 18:03:07] [INFO ] Flatten gal took : 101 ms
[2026-05-26 18:03:07] [INFO ] Time to serialize gal into /tmp/LTL1360406402175782757.gal : 30 ms
[2026-05-26 18:03:07] [INFO ] Time to serialize properties into /tmp/LTL7358351160975253044.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/LTL1360406402175782757.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15012832702839904924.hoa' '-atoms' '/tmp/LTL7358351160975253044.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/LTL7358351160975253044.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15012832702839904924.hoa
Detected timeout of ITS tools.
[2026-05-26 18:03:22] [INFO ] Flatten gal took : 122 ms
[2026-05-26 18:03:22] [INFO ] Flatten gal took : 178 ms
[2026-05-26 18:03:22] [INFO ] Time to serialize gal into /tmp/LTL18057607255241497719.gal : 26 ms
[2026-05-26 18:03:22] [INFO ] Time to serialize properties into /tmp/LTL1840515005038700416.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/LTL18057607255241497719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1840515005038700416.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 : !((G(F((X(X(X("(((flag_8_waiting==0)||(p33_0_8==0))&&(((turn_2==0)||(flag_2_waiting==0))||(p25_4_10==0)))"))))&&("(((turn_8==0)||(flag...191
Formula 0 simplified : FG(!"(((turn_8==0)||(flag_8_active==0))||(p25_4_10==0))" | XXX!"(((flag_8_waiting==0)||(p33_0_8==0))&&(((turn_2==0)||(flag_2_waiting...179
Detected timeout of ITS tools.
[2026-05-26 18:03:38] [INFO ] Flatten gal took : 93 ms
[2026-05-26 18:03:38] [INFO ] Applying decomposition
[2026-05-26 18:03:38] [INFO ] Flatten gal took : 118 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/graph3831615838672619653.txt' '-o' '/tmp/graph3831615838672619653.bin' '-w' '/tmp/graph3831615838672619653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3831615838672619653.bin' '-l' '-1' '-v' '-w' '/tmp/graph3831615838672619653.weights' '-q' '0' '-e' '0.001'
[2026-05-26 18:03:38] [INFO ] Decomposing Gal with order
[2026-05-26 18:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:03:39] [INFO ] Removed a total of 8963 redundant transitions.
[2026-05-26 18:03:39] [INFO ] Flatten gal took : 342 ms
[2026-05-26 18:03:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 922 labels/synchronizations in 134 ms.
[2026-05-26 18:03:39] [INFO ] Time to serialize gal into /tmp/LTL11415051160697095740.gal : 32 ms
[2026-05-26 18:03:39] [INFO ] Time to serialize properties into /tmp/LTL11069102795262524793.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/LTL11415051160697095740.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11069102795262524793.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 : !((G(F((X(X(X("(((i0.u0.flag_8_waiting==0)||(i23.u255.p33_0_8==0))&&(((i19.u5.turn_2==0)||(i2.u4.flag_2_waiting==0))||(i1.u2.p25_4_10=...244
Formula 0 simplified : FG(!"(((i19.u5.turn_8==0)||(i0.u0.flag_8_active==0))||(i1.u2.p25_4_10==0))" | XXX!"(((i0.u0.flag_8_waiting==0)||(i23.u255.p33_0_8==0...232
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-06 finished in 312713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 994 transition count 4020
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 684 transition count 4020
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 644 place count 680 transition count 3980
Iterating global reduction 2 with 4 rules applied. Total rules applied 648 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 828 place count 590 transition count 3890
Applied a total of 828 rules in 351 ms. Remains 590 /1004 variables (removed 414) and now considering 3890/4340 (removed 450) transitions.
[2026-05-26 18:03:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9279494856997191438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3146627813422784198.kers'
[2026-05-26 18:03:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9279494856997191438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3146627813422784198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1020 rows 590 cols 2480 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 18:03:55] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3146627813422784198.kers
Total runtime 5 ms.
[2026-05-26 18:03:56] [INFO ] Implicit Places using invariants in 1838 ms returned []
[2026-05-26 18:03:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:03:56] [INFO ] Invariant cache hit.
[2026-05-26 18:03:57] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:04:04] [INFO ] Implicit Places using invariants and state equation in 7629 ms returned []
Implicit Place search using SMT with State Equation took 9469 ms to find 0 implicit places.
[2026-05-26 18:04:04] [INFO ] Redundant transitions in 347 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-26 18:04:04] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:04:04] [INFO ] Invariant cache hit.
[2026-05-26 18:04:04] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32797ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32808ms
Starting structural reductions in SI_LTL mode, iteration 1 : 590/1004 places, 3890/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42990 ms. Remains : 590/1004 places, 3890/4340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 573 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-07 finished in 43717 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&&(G(!p1)||(!p1&&F(!p2)))) U (G((!p0&&(G(!p1)||(!p1&&F(!p2)))))||(!p0&&(G(!p1)||(!p1&&F(!p2)))&&G(p3))))))'
Support contains 10 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 994 transition count 4021
Deduced a syphon composed of 309 places in 7 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 685 transition count 4021
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 642 place count 681 transition count 3981
Iterating global reduction 2 with 4 rules applied. Total rules applied 646 place count 681 transition count 3981
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3891
Applied a total of 826 rules in 411 ms. Remains 591 /1004 variables (removed 413) and now considering 3891/4340 (removed 449) transitions.
[2026-05-26 18:04:38] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16728640706825232995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3104758724211737223.kers'
[2026-05-26 18:04:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16728640706825232995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3104758724211737223.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 18:04:38] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3104758724211737223.kers
Total runtime 5 ms.
[2026-05-26 18:04:40] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2026-05-26 18:04:40] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:04:40] [INFO ] Invariant cache hit.
[2026-05-26 18:04:40] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:04:48] [INFO ] Implicit Places using invariants and state equation in 8002 ms returned []
Implicit Place search using SMT with State Equation took 9410 ms to find 0 implicit places.
[2026-05-26 18:04:48] [INFO ] Redundant transitions in 335 ms returned []
Running 3881 sub problems to find dead transitions.
[2026-05-26 18:04:48] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:04:48] [INFO ] Invariant cache hit.
[2026-05-26 18:04:48] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3881 unsolved
SMT process timed out in 32453ms, After SMT, problems are : Problem set: 0 solved, 3881 unsolved
Search for dead transitions found 0 dead transitions in 32471ms
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3891/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42660 ms. Remains : 591/1004 places, 3891/4340 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&&(G(!p1)||(!p1&&F(!p2)))) U (G((!p0&&(G(!p1)||(!p1&&F(!p2)))))||(!p0&&G(p3)&&(G(!p1)||(!p1&&F(!p2))))))))'
Stuttering acceptance computed with spot in 374 ms :[(OR p1 p0), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))), (AND p1 p2), (AND p1 p2 (NOT p3)), (OR (AND p0 p2) (AND p1 p2)), (OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 821 ms.
Product exploration explored 100000 steps with 0 reset in 696 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 34 factoid took 120 ms. Reduced automaton from 6 states, 26 edges and 4 AP (stutter insensitive) to 6 states, 29 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 875 ms. (45 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 94721 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :3 out of 21
Probabilistic random walk after 94721 steps, saw 69647 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :3
[2026-05-26 18:05:26] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:05:26] [INFO ] Invariant cache hit.
[2026-05-26 18:05:26] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
Problem apf12 is UNSAT
Problem apf13 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 1 (OVERLAPS) 188/198 variables, 8/8 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 2/10 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 48/246 variables, 3/13 constraints. Problems are: Problem set: 6 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 4/17 constraints. Problems are: Problem set: 6 solved, 12 unsolved
Problem apf16 is UNSAT
Problem apf18 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 2/19 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/19 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 55/301 variables, 5/24 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/24 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 601/902 variables, 301/325 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 128/453 constraints. Problems are: Problem set: 8 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/902 variables, 0/453 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 130/1032 variables, 60/513 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1032 variables, 40/553 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1032 variables, 0/553 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 165/1197 variables, 5/558 constraints. Problems are: Problem set: 8 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1197 variables, 0/558 constraints. Problems are: Problem set: 8 solved, 10 unsolved
SMT process timed out in 5046ms, After SMT, problems are : Problem set: 8 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 305 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 591/591 places, 3891/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 733 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 110990 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 10
Probabilistic random walk after 110990 steps, saw 80710 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2026-05-26 18:05:35] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:05:35] [INFO ] Invariant cache hit.
[2026-05-26 18:05:35] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 188/198 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 48/246 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/301 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 601/902 variables, 301/317 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 128/445 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/902 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 130/1032 variables, 60/505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1032 variables, 40/545 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1032 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 165/1197 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1197 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 10/1207 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1207 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 55/1262 variables, 5/560 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 350/1612 variables, 230/790 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 268/1058 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1058 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3699 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 188/198 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 48/246 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 55/301 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 601/902 variables, 301/327 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 128/455 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/902 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 130/1032 variables, 60/515 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1032 variables, 40/555 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1032 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 165/1197 variables, 5/560 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1197 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1197 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 10/1207 variables, 5/566 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1207 variables, 10/576 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1207 variables, 10/586 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1207 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 55/1262 variables, 5/591 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1262 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1262 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 350/1612 variables, 230/823 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1612 variables, 268/1091 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1612 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 0/1612 variables, 0/1091 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 1091 constraints, problems are : Problem set: 0 solved, 10 unsolved in 27455 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31177ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 4074 ms.
Support contains 10 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 197 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 591/591 places, 3891/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 492 ms. (81 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 124058 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 7
Probabilistic random walk after 124058 steps, saw 88859 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2026-05-26 18:06:14] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:06:14] [INFO ] Invariant cache hit.
[2026-05-26 18:06:14] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 188/198 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/246 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 55/301 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 601/902 variables, 301/317 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 128/445 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/902 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 130/1032 variables, 60/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1032 variables, 40/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1032 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 165/1197 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1197 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 10/1207 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1207 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 55/1262 variables, 5/560 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 350/1612 variables, 230/790 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 268/1058 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1058 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3099 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 188/198 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 48/246 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 55/301 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 601/902 variables, 301/326 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 128/454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 130/1032 variables, 60/514 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1032 variables, 40/554 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1032 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 165/1197 variables, 5/559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1197 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 10/1207 variables, 5/564 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1207 variables, 7/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1207 variables, 13/584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1207 variables, 2/586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1207 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 55/1262 variables, 5/591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1262 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (OVERLAPS) 350/1612 variables, 230/821 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1612 variables, 268/1089 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1612 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 0/1612 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 1089 constraints, problems are : Problem set: 0 solved, 7 unsolved in 21284 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24411ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2811 ms.
Support contains 10 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 192 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 184 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2026-05-26 18:06:42] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:06:42] [INFO ] Invariant cache hit.
[2026-05-26 18:06:43] [INFO ] Implicit Places using invariants in 1796 ms returned []
[2026-05-26 18:06:43] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:06:43] [INFO ] Invariant cache hit.
[2026-05-26 18:06:44] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:06:51] [INFO ] Implicit Places using invariants and state equation in 7897 ms returned []
Implicit Place search using SMT with State Equation took 9696 ms to find 0 implicit places.
[2026-05-26 18:06:52] [INFO ] Redundant transitions in 537 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10426 ms. Remains : 591/591 places, 3891/3891 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3585 edges and 591 vertex of which 100 / 591 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 501 transition count 635
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 233 place count 385 transition count 635
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 233 place count 385 transition count 614
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 285 place count 354 transition count 614
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 1 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 2 with 352 rules applied. Total rules applied 637 place count 178 transition count 438
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 721 place count 178 transition count 354
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 735 place count 171 transition count 354
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 742 place count 171 transition count 347
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 754 place count 171 transition count 335
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 845 place count 171 transition count 244
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 936 place count 80 transition count 244
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 946 place count 80 transition count 244
Applied a total of 946 rules in 54 ms. Remains 80 /591 variables (removed 511) and now considering 244/3891 (removed 3647) transitions.
Running SMT prover for 7 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1026745729959117503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17793655507031791033.kers'
[2026-05-26 18:06:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1026745729959117503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17793655507031791033.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 244 rows 73 cols 877 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-26 18:06:52] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17793655507031791033.kers
Total runtime 2 ms.
[2026-05-26 18:06:52] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2026-05-26 18:06:52] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2026-05-26 18:06:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2026-05-26 18:06:52] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2026-05-26 18:06:52] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-26 18:06:52] [INFO ] After 129ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2026-05-26 18:06:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2026-05-26 18:06:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
TRAPS : Iteration 1
[2026-05-26 18:06:53] [INFO ] After 715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2026-05-26 18:06:53] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 1310 ms.
Found 8 invariant AP formulas.
Knowledge based reduction with 42 factoid took 168 ms. Reduced automaton from 6 states, 29 edges and 4 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR p0 p1), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))]
Knowledge-based reduction took 90860 ms.
Stuttering acceptance computed with spot in 96 ms :[(OR p0 p1), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))]
Support contains 7 out of 591 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 308 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2026-05-26 18:06:54] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11890613376778786765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9516687657328972661.kers'
[2026-05-26 18:06:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11890613376778786765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9516687657328972661.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 18:06:54] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9516687657328972661.kers
Total runtime 6 ms.
[2026-05-26 18:06:55] [INFO ] Implicit Places using invariants in 1590 ms returned []
[2026-05-26 18:06:55] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:06:55] [INFO ] Invariant cache hit.
[2026-05-26 18:06:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:07:04] [INFO ] Implicit Places using invariants and state equation in 8126 ms returned []
Implicit Place search using SMT with State Equation took 9721 ms to find 0 implicit places.
[2026-05-26 18:07:04] [INFO ] Redundant transitions in 369 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10403 ms. Remains : 591/591 places, 3891/3891 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 17 factoid took 66 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 523 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 116611 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :3 out of 8
Probabilistic random walk after 116611 steps, saw 84163 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :3
[2026-05-26 18:07:07] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:07:07] [INFO ] Invariant cache hit.
[2026-05-26 18:07:07] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 189/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/246 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 55/301 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 601/902 variables, 301/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 128/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/902 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 130/1032 variables, 60/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1032 variables, 40/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1032 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 165/1197 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1197 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 10/1207 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1207 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 55/1262 variables, 5/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 350/1612 variables, 230/790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 268/1058 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1058 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2270 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 189/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/246 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 55/301 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 601/902 variables, 301/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 128/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 130/1032 variables, 60/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1032 variables, 40/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1032 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 165/1197 variables, 5/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1197 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 10/1207 variables, 5/563 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1207 variables, 5/568 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1612 variables, and 570 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 5/10 constraints, State Equation: 361/591 constraints, ReadFeed: 168/436 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7299ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 299 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 591/591 places, 3891/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 441 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 127160 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 5
Probabilistic random walk after 127160 steps, saw 90561 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2026-05-26 18:07:18] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:07:18] [INFO ] Invariant cache hit.
[2026-05-26 18:07:18] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 189/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/246 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 55/301 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 601/902 variables, 301/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 128/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/902 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 130/1032 variables, 60/505 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1032 variables, 40/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1032 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 165/1197 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1197 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 10/1207 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1207 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 55/1262 variables, 5/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 350/1612 variables, 230/790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 268/1058 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1058 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2480 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 189/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/246 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 55/301 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 601/902 variables, 301/325 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 128/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 130/1032 variables, 60/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1032 variables, 40/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1032 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 165/1197 variables, 5/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1197 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 10/1207 variables, 5/563 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1207 variables, 5/568 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1207 variables, 11/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1207 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 55/1262 variables, 5/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1262 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 350/1612 variables, 230/814 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1612 variables, 268/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1612 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/1612 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 1082 constraints, problems are : Problem set: 0 solved, 5 unsolved in 11152 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13649ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 1579 ms.
Support contains 7 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 176 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 591/591 places, 3891/3891 transitions.
RANDOM walk for 40000 steps (8 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 155408 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 155408 steps, saw 109423 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2026-05-26 18:07:37] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:07:37] [INFO ] Invariant cache hit.
[2026-05-26 18:07:37] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 189/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/246 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 55/301 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 601/902 variables, 301/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 128/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/902 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 130/1032 variables, 60/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1032 variables, 40/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1032 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 165/1197 variables, 5/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1197 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/1207 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1207 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 55/1262 variables, 5/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1262 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 350/1612 variables, 230/790 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1612 variables, 268/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1612 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 1058 constraints, problems are : Problem set: 0 solved, 2 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 189/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/246 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 55/301 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 601/902 variables, 301/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 128/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 130/1032 variables, 60/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1032 variables, 40/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1032 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 165/1197 variables, 5/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1197 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 10/1207 variables, 5/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1207 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1207 variables, 8/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1207 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 55/1262 variables, 5/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1262 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1262 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 350/1612 variables, 230/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1612 variables, 268/1078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1612 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1612 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 1078 constraints, problems are : Problem set: 0 solved, 2 unsolved in 9174 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 591/591 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10154ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 848 ms.
Support contains 7 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 185 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 174 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2026-05-26 18:07:48] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:07:48] [INFO ] Invariant cache hit.
[2026-05-26 18:07:50] [INFO ] Implicit Places using invariants in 1887 ms returned []
[2026-05-26 18:07:50] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:07:50] [INFO ] Invariant cache hit.
[2026-05-26 18:07:51] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:07:58] [INFO ] Implicit Places using invariants and state equation in 7694 ms returned []
Implicit Place search using SMT with State Equation took 9592 ms to find 0 implicit places.
[2026-05-26 18:07:58] [INFO ] Redundant transitions in 308 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10079 ms. Remains : 591/591 places, 3891/3891 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3613 edges and 591 vertex of which 100 / 591 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 501 transition count 634
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 235 place count 384 transition count 634
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 235 place count 384 transition count 613
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 287 place count 353 transition count 613
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 641 place count 176 transition count 436
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 86 rules applied. Total rules applied 727 place count 176 transition count 350
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 743 place count 168 transition count 350
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 751 place count 168 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 761 place count 168 transition count 332
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 851 place count 168 transition count 242
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 941 place count 78 transition count 242
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 950 place count 78 transition count 242
Applied a total of 950 rules in 32 ms. Remains 78 /591 variables (removed 513) and now considering 242/3891 (removed 3649) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4781384246171497693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8324895366042760395.kers'
[2026-05-26 18:07:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4781384246171497693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8324895366042760395.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 242 rows 70 cols 867 entries
Finished phase 1 with 57 SingleSign rule and 0 generalized
[2026-05-26 18:07:58] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8324895366042760395.kers
Total runtime 1 ms.
[2026-05-26 18:07:58] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2026-05-26 18:07:58] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 18:07:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-26 18:07:59] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-26 18:07:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 18:07:59] [INFO ] After 50ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 18:07:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 309 ms
[2026-05-26 18:07:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2026-05-26 18:07:59] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 18:07:59] [INFO ] After 787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1017 ms.
Knowledge based reduction with 17 factoid took 190 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR p0 p1), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))]
Knowledge-based reduction took 55392 ms.
Stuttering acceptance computed with spot in 110 ms :[(OR p0 p1), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))]
Stuttering acceptance computed with spot in 110 ms :[(OR p0 p1), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)))]
Product exploration explored 100000 steps with 0 reset in 753 ms.
Product exploration explored 100000 steps with 0 reset in 902 ms.
Built C files in :
/tmp/ltsmin2980807348974713808
[2026-05-26 18:08:01] [INFO ] Too many transitions (3891) to apply POR reductions. Disabling POR matrices.
[2026-05-26 18:08:01] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2980807348974713808
Running compilation step : cd /tmp/ltsmin2980807348974713808;'/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/ltsmin2980807348974713808;'/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/ltsmin2980807348974713808;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 591 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 198 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2026-05-26 18:08:05] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9303765495828175474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11615950249613402700.kers'
[2026-05-26 18:08:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9303765495828175474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11615950249613402700.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 591 cols 2482 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 18:08:05] [INFO ] Computed 31 invariants in 3 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11615950249613402700.kers
Total runtime 5 ms.
[2026-05-26 18:08:07] [INFO ] Implicit Places using invariants in 2076 ms returned []
[2026-05-26 18:08:07] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2026-05-26 18:08:07] [INFO ] Invariant cache hit.
[2026-05-26 18:08:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:08:14] [INFO ] Implicit Places using invariants and state equation in 7649 ms returned []
Implicit Place search using SMT with State Equation took 9727 ms to find 0 implicit places.
[2026-05-26 18:08:15] [INFO ] Redundant transitions in 305 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10238 ms. Remains : 591/591 places, 3891/3891 transitions.
Built C files in :
/tmp/ltsmin12432892457211292536
[2026-05-26 18:08:15] [INFO ] Too many transitions (3891) to apply POR reductions. Disabling POR matrices.
[2026-05-26 18:08:15] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12432892457211292536
Running compilation step : cd /tmp/ltsmin12432892457211292536;'/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/ltsmin12432892457211292536;'/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/ltsmin12432892457211292536;'/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 18:08:18] [INFO ] Flatten gal took : 88 ms
[2026-05-26 18:08:18] [INFO ] Flatten gal took : 76 ms
[2026-05-26 18:08:18] [INFO ] Time to serialize gal into /tmp/LTL18215457060670944436.gal : 21 ms
[2026-05-26 18:08:18] [INFO ] Time to serialize properties into /tmp/LTL5685870336825364932.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/LTL18215457060670944436.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7804075886265535197.hoa' '-atoms' '/tmp/LTL5685870336825364932.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/LTL5685870336825364932.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7804075886265535197.hoa
Detected timeout of ITS tools.
[2026-05-26 18:08:33] [INFO ] Flatten gal took : 73 ms
[2026-05-26 18:08:33] [INFO ] Flatten gal took : 114 ms
[2026-05-26 18:08:33] [INFO ] Time to serialize gal into /tmp/LTL17922867053961443707.gal : 23 ms
[2026-05-26 18:08:33] [INFO ] Time to serialize properties into /tmp/LTL16155529245320269458.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17922867053961443707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16155529245320269458.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...277
Read 1 LTL properties
Checking formula 0 : !((F(((!("(((turn_5==1)&&(flag_5_waiting==1))&&(p25_4_9==1))"))&&((G(!("(((turn_0==1)&&(flag_0_active==1))&&(p25_6_2==1))")))||((!("((...789
Formula 0 simplified : G(("(((turn_5==1)&&(flag_5_waiting==1))&&(p25_4_9==1))" | (F"(((turn_0==1)&&(flag_0_active==1))&&(p25_6_2==1))" & ("(((turn_0==1)&&(...492
Detected timeout of ITS tools.
[2026-05-26 18:08:48] [INFO ] Flatten gal took : 73 ms
[2026-05-26 18:08:48] [INFO ] Applying decomposition
[2026-05-26 18:08:48] [INFO ] Flatten gal took : 97 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/graph9507660531621741810.txt' '-o' '/tmp/graph9507660531621741810.bin' '-w' '/tmp/graph9507660531621741810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9507660531621741810.bin' '-l' '-1' '-v' '-w' '/tmp/graph9507660531621741810.weights' '-q' '0' '-e' '0.001'
[2026-05-26 18:08:49] [INFO ] Decomposing Gal with order
[2026-05-26 18:08:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:08:49] [INFO ] Removed a total of 8767 redundant transitions.
[2026-05-26 18:08:49] [INFO ] Flatten gal took : 407 ms
[2026-05-26 18:08:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 710 labels/synchronizations in 106 ms.
[2026-05-26 18:08:49] [INFO ] Time to serialize gal into /tmp/LTL3851557621301623311.gal : 23 ms
[2026-05-26 18:08:49] [INFO ] Time to serialize properties into /tmp/LTL16759106239497447630.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/LTL3851557621301623311.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16759106239497447630.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 : !((F(((!("(((i6.u9.turn_5==1)&&(i11.u22.flag_5_waiting==1))&&(i16.u5.p25_4_9==1))"))&&((G(!("(((i19.u81.turn_0==1)&&(i4.u7.flag_0_acti...1039
Formula 0 simplified : G(("(((i6.u9.turn_5==1)&&(i11.u22.flag_5_waiting==1))&&(i16.u5.p25_4_9==1))" | (F"(((i19.u81.turn_0==1)&&(i4.u7.flag_0_active==1))&&...661
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-08 finished in 266507 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)||X(X(X(F((G(F(!p1))||(F(!p1)&&X(!p2))))))))))'
Support contains 9 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 69 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2026-05-26 18:09:05] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6848493725430176893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3170341186006121043.kers'
[2026-05-26 18:09:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6848493725430176893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3170341186006121043.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1430 rows 1000 cols 3300 entries
Finished phase 1 with 959 SingleSign rule and 10 generalized
[2026-05-26 18:09:05] [INFO ] Computed 31 invariants in 8 ms
Computed 31 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-3170341186006121043.kers
Total runtime 10 ms.
[2026-05-26 18:09:07] [INFO ] Implicit Places using invariants in 2286 ms returned []
[2026-05-26 18:09:07] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:09:07] [INFO ] Invariant cache hit.
[2026-05-26 18:09:08] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:09:23] [INFO ] Implicit Places using invariants and state equation in 16451 ms returned []
Implicit Place search using SMT with State Equation took 18741 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2026-05-26 18:09:23] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:09:23] [INFO ] Invariant cache hit.
[2026-05-26 18:09:23] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 32853ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 32862ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51678 ms. Remains : 1000/1004 places, 4300/4340 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)||X(X(X(F((G(F(p1))||(F(p1)&&X(p2))))))))))'
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-09
Product exploration explored 100000 steps with 20000 reset in 1135 ms.
Product exploration explored 100000 steps with 20000 reset in 913 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 1 factoid took 54 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 629 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 120417 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 6
Probabilistic random walk after 120417 steps, saw 97313 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2026-05-26 18:10:02] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:10:02] [INFO ] Invariant cache hit.
[2026-05-26 18:10:02] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 208/217 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 90/307 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 555/862 variables, 307/318 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/862 variables, 58/376 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/862 variables, 0/376 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 182/1044 variables, 84/460 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1044 variables, 35/495 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1044 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 385/1429 variables, 7/502 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1429 variables, 0/502 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 14/1443 variables, 7/509 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1443 variables, 0/509 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 210/1653 variables, 7/516 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1653 variables, 0/516 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 777/2430 variables, 609/1125 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2430 variables, 343/1468 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2430 variables, 0/1468 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/2430 variables, 0/1468 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2430/2430 variables, and 1468 constraints, problems are : Problem set: 2 solved, 4 unsolved in 3519 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1000/1000 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 208/217 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/217 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 90/307 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 555/862 variables, 307/320 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/862 variables, 58/378 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/862 variables, 2/380 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/862 variables, 0/380 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 182/1044 variables, 84/464 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1044 variables, 35/499 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1044 variables, 0/499 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 385/1429 variables, 7/506 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1429 variables, 0/506 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 14/1443 variables, 7/513 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1443 variables, 4/517 constraints. Problems are: Problem set: 2 solved, 4 unsolved
SMT process timed out in 9204ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1212 ms.
Support contains 9 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 4300/4300 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1000 transition count 4290
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 990 transition count 4290
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 990 transition count 3980
Deduced a syphon composed of 310 places in 3 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 590 transition count 3890
Applied a total of 820 rules in 276 ms. Remains 590 /1000 variables (removed 410) and now considering 3890/4300 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 590/1000 places, 3890/4300 transitions.
RANDOM walk for 40000 steps (8 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 140415 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 4
Probabilistic random walk after 140415 steps, saw 99992 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
[2026-05-26 18:10:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10870987473711836747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1055418907824107683.kers'
[2026-05-26 18:10:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10870987473711836747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1055418907824107683.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1020 rows 590 cols 2480 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 18:10:16] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1055418907824107683.kers
Total runtime 5 ms.
[2026-05-26 18:10:16] [INFO ] State equation strengthened by 436 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 33/184 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 432/616 variables, 184/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/616 variables, 58/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 182/798 variables, 84/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 42/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 231/1029 variables, 7/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1029 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 14/1043 variables, 7/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1043 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 77/1120 variables, 7/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1120 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 490/1610 variables, 322/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1610 variables, 336/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1610 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1057 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/151 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 33/184 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 432/616 variables, 184/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/616 variables, 58/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/616 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 182/798 variables, 84/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 42/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 231/1029 variables, 7/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1029 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/1043 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1043 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1043 variables, 12/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1043 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 77/1120 variables, 7/420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1120 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1120 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1120 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1120 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 490/1610 variables, 322/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1610 variables, 336/1081 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1610 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1610 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1081 constraints, problems are : Problem set: 0 solved, 4 unsolved in 13387 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15253ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2109 ms.
Support contains 9 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 197 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 176 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-26 18:10:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:10:34] [INFO ] Invariant cache hit.
[2026-05-26 18:10:35] [INFO ] Implicit Places using invariants in 1684 ms returned []
[2026-05-26 18:10:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:10:35] [INFO ] Invariant cache hit.
[2026-05-26 18:10:36] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:10:43] [INFO ] Implicit Places using invariants and state equation in 7915 ms returned []
Implicit Place search using SMT with State Equation took 9602 ms to find 0 implicit places.
[2026-05-26 18:10:44] [INFO ] Redundant transitions in 308 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-26 18:10:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:10:44] [INFO ] Invariant cache hit.
[2026-05-26 18:10:44] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32127ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32139ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42246 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3586 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 500 transition count 634
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 233 place count 384 transition count 634
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 233 place count 384 transition count 613
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 285 place count 353 transition count 613
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 639 place count 176 transition count 436
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 723 place count 176 transition count 352
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 739 place count 168 transition count 352
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 747 place count 168 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 760 place count 168 transition count 331
Free-agglomeration rule applied 93 times.
Iterating global reduction 4 with 93 rules applied. Total rules applied 853 place count 168 transition count 238
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 4 with 93 rules applied. Total rules applied 946 place count 75 transition count 238
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 957 place count 75 transition count 238
Applied a total of 957 rules in 50 ms. Remains 75 /590 variables (removed 515) and now considering 238/3890 (removed 3652) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2317883100911365147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13940402816913917699.kers'
[2026-05-26 18:11:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2317883100911365147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13940402816913917699.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 238 rows 67 cols 861 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-26 18:11:16] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13940402816913917699.kers
Total runtime 3 ms.
[2026-05-26 18:11:16] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-26 18:11:16] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-26 18:11:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2026-05-26 18:11:16] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2026-05-26 18:11:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 18:11:16] [INFO ] After 81ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-26 18:11:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 297 ms
[2026-05-26 18:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
TRAPS : Iteration 1
[2026-05-26 18:11:17] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-26 18:11:17] [INFO ] After 973ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1238 ms.
Found 2 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 17 ms. Proved property starting from automaton with 6 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 78369 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-09 finished in 132493 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 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 994 transition count 4020
Deduced a syphon composed of 310 places in 6 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 684 transition count 4020
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 643 place count 681 transition count 3990
Iterating global reduction 2 with 3 rules applied. Total rules applied 646 place count 681 transition count 3990
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 826 place count 591 transition count 3900
Applied a total of 826 rules in 509 ms. Remains 591 /1004 variables (removed 413) and now considering 3900/4340 (removed 440) transitions.
[2026-05-26 18:11:17] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10219557450174371680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4020350759397093008.kers'
[2026-05-26 18:11:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10219557450174371680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4020350759397093008.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1030 rows 591 cols 2500 entries
Finished phase 1 with 550 SingleSign rule and 10 generalized
[2026-05-26 18:11:18] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4020350759397093008.kers
Total runtime 8 ms.
[2026-05-26 18:11:20] [INFO ] Implicit Places using invariants in 2094 ms returned []
[2026-05-26 18:11:20] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2026-05-26 18:11:20] [INFO ] Invariant cache hit.
[2026-05-26 18:11:20] [INFO ] State equation strengthened by 445 read => feed constraints.
[2026-05-26 18:11:27] [INFO ] Implicit Places using invariants and state equation in 7235 ms returned []
Implicit Place search using SMT with State Equation took 9334 ms to find 0 implicit places.
[2026-05-26 18:11:27] [INFO ] Redundant transitions in 310 ms returned []
Running 3890 sub problems to find dead transitions.
[2026-05-26 18:11:27] [INFO ] Flow matrix only has 1030 transitions (discarded 2870 similar events)
[2026-05-26 18:11:27] [INFO ] Invariant cache hit.
[2026-05-26 18:11:27] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3890 unsolved
SMT process timed out in 32872ms, After SMT, problems are : Problem set: 0 solved, 3890 unsolved
Search for dead transitions found 0 dead transitions in 32882ms
Starting structural reductions in SI_LTL mode, iteration 1 : 591/1004 places, 3900/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43044 ms. Remains : 591/1004 places, 3900/4340 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 52 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 402 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-10 finished in 43548 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)||G(p1))&&(X(!p2) U ((X(!p2)&&G(p3))||X(G(!p2))))))'
Support contains 10 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1001 transition count 4310
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1001 transition count 4310
Applied a total of 6 rules in 69 ms. Remains 1001 /1004 variables (removed 3) and now considering 4310/4340 (removed 30) transitions.
[2026-05-26 18:12:01] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6884907221933104103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17645324938003691551.kers'
[2026-05-26 18:12:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6884907221933104103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17645324938003691551.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1440 rows 1001 cols 3320 entries
Finished phase 1 with 960 SingleSign rule and 10 generalized
[2026-05-26 18:12:01] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17645324938003691551.kers
Total runtime 7 ms.
[2026-05-26 18:12:03] [INFO ] Implicit Places using invariants in 2103 ms returned []
[2026-05-26 18:12:03] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:12:03] [INFO ] Invariant cache hit.
[2026-05-26 18:12:04] [INFO ] State equation strengthened by 445 read => feed constraints.
[2026-05-26 18:12:20] [INFO ] Implicit Places using invariants and state equation in 17232 ms returned []
Implicit Place search using SMT with State Equation took 19340 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2026-05-26 18:12:20] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:12:20] [INFO ] Invariant cache hit.
[2026-05-26 18:12:20] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 32506ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 32514ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1004 places, 4310/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51929 ms. Remains : 1001/1004 places, 4310/4340 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) U ((X(!p0)&&G(p1))||X(G(!p0))))&&(F(p2)||G(p3))))'
Stuttering acceptance computed with spot in 440 ms :[(OR p0 (AND (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p2) (NOT p3)), p0, p0, (AND p0 (NOT p1)), true, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 5 reset in 564 ms.
Stack based approach found an accepted trace after 68 steps with 2 reset with depth 65 and stack size 65 in 2 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-12 finished in 53017 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) U (p1 U p2)))'
Support contains 9 out of 1004 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1004 transition count 4330
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 994 transition count 4330
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 994 transition count 4020
Deduced a syphon composed of 310 places in 4 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 684 transition count 4020
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 644 place count 680 transition count 3980
Iterating global reduction 2 with 4 rules applied. Total rules applied 648 place count 680 transition count 3980
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 828 place count 590 transition count 3890
Applied a total of 828 rules in 354 ms. Remains 590 /1004 variables (removed 414) and now considering 3890/4340 (removed 450) transitions.
[2026-05-26 18:12:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4027478341380110151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3120744675973292189.kers'
[2026-05-26 18:12:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4027478341380110151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3120744675973292189.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1020 rows 590 cols 2480 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 18:12:54] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3120744675973292189.kers
Total runtime 7 ms.
[2026-05-26 18:12:56] [INFO ] Implicit Places using invariants in 1834 ms returned []
[2026-05-26 18:12:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:12:56] [INFO ] Invariant cache hit.
[2026-05-26 18:12:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:13:03] [INFO ] Implicit Places using invariants and state equation in 6992 ms returned []
Implicit Place search using SMT with State Equation took 8829 ms to find 0 implicit places.
[2026-05-26 18:13:03] [INFO ] Redundant transitions in 307 ms returned []
Running 3880 sub problems to find dead transitions.
[2026-05-26 18:13:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:13:03] [INFO ] Invariant cache hit.
[2026-05-26 18:13:03] [INFO ] State equation strengthened by 436 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3880 unsolved
SMT process timed out in 32277ms, After SMT, problems are : Problem set: 0 solved, 3880 unsolved
Search for dead transitions found 0 dead transitions in 32285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 590/1004 places, 3890/4340 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41793 ms. Remains : 590/1004 places, 3890/4340 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) U (p1 U p2)))'
Stuttering acceptance computed with spot in 179 ms :[(NOT p2), true, p0, (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 563 ms.
Product exploration explored 100000 steps with 0 reset in 475 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 19 factoid took 84 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 425 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 113366 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 9
Probabilistic random walk after 113366 steps, saw 82298 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2026-05-26 18:13:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:13:40] [INFO ] Invariant cache hit.
[2026-05-26 18:13:40] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 188/197 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 48/245 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 55/300 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 600/900 variables, 300/319 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/900 variables, 128/447 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 0/447 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 130/1030 variables, 60/507 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1030 variables, 40/547 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1030 variables, 0/547 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 165/1195 variables, 5/552 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1195 variables, 0/552 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 10/1205 variables, 5/557 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1205 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 55/1260 variables, 5/562 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1260 variables, 0/562 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 350/1610 variables, 230/792 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1610 variables, 268/1060 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 0/1610 variables, 0/1060 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1060 constraints, problems are : Problem set: 1 solved, 8 unsolved in 4154 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 188/197 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 48/245 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 55/300 variables, 5/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 600/900 variables, 300/321 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 128/449 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/900 variables, 1/450 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/900 variables, 0/450 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 130/1030 variables, 60/510 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 40/550 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1030 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 165/1195 variables, 5/555 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1195 variables, 0/555 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 10/1205 variables, 5/560 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1205 variables, 8/568 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SMT process timed out in 9380ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1365 ms.
Support contains 9 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 202 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 590/590 places, 3890/3890 transitions.
RANDOM walk for 40000 steps (8 resets) in 600 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 112497 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 8
Probabilistic random walk after 112497 steps, saw 81717 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2026-05-26 18:13:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:13:55] [INFO ] Invariant cache hit.
[2026-05-26 18:13:55] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 188/197 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 48/245 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 55/300 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 600/900 variables, 300/320 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 128/448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 130/1030 variables, 60/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1030 variables, 40/548 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1030 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 165/1195 variables, 5/553 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1195 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 10/1205 variables, 5/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1205 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 55/1260 variables, 5/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1260 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 350/1610 variables, 230/793 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1610 variables, 268/1061 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (OVERLAPS) 0/1610 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1610/1610 variables, and 1061 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4618 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 188/197 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 48/245 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 55/300 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 600/900 variables, 300/322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 128/450 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/900 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 130/1030 variables, 60/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1030 variables, 40/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1030 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 165/1195 variables, 5/556 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1195 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 10/1205 variables, 5/561 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1205 variables, 8/569 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1205 variables, 10/579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1205 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 55/1260 variables, 5/584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1260 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1260 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1260 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 350/1610 variables, 230/816 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1610 variables, 268/1084 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1610 variables, 1/1085 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1610 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 0/1610 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1610/1610 variables, and 1085 constraints, problems are : Problem set: 0 solved, 8 unsolved in 17300 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 590/590 constraints, ReadFeed: 436/436 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21942ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 5350 ms.
Support contains 9 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 185 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 184 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2026-05-26 18:14:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:14:22] [INFO ] Invariant cache hit.
[2026-05-26 18:14:24] [INFO ] Implicit Places using invariants in 1692 ms returned []
[2026-05-26 18:14:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2026-05-26 18:14:24] [INFO ] Invariant cache hit.
[2026-05-26 18:14:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:14:30] [INFO ] Implicit Places using invariants and state equation in 6353 ms returned []
Implicit Place search using SMT with State Equation took 8049 ms to find 0 implicit places.
[2026-05-26 18:14:31] [INFO ] Redundant transitions in 537 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8778 ms. Remains : 590/590 places, 3890/3890 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3586 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 117 place count 500 transition count 634
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 233 place count 384 transition count 634
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 233 place count 384 transition count 613
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 285 place count 353 transition count 613
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 641 place count 175 transition count 435
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 2 with 85 rules applied. Total rules applied 726 place count 175 transition count 350
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 738 place count 169 transition count 350
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 744 place count 169 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 754 place count 169 transition count 334
Free-agglomeration rule applied 93 times.
Iterating global reduction 4 with 93 rules applied. Total rules applied 847 place count 169 transition count 241
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 4 with 93 rules applied. Total rules applied 940 place count 76 transition count 241
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 951 place count 76 transition count 241
Applied a total of 951 rules in 51 ms. Remains 76 /590 variables (removed 514) and now considering 241/3890 (removed 3649) transitions.
Running SMT prover for 8 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-711009208895353093.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10211665268032059652.kers'
[2026-05-26 18:14:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-711009208895353093.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10211665268032059652.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 241 rows 69 cols 877 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-26 18:14:31] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10211665268032059652.kers
Total runtime 2 ms.
[2026-05-26 18:14:31] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2026-05-26 18:14:31] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2026-05-26 18:14:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2026-05-26 18:14:32] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2026-05-26 18:14:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-26 18:14:32] [INFO ] After 141ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2026-05-26 18:14:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2026-05-26 18:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
TRAPS : Iteration 1
[2026-05-26 18:14:32] [INFO ] After 752ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2026-05-26 18:14:32] [INFO ] After 1277ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 1528 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 20 factoid took 78 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), true, p0]
[2026-05-26 18:14:33] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15789882327072969698.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12874349832506925615.kers'
[2026-05-26 18:14:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15789882327072969698.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12874349832506925615.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1020 rows 590 cols 2480 entries
Finished phase 1 with 549 SingleSign rule and 10 generalized
[2026-05-26 18:14:33] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12874349832506925615.kers
Total runtime 8 ms.
[2026-05-26 18:14:36] [INFO ] [Real]Absence check using 21 positive place invariants in 53 ms returned sat
[2026-05-26 18:14:36] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 162 ms returned unsat
Proved EG (NOT p2) asserting that LTL formula F !(NOT p2) is false.
Negative knowledge disproves property using: (F p2)
Knowledge-based reduction took 59555 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-13 finished in 102638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||(p1 U (p2||G(p1))))))'
Support contains 7 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1001 transition count 4310
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1001 transition count 4310
Applied a total of 6 rules in 117 ms. Remains 1001 /1004 variables (removed 3) and now considering 4310/4340 (removed 30) transitions.
[2026-05-26 18:14:36] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11613462096294980095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15362154820640941604.kers'
[2026-05-26 18:14:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11613462096294980095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15362154820640941604.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1440 rows 1001 cols 3320 entries
Finished phase 1 with 960 SingleSign rule and 10 generalized
[2026-05-26 18:14:36] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15362154820640941604.kers
Total runtime 9 ms.
[2026-05-26 18:14:39] [INFO ] Implicit Places using invariants in 2357 ms returned []
[2026-05-26 18:14:39] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:14:39] [INFO ] Invariant cache hit.
[2026-05-26 18:14:40] [INFO ] State equation strengthened by 445 read => feed constraints.
[2026-05-26 18:14:56] [INFO ] Implicit Places using invariants and state equation in 17642 ms returned []
Implicit Place search using SMT with State Equation took 20017 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2026-05-26 18:14:56] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:14:56] [INFO ] Invariant cache hit.
[2026-05-26 18:14:56] [INFO ] State equation strengthened by 445 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 32490ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 32508ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1004 places, 4310/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52647 ms. Remains : 1001/1004 places, 4310/4340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||(p1 U (p2||G(p1))))))'
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-14
Product exploration explored 100000 steps with 20093 reset in 1409 ms.
Product exploration explored 100000 steps with 19994 reset in 1022 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 9 factoid took 72 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 15 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 328 ms. (121 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
[2026-05-26 18:15:32] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:15:32] [INFO ] Invariant cache hit.
[2026-05-26 18:15:32] [INFO ] State equation strengthened by 445 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 77/84 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 134/218 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 121/339 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 68/407 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 690/1097 variables, 407/420 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1097 variables, 99/519 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1097 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 156/1253 variables, 72/591 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1253 variables, 36/627 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1253 variables, 0/627 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 330/1583 variables, 6/633 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1583 variables, 0/633 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 12/1595 variables, 6/639 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1595 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 180/1775 variables, 6/645 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1775 variables, 0/645 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 666/2441 variables, 522/1167 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2441 variables, 310/1477 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2441 variables, 0/1477 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/2441 variables, 0/1477 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2441/2441 variables, and 1477 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3502 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1001/1001 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 77/84 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 134/218 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 121/339 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 68/407 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 690/1097 variables, 407/422 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1097 variables, 99/521 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1097 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 156/1253 variables, 72/593 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1253 variables, 36/629 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1253 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 330/1583 variables, 6/635 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1583 variables, 0/635 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 12/1595 variables, 6/641 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1595 variables, 4/645 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SMT process timed out in 8546ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 567 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 991 transition count 3991
Deduced a syphon composed of 309 places in 3 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 682 transition count 3991
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 592 transition count 3901
Applied a total of 818 rules in 277 ms. Remains 592 /1001 variables (removed 409) and now considering 3901/4310 (removed 409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 592/1001 places, 3901/4310 transitions.
RANDOM walk for 40000 steps (8 resets) in 381 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 123035 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 123035 steps, saw 89039 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2026-05-26 18:15:45] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1618021557269336484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10299769315420624508.kers'
[2026-05-26 18:15:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1618021557269336484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10299769315420624508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1031 rows 592 cols 2502 entries
Finished phase 1 with 551 SingleSign rule and 10 generalized
[2026-05-26 18:15:45] [INFO ] Computed 31 invariants in 6 ms
Computed 31 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10299769315420624508.kers
Total runtime 8 ms.
[2026-05-26 18:15:45] [INFO ] State equation strengthened by 445 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/153 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 45/198 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 46/244 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 527/771 variables, 244/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/771 variables, 99/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/771 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 156/927 variables, 72/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 42/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 198/1125 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1125 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 12/1137 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1137 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 66/1203 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1203 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 420/1623 variables, 276/764 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1623 variables, 304/1068 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1623 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1623 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1623/1623 variables, and 1068 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 592/592 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 90/153 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 45/198 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 46/244 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 527/771 variables, 244/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/771 variables, 99/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/771 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/771 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 156/927 variables, 72/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/927 variables, 42/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/927 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 198/1125 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1125 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 12/1137 variables, 6/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1137 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1137 variables, 7/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 66/1203 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1203 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 420/1623 variables, 276/778 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1623 variables, 304/1082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1623 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/1623 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1623/1623 variables, and 1082 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8583 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 592/592 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10428ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1758 ms.
Support contains 7 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3901/3901 transitions.
Applied a total of 0 rules in 179 ms. Remains 592 /592 variables (removed 0) and now considering 3901/3901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 592/592 places, 3901/3901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3901/3901 transitions.
Applied a total of 0 rules in 265 ms. Remains 592 /592 variables (removed 0) and now considering 3901/3901 (removed 0) transitions.
[2026-05-26 18:15:57] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2026-05-26 18:15:57] [INFO ] Invariant cache hit.
[2026-05-26 18:15:59] [INFO ] Implicit Places using invariants in 2062 ms returned []
[2026-05-26 18:15:59] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2026-05-26 18:15:59] [INFO ] Invariant cache hit.
[2026-05-26 18:16:00] [INFO ] State equation strengthened by 445 read => feed constraints.
[2026-05-26 18:16:07] [INFO ] Implicit Places using invariants and state equation in 7755 ms returned []
Implicit Place search using SMT with State Equation took 9822 ms to find 0 implicit places.
[2026-05-26 18:16:08] [INFO ] Redundant transitions in 538 ms returned []
Running 3891 sub problems to find dead transitions.
[2026-05-26 18:16:08] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2026-05-26 18:16:08] [INFO ] Invariant cache hit.
[2026-05-26 18:16:08] [INFO ] State equation strengthened by 445 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3891 unsolved
SMT process timed out in 32838ms, After SMT, problems are : Problem set: 0 solved, 3891 unsolved
Search for dead transitions found 0 dead transitions in 32848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43491 ms. Remains : 592/592 places, 3901/3901 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3637 edges and 592 vertex of which 100 / 592 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 348 transitions
Ensure Unique test removed 2799 transitions
Reduce isomorphic transitions removed 3147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 502 transition count 636
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 384 transition count 636
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 237 place count 384 transition count 616
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 286 place count 355 transition count 616
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 642 place count 177 transition count 438
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 730 place count 177 transition count 350
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 746 place count 169 transition count 350
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 754 place count 169 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 764 place count 169 transition count 332
Free-agglomeration rule applied 87 times.
Iterating global reduction 4 with 87 rules applied. Total rules applied 851 place count 169 transition count 245
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 938 place count 82 transition count 245
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 947 place count 82 transition count 245
Applied a total of 947 rules in 47 ms. Remains 82 /592 variables (removed 510) and now considering 245/3901 (removed 3656) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16087655957345445602.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-695736662866163904.kers'
[2026-05-26 18:16:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16087655957345445602.kers, --Pflows, --basisKERS=/tmp/petrispot-output-695736662866163904.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 245 rows 74 cols 877 entries
Finished phase 1 with 57 SingleSign rule and 3 generalized
[2026-05-26 18:16:41] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-695736662866163904.kers
Total runtime 2 ms.
[2026-05-26 18:16:41] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-26 18:16:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2026-05-26 18:16:41] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:16:41] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2026-05-26 18:16:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 18:16:41] [INFO ] After 77ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-26 18:16:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2026-05-26 18:16:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
TRAPS : Iteration 1
[2026-05-26 18:16:41] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-26 18:16:41] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 746 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 121 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Knowledge-based reduction took 70033 ms.
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Applied a total of 0 rules in 59 ms. Remains 1001 /1001 variables (removed 0) and now considering 4310/4310 (removed 0) transitions.
[2026-05-26 18:16:42] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4808393417908854952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-493406857841136342.kers'
[2026-05-26 18:16:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4808393417908854952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-493406857841136342.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1440 rows 1001 cols 3320 entries
Finished phase 1 with 960 SingleSign rule and 10 generalized
[2026-05-26 18:16:42] [INFO ] Computed 31 invariants in 10 ms
Computed 31 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-493406857841136342.kers
Total runtime 11 ms.
[2026-05-26 18:16:45] [INFO ] Implicit Places using invariants in 2483 ms returned []
[2026-05-26 18:16:45] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:16:45] [INFO ] Invariant cache hit.
[2026-05-26 18:16:46] [INFO ] State equation strengthened by 445 read => feed constraints.
[2026-05-26 18:17:03] [INFO ] Implicit Places using invariants and state equation in 17902 ms returned []
Implicit Place search using SMT with State Equation took 20388 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2026-05-26 18:17:03] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:17:03] [INFO ] Invariant cache hit.
[2026-05-26 18:17:03] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 32400ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 32408ms
Finished structural reductions in LTL mode , in 1 iterations and 52860 ms. Remains : 1001/1001 places, 4310/4310 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 9 factoid took 114 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 359 ms. (111 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
[2026-05-26 18:17:35] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:17:35] [INFO ] Invariant cache hit.
[2026-05-26 18:17:35] [INFO ] State equation strengthened by 445 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 77/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 134/218 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 121/339 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 68/407 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 690/1097 variables, 407/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1097 variables, 99/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1097 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 156/1253 variables, 72/591 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1253 variables, 36/627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1253 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 330/1583 variables, 6/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1583 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 12/1595 variables, 6/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1595 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 180/1775 variables, 6/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1775 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 666/2441 variables, 522/1167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2441 variables, 310/1477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2441 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/2441 variables, 0/1477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2441/2441 variables, and 1477 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2895 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1001/1001 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 77/84 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 134/218 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 121/339 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 68/407 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 690/1097 variables, 407/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1097 variables, 99/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1097 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 156/1253 variables, 72/595 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1253 variables, 36/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1253 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 330/1583 variables, 6/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1583 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1595 variables, 6/643 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1595 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 8618ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 581 ms.
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1001 transition count 4300
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 991 transition count 4300
Performed 309 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 309 Pre rules applied. Total rules applied 20 place count 991 transition count 3991
Deduced a syphon composed of 309 places in 5 ms
Reduce places removed 309 places and 0 transitions.
Iterating global reduction 2 with 618 rules applied. Total rules applied 638 place count 682 transition count 3991
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 818 place count 592 transition count 3901
Applied a total of 818 rules in 302 ms. Remains 592 /1001 variables (removed 409) and now considering 3901/4310 (removed 409) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 592/1001 places, 3901/4310 transitions.
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 149754 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 3
Probabilistic random walk after 149754 steps, saw 107015 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2026-05-26 18:17:48] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10972489462987253369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17427988048261949664.kers'
[2026-05-26 18:17:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10972489462987253369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17427988048261949664.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1031 rows 592 cols 2502 entries
Finished phase 1 with 551 SingleSign rule and 10 generalized
[2026-05-26 18:17:48] [INFO ] Computed 31 invariants in 4 ms
Computed 31 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17427988048261949664.kers
Total runtime 6 ms.
[2026-05-26 18:17:48] [INFO ] State equation strengthened by 445 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 90/153 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/198 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 46/244 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 527/771 variables, 244/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/771 variables, 99/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/771 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 156/927 variables, 72/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 42/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 198/1125 variables, 6/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1125 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 12/1137 variables, 6/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1137 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 66/1203 variables, 6/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1203 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 420/1623 variables, 276/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1623 variables, 304/1068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1623 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1623 variables, 0/1068 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1623/1623 variables, and 1068 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1183 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 592/592 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/63 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 90/153 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 45/198 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 46/244 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 527/771 variables, 244/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/771 variables, 99/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/771 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 156/927 variables, 72/430 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 42/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/927 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 198/1125 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1125 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 12/1137 variables, 6/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1137 variables, 3/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1137 variables, 6/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1137 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 66/1203 variables, 6/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1203 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 420/1623 variables, 276/775 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1623 variables, 304/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1623 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1623 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1623/1623 variables, and 1079 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7090 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 592/592 constraints, ReadFeed: 445/445 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8297ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1451 ms.
Support contains 7 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3901/3901 transitions.
Applied a total of 0 rules in 184 ms. Remains 592 /592 variables (removed 0) and now considering 3901/3901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 592/592 places, 3901/3901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3901/3901 transitions.
Applied a total of 0 rules in 184 ms. Remains 592 /592 variables (removed 0) and now considering 3901/3901 (removed 0) transitions.
[2026-05-26 18:17:58] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2026-05-26 18:17:58] [INFO ] Invariant cache hit.
[2026-05-26 18:18:00] [INFO ] Implicit Places using invariants in 1791 ms returned []
[2026-05-26 18:18:00] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2026-05-26 18:18:00] [INFO ] Invariant cache hit.
[2026-05-26 18:18:00] [INFO ] State equation strengthened by 445 read => feed constraints.
[2026-05-26 18:18:07] [INFO ] Implicit Places using invariants and state equation in 7622 ms returned []
Implicit Place search using SMT with State Equation took 9415 ms to find 0 implicit places.
[2026-05-26 18:18:08] [INFO ] Redundant transitions in 403 ms returned []
Running 3891 sub problems to find dead transitions.
[2026-05-26 18:18:08] [INFO ] Flow matrix only has 1031 transitions (discarded 2870 similar events)
[2026-05-26 18:18:08] [INFO ] Invariant cache hit.
[2026-05-26 18:18:08] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3891 unsolved
SMT process timed out in 32223ms, After SMT, problems are : Problem set: 0 solved, 3891 unsolved
Search for dead transitions found 0 dead transitions in 32234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42249 ms. Remains : 592/592 places, 3901/3901 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 3637 edges and 592 vertex of which 100 / 592 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 348 transitions
Ensure Unique test removed 2799 transitions
Reduce isomorphic transitions removed 3147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 502 transition count 636
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 384 transition count 636
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 237 place count 384 transition count 616
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 286 place count 355 transition count 616
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 642 place count 177 transition count 438
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 730 place count 177 transition count 350
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 746 place count 169 transition count 350
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 754 place count 169 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 764 place count 169 transition count 332
Free-agglomeration rule applied 87 times.
Iterating global reduction 4 with 87 rules applied. Total rules applied 851 place count 169 transition count 245
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 938 place count 82 transition count 245
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 947 place count 82 transition count 245
Applied a total of 947 rules in 53 ms. Remains 82 /592 variables (removed 510) and now considering 245/3901 (removed 3656) transitions.
Running SMT prover for 3 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-232111810131063341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12164769647337080005.kers'
[2026-05-26 18:18:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-232111810131063341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12164769647337080005.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 245 rows 74 cols 877 entries
Finished phase 1 with 57 SingleSign rule and 3 generalized
[2026-05-26 18:18:40] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12164769647337080005.kers
Total runtime 2 ms.
[2026-05-26 18:18:40] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-26 18:18:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2026-05-26 18:18:40] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:18:41] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2026-05-26 18:18:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 18:18:41] [INFO ] After 73ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-26 18:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 1
[2026-05-26 18:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
TRAPS : Iteration 2
[2026-05-26 18:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 3
[2026-05-26 18:18:41] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-26 18:18:41] [INFO ] After 743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 885 ms.
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Knowledge-based reduction took 66497 ms.
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 19999 reset in 1240 ms.
Product exploration explored 100000 steps with 20085 reset in 1124 ms.
Spot run failed in 84 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/ltsmin1725584881348247537
[2026-05-26 18:18:45] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1725584881348247537
Running compilation step : cd /tmp/ltsmin1725584881348247537;'/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/ltsmin1725584881348247537;'/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/ltsmin1725584881348247537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 1001 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1001/1001 places, 4310/4310 transitions.
Applied a total of 0 rules in 39 ms. Remains 1001 /1001 variables (removed 0) and now considering 4310/4310 (removed 0) transitions.
[2026-05-26 18:18:48] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3657031028853874354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15468190386063497155.kers'
[2026-05-26 18:18:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3657031028853874354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15468190386063497155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1440 rows 1001 cols 3320 entries
Finished phase 1 with 960 SingleSign rule and 10 generalized
[2026-05-26 18:18:48] [INFO ] Computed 31 invariants in 5 ms
Computed 31 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15468190386063497155.kers
Total runtime 7 ms.
[2026-05-26 18:18:51] [INFO ] Implicit Places using invariants in 2782 ms returned []
[2026-05-26 18:18:51] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:18:51] [INFO ] Invariant cache hit.
[2026-05-26 18:18:51] [INFO ] State equation strengthened by 445 read => feed constraints.
[2026-05-26 18:19:08] [INFO ] Implicit Places using invariants and state equation in 17614 ms returned []
Implicit Place search using SMT with State Equation took 20399 ms to find 0 implicit places.
Running 4300 sub problems to find dead transitions.
[2026-05-26 18:19:08] [INFO ] Flow matrix only has 1440 transitions (discarded 2870 similar events)
[2026-05-26 18:19:08] [INFO ] Invariant cache hit.
[2026-05-26 18:19:08] [INFO ] State equation strengthened by 445 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4300 unsolved
SMT process timed out in 33251ms, After SMT, problems are : Problem set: 0 solved, 4300 unsolved
Search for dead transitions found 0 dead transitions in 33260ms
Finished structural reductions in LTL mode , in 1 iterations and 53713 ms. Remains : 1001/1001 places, 4310/4310 transitions.
Built C files in :
/tmp/ltsmin3586035172392696025
[2026-05-26 18:19:42] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3586035172392696025
Running compilation step : cd /tmp/ltsmin3586035172392696025;'/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/ltsmin3586035172392696025;'/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/ltsmin3586035172392696025;'/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 18:19:45] [INFO ] Flatten gal took : 126 ms
[2026-05-26 18:19:45] [INFO ] Flatten gal took : 127 ms
[2026-05-26 18:19:45] [INFO ] Time to serialize gal into /tmp/LTL10379740765800693931.gal : 25 ms
[2026-05-26 18:19:45] [INFO ] Time to serialize properties into /tmp/LTL3601017340646309602.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/LTL10379740765800693931.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14464974669979877570.hoa' '-atoms' '/tmp/LTL3601017340646309602.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3601017340646309602.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14464974669979877570.hoa
Detected timeout of ITS tools.
[2026-05-26 18:20:00] [INFO ] Flatten gal took : 79 ms
[2026-05-26 18:20:00] [INFO ] Flatten gal took : 142 ms
[2026-05-26 18:20:00] [INFO ] Time to serialize gal into /tmp/LTL16881710959815746599.gal : 28 ms
[2026-05-26 18:20:00] [INFO ] Time to serialize properties into /tmp/LTL6306981038653993818.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/LTL16881710959815746599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6306981038653993818.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 : !((G((X(X(X("(((turn_2==0)||(flag_2_idle==0))||(p25_0_9==0))"))))||(("(((flag_4_active==1)&&(p33_0_4==1))||((turn_1==1)&&(p10_3_1==1))...349
Formula 0 simplified : F(XXX!"(((turn_2==0)||(flag_2_idle==0))||(p25_0_9==0))" & (!"(((flag_4_active==1)&&(p33_0_4==1))||((turn_1==1)&&(p10_3_1==1)))" M !"...264
Detected timeout of ITS tools.
[2026-05-26 18:20:15] [INFO ] Flatten gal took : 88 ms
[2026-05-26 18:20:15] [INFO ] Applying decomposition
[2026-05-26 18:20:16] [INFO ] Flatten gal took : 88 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/graph18411468213870781948.txt' '-o' '/tmp/graph18411468213870781948.bin' '-w' '/tmp/graph18411468213870781948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18411468213870781948.bin' '-l' '-1' '-v' '-w' '/tmp/graph18411468213870781948.weights' '-q' '0' '-e' '0.001'
[2026-05-26 18:20:16] [INFO ] Decomposing Gal with order
[2026-05-26 18:20:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:20:17] [INFO ] Removed a total of 8985 redundant transitions.
[2026-05-26 18:20:17] [INFO ] Flatten gal took : 514 ms
[2026-05-26 18:20:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1021 labels/synchronizations in 214 ms.
[2026-05-26 18:20:17] [INFO ] Time to serialize gal into /tmp/LTL7297460554245985494.gal : 32 ms
[2026-05-26 18:20:17] [INFO ] Time to serialize properties into /tmp/LTL16560080773695810580.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/LTL7297460554245985494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16560080773695810580.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 : !((G((X(X(X("(((i19.u5.turn_2==0)||(i18.u3.flag_2_idle==0))||(i12.u0.p25_0_9==0))"))))||(("(((i18.u3.flag_4_active==1)&&(i18.u104.p33_...476
Formula 0 simplified : F(XXX!"(((i19.u5.turn_2==0)||(i18.u3.flag_2_idle==0))||(i12.u0.p25_0_9==0))" & (!"(((i18.u3.flag_4_active==1)&&(i18.u104.p33_0_4==1)...361
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-14 finished in 355832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X((X(p1) U ((!p2&&X(p1))||X(G(p1))))))))'
Support contains 7 out of 1004 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1004/1004 places, 4340/4340 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1000 transition count 4300
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1000 transition count 4300
Applied a total of 8 rules in 117 ms. Remains 1000 /1004 variables (removed 4) and now considering 4300/4340 (removed 40) transitions.
[2026-05-26 18:20:32] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1070309159311476764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5199687512761606936.kers'
[2026-05-26 18:20:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1070309159311476764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5199687512761606936.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1430 rows 1000 cols 3300 entries
Finished phase 1 with 959 SingleSign rule and 10 generalized
[2026-05-26 18:20:32] [INFO ] Computed 31 invariants in 10 ms
Computed 31 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-5199687512761606936.kers
Total runtime 12 ms.
[2026-05-26 18:20:35] [INFO ] Implicit Places using invariants in 3070 ms returned []
[2026-05-26 18:20:35] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:20:35] [INFO ] Invariant cache hit.
[2026-05-26 18:20:36] [INFO ] State equation strengthened by 436 read => feed constraints.
[2026-05-26 18:20:50] [INFO ] Implicit Places using invariants and state equation in 15105 ms returned []
Implicit Place search using SMT with State Equation took 18188 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2026-05-26 18:20:50] [INFO ] Flow matrix only has 1430 transitions (discarded 2870 similar events)
[2026-05-26 18:20:50] [INFO ] Invariant cache hit.
[2026-05-26 18:20:50] [INFO ] State equation strengthened by 436 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1000 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 32993ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 33001ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1004 places, 4300/4340 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51312 ms. Remains : 1000/1004 places, 4300/4340 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X((X(p1) U (X(G(p1))||(!p2&&X(p1))))))))'
Stuttering acceptance computed with spot in 422 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-10-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-10-LTLFireability-15 finished in 51813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Spot run failed in 87 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' '!(G(F((p0&&X(X(X(p1)))))))'
Spot run failed in 53 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' '!(F(((!p0&&(G(!p1)||(!p1&&F(!p2)))) U (G((!p0&&(G(!p1)||(!p1&&F(!p2)))))||(!p0&&(G(!p1)||(!p1&&F(!p2)))&&G(p3))))))'
Spot run failed in 77 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' '!(G((X(X(X(p0)))||(p1 U (p2||G(p1))))))'
Spot run failed in 56 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 18:21:24] [INFO ] Flatten gal took : 138 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9874586594234328503
[2026-05-26 18:21:24] [INFO ] Too many transitions (4340) to apply POR reductions. Disabling POR matrices.
[2026-05-26 18:21:24] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9874586594234328503
Running compilation step : cd /tmp/ltsmin9874586594234328503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' '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 18:21:24] [INFO ] Applying decomposition
[2026-05-26 18:21:25] [INFO ] Flatten gal took : 145 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/graph8552092741259316680.txt' '-o' '/tmp/graph8552092741259316680.bin' '-w' '/tmp/graph8552092741259316680.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8552092741259316680.bin' '-l' '-1' '-v' '-w' '/tmp/graph8552092741259316680.weights' '-q' '0' '-e' '0.001'
[2026-05-26 18:21:25] [INFO ] Decomposing Gal with order
[2026-05-26 18:21:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:21:25] [INFO ] Removed a total of 9136 redundant transitions.
[2026-05-26 18:21:25] [INFO ] Flatten gal took : 311 ms
[2026-05-26 18:21:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 1137 labels/synchronizations in 145 ms.
[2026-05-26 18:21:26] [INFO ] Time to serialize gal into /tmp/LTLFireability11540312858727000715.gal : 23 ms
[2026-05-26 18:21:26] [INFO ] Time to serialize properties into /tmp/LTLFireability17034555963513150901.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/LTLFireability11540312858727000715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17034555963513150901.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...278
Read 4 LTL properties
Checking formula 0 : !((X(X(X(F("((i0.u5.turn_8!=1)||(i19.u4.p27_3!=1))"))))))
Formula 0 simplified : XXXG!"((i0.u5.turn_8!=1)||(i19.u4.p27_3!=1))"
Compilation finished in 21371 ms.
Running link step : cd /tmp/ltsmin9874586594234328503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 92 ms.
Running LTSmin : cd /tmp/ltsmin9874586594234328503;'/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(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
LTSmin run took 982 ms.
FORMULA EisenbergMcGuire-PT-10-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9874586594234328503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((LTLAPp1==true)&&X(X(X((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9874586594234328503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((LTLAPp1==true)&&X(X(X((LTLAPp2==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9874586594234328503;'/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' '<>(((!(LTLAPp3==true)&&([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&<>(!(LTLAPp5==true))))) U ([]((!(LTLAPp3==true)&&([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&<>(!(LTLAPp5==true))))))||(!(LTLAPp3==true)&&([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&<>(!(LTLAPp5==true))))&&[]((LTLAPp6==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9874586594234328503;'/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' '<>(((!(LTLAPp3==true)&&([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&<>(!(LTLAPp5==true))))) U ([]((!(LTLAPp3==true)&&([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&<>(!(LTLAPp5==true))))))||(!(LTLAPp3==true)&&([](!(LTLAPp4==true))||(!(LTLAPp4==true)&&<>(!(LTLAPp5==true))))&&[]((LTLAPp6==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9874586594234328503;'/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(X(X((LTLAPp7==true))))||((LTLAPp8==true) U ((LTLAPp9==true)||[]((LTLAPp8==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9874586594234328503;'/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(X(X((LTLAPp7==true))))||((LTLAPp8==true) U ((LTLAPp9==true)||[]((LTLAPp8==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9874586594234328503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((LTLAPp1==true)&&X(X(X((LTLAPp2==true)))))))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
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-10, 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-177955740500292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 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 ;