About the Execution of ITS-Tools for EisenbergMcGuire-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16203.067 | 3600000.00 | 5639223.00 | 106330.60 | FTFFFTFF?TFFFFFF | 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-177955740500276.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-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740500276
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 9.5K Mar 7 05:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 7 05:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 09:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 05:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 05:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.7M 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-08-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779794403873
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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 11:20:06] [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 11:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 11:20:07] [INFO ] Load time of PNML (sax parser for PT used): 408 ms
[2026-05-26 11:20:07] [INFO ] Transformed 712 places.
[2026-05-26 11:20:07] [INFO ] Transformed 2816 transitions.
[2026-05-26 11:20:07] [INFO ] Found NUPN structural information;
[2026-05-26 11:20:07] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 634 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-08-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 663 transition count 2424
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 663 transition count 2424
Applied a total of 98 rules in 284 ms. Remains 663 /712 variables (removed 49) and now considering 2424/2816 (removed 392) transitions.
[2026-05-26 11:20:07] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3306541276285113949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7951350163579123886.kers'
[2026-05-26 11:20:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3306541276285113949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7951350163579123886.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 976 rows 663 cols 2240 entries
Finished phase 1 with 630 SingleSign rule and 8 generalized
[2026-05-26 11:20:08] [INFO ] Computed 25 invariants in 8 ms
Computed 25 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7951350163579123886.kers
Total runtime 10 ms.
[2026-05-26 11:20:09] [INFO ] Implicit Places using invariants in 1745 ms returned []
[2026-05-26 11:20:09] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2026-05-26 11:20:09] [INFO ] Invariant cache hit.
[2026-05-26 11:20:10] [INFO ] State equation strengthened by 333 read => feed constraints.
[2026-05-26 11:20:14] [INFO ] Implicit Places using invariants and state equation in 5184 ms returned []
Implicit Place search using SMT with State Equation took 7001 ms to find 0 implicit places.
Running 2416 sub problems to find dead transitions.
[2026-05-26 11:20:14] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2026-05-26 11:20:14] [INFO ] Invariant cache hit.
[2026-05-26 11:20:15] [INFO ] State equation strengthened by 333 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/663 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2416 unsolved
SMT process timed out in 31523ms, After SMT, problems are : Problem set: 0 solved, 2416 unsolved
Search for dead transitions found 0 dead transitions in 31575ms
Starting structural reductions in LTL mode, iteration 1 : 663/712 places, 2424/2816 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38940 ms. Remains : 663/712 places, 2424/2816 transitions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Applied a total of 0 rules in 42 ms. Remains 663 /663 variables (removed 0) and now considering 2424/2424 (removed 0) transitions.
[2026-05-26 11:20:46] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2026-05-26 11:20:46] [INFO ] Invariant cache hit.
[2026-05-26 11:20:47] [INFO ] Implicit Places using invariants in 623 ms returned []
[2026-05-26 11:20:47] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2026-05-26 11:20:47] [INFO ] Invariant cache hit.
[2026-05-26 11:20:47] [INFO ] State equation strengthened by 333 read => feed constraints.
[2026-05-26 11:20:51] [INFO ] Implicit Places using invariants and state equation in 4579 ms returned []
Implicit Place search using SMT with State Equation took 5212 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5256 ms. Remains : 663/663 places, 2424/2424 transitions.
Support contains 59 out of 663 places after structural reductions.
[2026-05-26 11:20:52] [INFO ] Flatten gal took : 267 ms
[2026-05-26 11:20:52] [INFO ] Flatten gal took : 199 ms
[2026-05-26 11:20:52] [INFO ] Input system was already deterministic with 2424 transitions.
RANDOM walk for 40000 steps (8 resets) in 2134 ms. (18 steps per ms) remains 29/37 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 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 20 ms. (190 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 23 ms. (166 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 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 16 ms. (235 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 18 ms. (210 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 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 17 ms. (222 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 34 ms. (114 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 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 10 ms. (364 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 10 ms. (364 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 10 ms. (364 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 13 ms. (286 steps per ms) remains 29/29 properties
[2026-05-26 11:20:53] [INFO ] Flow matrix only has 976 transitions (discarded 1448 similar events)
[2026-05-26 11:20:53] [INFO ] Invariant cache hit.
[2026-05-26 11:20:53] [INFO ] State equation strengthened by 333 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, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 421/469 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 194/663 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 663/1639 variables, and 40 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/663 constraints, ReadFeed: 0/333 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 421/469 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 194/663 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
SMT process timed out in 10512ms, After SMT, problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 663 transition count 2417
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 656 transition count 2417
Performed 195 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 195 Pre rules applied. Total rules applied 14 place count 656 transition count 2222
Deduced a syphon composed of 195 places in 3 ms
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 2 with 390 rules applied. Total rules applied 404 place count 461 transition count 2222
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 406 place count 459 transition count 2206
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 459 transition count 2206
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 520 place count 403 transition count 2150
Applied a total of 520 rules in 421 ms. Remains 403 /663 variables (removed 260) and now considering 2150/2424 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 403/663 places, 2150/2424 transitions.
RANDOM walk for 40000 steps (8 resets) in 996 ms. (40 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 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 20 ms. (190 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 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 26 ms. (148 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 23 ms. (166 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 46 ms. (85 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 45 ms. (87 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 26 ms. (148 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 26 ms. (148 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 24 ms. (160 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 18 ms. (210 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 9 ms. (400 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 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 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
Interrupted probabilistic random walk after 123849 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :9 out of 29
Probabilistic random walk after 123849 steps, saw 80188 distinct states, run finished after 3010 ms. (steps per millisecond=41 ) properties seen :9
[2026-05-26 11:21:08] [INFO ] Flow matrix only has 702 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13722487582704047061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7310321681715645684.kers'
[2026-05-26 11:21:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13722487582704047061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7310321681715645684.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 702 rows 403 cols 1692 entries
Finished phase 1 with 370 SingleSign rule and 8 generalized
[2026-05-26 11:21:08] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7310321681715645684.kers
Total runtime 5 ms.
[2026-05-26 11:21:08] [INFO ] State equation strengthened by 319 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 254/290 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 39/329 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 74/403 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 702/1105 variables, 403/440 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1105 variables, 319/759 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1105 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/1105 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1105/1105 variables, and 759 constraints, problems are : Problem set: 0 solved, 20 unsolved in 6735 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 403/403 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 254/290 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 39/329 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 74/403 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 702/1105 variables, 403/445 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1105 variables, 319/764 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 5/789 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1105 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 0/1105 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1105/1105 variables, and 789 constraints, problems are : Problem set: 0 solved, 20 unsolved in 15436 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 403/403 constraints, ReadFeed: 319/319 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22215ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 1 properties in 4346 ms.
Support contains 35 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 2150/2150 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 403 transition count 2145
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 398 transition count 2145
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 396 transition count 2129
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 396 transition count 2129
Applied a total of 14 rules in 118 ms. Remains 396 /403 variables (removed 7) and now considering 2129/2150 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 396/403 places, 2129/2150 transitions.
RANDOM walk for 40000 steps (8 resets) in 450 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 121788 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 19
Probabilistic random walk after 121788 steps, saw 78247 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2026-05-26 11:21:38] [INFO ] Flow matrix only has 681 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16582635106722067823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16259708882197966679.kers'
[2026-05-26 11:21:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16582635106722067823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16259708882197966679.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 681 rows 396 cols 1650 entries
Finished phase 1 with 363 SingleSign rule and 8 generalized
[2026-05-26 11:21:38] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16259708882197966679.kers
Total runtime 5 ms.
[2026-05-26 11:21:38] [INFO ] State equation strengthened by 305 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 251/286 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 38/324 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 72/396 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 681/1077 variables, 396/431 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1077 variables, 305/736 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1077 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/1077 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 736 constraints, problems are : Problem set: 0 solved, 19 unsolved in 4782 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 396/396 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 251/286 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 38/324 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 72/396 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 681/1077 variables, 396/444 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1077 variables, 305/749 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1077 variables, 19/768 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1077 variables, 1/769 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1077 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1077 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 0/1077 variables, 2/772 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1077 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1077 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (OVERLAPS) 0/1077 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 773 constraints, problems are : Problem set: 0 solved, 19 unsolved in 32295 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 396/396 constraints, ReadFeed: 305/305 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37159ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 2980 ms.
Support contains 35 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2129/2129 transitions.
Applied a total of 0 rules in 86 ms. Remains 396 /396 variables (removed 0) and now considering 2129/2129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 396/396 places, 2129/2129 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2129/2129 transitions.
Applied a total of 0 rules in 78 ms. Remains 396 /396 variables (removed 0) and now considering 2129/2129 (removed 0) transitions.
[2026-05-26 11:22:18] [INFO ] Flow matrix only has 681 transitions (discarded 1448 similar events)
[2026-05-26 11:22:18] [INFO ] Invariant cache hit.
[2026-05-26 11:22:19] [INFO ] Implicit Places using invariants in 557 ms returned []
[2026-05-26 11:22:19] [INFO ] Flow matrix only has 681 transitions (discarded 1448 similar events)
[2026-05-26 11:22:19] [INFO ] Invariant cache hit.
[2026-05-26 11:22:19] [INFO ] State equation strengthened by 305 read => feed constraints.
[2026-05-26 11:22:21] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 3107 ms to find 0 implicit places.
[2026-05-26 11:22:22] [INFO ] Redundant transitions in 213 ms returned []
Running 2121 sub problems to find dead transitions.
[2026-05-26 11:22:22] [INFO ] Flow matrix only has 681 transitions (discarded 1448 similar events)
[2026-05-26 11:22:22] [INFO ] Invariant cache hit.
[2026-05-26 11:22:22] [INFO ] State equation strengthened by 305 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 396/1077 variables, and 39 constraints, problems are : Problem set: 0 solved, 2121 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/396 constraints, ReadFeed: 0/305 constraints, PredecessorRefiner: 2121/2121 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 2121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2121 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/1077 variables, and 82 constraints, problems are : Problem set: 0 solved, 2121 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/396 constraints, ReadFeed: 0/305 constraints, PredecessorRefiner: 0/2121 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61040ms problems are : Problem set: 0 solved, 2121 unsolved
Search for dead transitions found 0 dead transitions in 61056ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64475 ms. Remains : 396/396 places, 2129/2129 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 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 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 422 place count 449 transition count 2168
Iterating global reduction 2 with 6 rules applied. Total rules applied 428 place count 449 transition count 2168
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2112
Applied a total of 540 rules in 338 ms. Remains 393 /663 variables (removed 270) and now considering 2112/2424 (removed 312) transitions.
[2026-05-26 11:23:23] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14043838339456885512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16240265704571091432.kers'
[2026-05-26 11:23:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14043838339456885512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16240265704571091432.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 664 rows 393 cols 1616 entries
Finished phase 1 with 360 SingleSign rule and 8 generalized
[2026-05-26 11:23:24] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16240265704571091432.kers
Total runtime 5 ms.
[2026-05-26 11:23:25] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2026-05-26 11:23:25] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2026-05-26 11:23:25] [INFO ] Invariant cache hit.
[2026-05-26 11:23:25] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:23:28] [INFO ] Implicit Places using invariants and state equation in 3394 ms returned []
Implicit Place search using SMT with State Equation took 4706 ms to find 0 implicit places.
[2026-05-26 11:23:28] [INFO ] Redundant transitions in 56 ms returned []
Running 2104 sub problems to find dead transitions.
[2026-05-26 11:23:28] [INFO ] Flow matrix only has 664 transitions (discarded 1448 similar events)
[2026-05-26 11:23:28] [INFO ] Invariant cache hit.
[2026-05-26 11:23:28] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1057 variables, and 32 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1057 variables, and 72 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60898ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 60907ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2112/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66024 ms. Remains : 393/663 places, 2112/2424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 434 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 149 reset in 625 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-00 finished in 67232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(F((p2&&(X(X(p4))||p3))))))'
Support contains 8 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 39 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2026-05-26 11:24:30] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6767928495495942170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10764224292375638565.kers'
[2026-05-26 11:24:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6767928495495942170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10764224292375638565.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:24:30] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10764224292375638565.kers
Total runtime 6 ms.
[2026-05-26 11:24:31] [INFO ] Implicit Places using invariants in 1112 ms returned []
[2026-05-26 11:24:31] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:24:31] [INFO ] Invariant cache hit.
[2026-05-26 11:24:32] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:24:38] [INFO ] Implicit Places using invariants and state equation in 6766 ms returned []
Implicit Place search using SMT with State Equation took 7895 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:24:38] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:24:38] [INFO ] Invariant cache hit.
[2026-05-26 11:24:38] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 30800ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 30807ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38750 ms. Remains : 656/663 places, 2368/2424 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 p1)||X(F((p2&&(X(X(p4))||p3))))))'
Stuttering acceptance computed with spot in 628 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 1030 ms.
Product exploration explored 100000 steps with 50000 reset in 988 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 101 ms. Reduced automaton from 9 states, 26 edges and 5 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 518 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 133002 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :1 out of 6
Probabilistic random walk after 133002 steps, saw 97215 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :1
[2026-05-26 11:25:15] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:25:15] [INFO ] Invariant cache hit.
[2026-05-26 11:25:15] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 118/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 112/236 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 96/332 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 516/848 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 82/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 88/936 variables, 40/467 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 24/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 180/1116 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 8/1124 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1124 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 96/1220 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1220 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 356/1576 variables, 284/787 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1576 variables, 178/965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1576 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1576 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 965 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3803 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 118/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 112/236 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 96/332 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 516/848 variables, 332/351 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 82/433 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 2/435 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 88/936 variables, 40/475 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/936 variables, 24/499 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/936 variables, 0/499 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/1116 variables, 4/503 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1116 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 8/1124 variables, 4/507 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 2/509 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SMT process timed out in 9105ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1278 ms.
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 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 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 648 transition count 2162
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 524 place count 394 transition count 2106
Applied a total of 524 rules in 155 ms. Remains 394 /656 variables (removed 262) and now considering 2106/2368 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 394/656 places, 2106/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 209448 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 4
Probabilistic random walk after 209448 steps, saw 120780 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2026-05-26 11:25:29] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7940615647777695985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1880764382088724235.kers'
[2026-05-26 11:25:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7940615647777695985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1880764382088724235.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 658 rows 394 cols 1604 entries
Finished phase 1 with 361 SingleSign rule and 8 generalized
[2026-05-26 11:25:29] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1880764382088724235.kers
Total runtime 4 ms.
[2026-05-26 11:25:29] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 84/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 76/166 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 36/202 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 386/588 variables, 202/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 82/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 88/676 variables, 40/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 28/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 108/784 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/784 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/792 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/792 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 36/828 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/828 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 224/1052 variables, 152/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1052 variables, 174/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 84/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 76/166 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 36/202 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 386/588 variables, 202/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 82/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 88/676 variables, 40/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/676 variables, 28/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 108/784 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/784 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 8/792 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/792 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/792 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/792 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 36/828 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/828 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/828 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 224/1052 variables, 152/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1052 variables, 174/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1052 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1052 variables, 0/722 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 722 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6960 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8331ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1358 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 118 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 116 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2026-05-26 11:25:39] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-26 11:25:39] [INFO ] Invariant cache hit.
[2026-05-26 11:25:40] [INFO ] Implicit Places using invariants in 987 ms returned []
[2026-05-26 11:25:40] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-26 11:25:40] [INFO ] Invariant cache hit.
[2026-05-26 11:25:40] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:25:43] [INFO ] Implicit Places using invariants and state equation in 3386 ms returned []
Implicit Place search using SMT with State Equation took 4376 ms to find 0 implicit places.
[2026-05-26 11:25:44] [INFO ] Redundant transitions in 259 ms returned []
Running 2098 sub problems to find dead transitions.
[2026-05-26 11:25:44] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-26 11:25:44] [INFO ] Invariant cache hit.
[2026-05-26 11:25:44] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
SMT process timed out in 30930ms, After SMT, problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 30938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35709 ms. Remains : 394/394 places, 2106/2106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1952 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 5 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 338 transition count 412
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 260 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 259 transition count 411
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 159 place count 259 transition count 394
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 201 place count 234 transition count 394
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 419 place count 125 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 474 place count 125 transition count 230
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 488 place count 118 transition count 236
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 494 place count 118 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 500 place count 118 transition count 224
Free-agglomeration rule applied 49 times.
Iterating global reduction 5 with 49 rules applied. Total rules applied 549 place count 118 transition count 175
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 5 with 49 rules applied. Total rules applied 598 place count 69 transition count 175
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 607 place count 69 transition count 175
Applied a total of 607 rules in 57 ms. Remains 69 /394 variables (removed 325) and now considering 175/2106 (removed 1931) 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-17844735652518881346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15823351442065533885.kers'
[2026-05-26 11:26:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17844735652518881346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15823351442065533885.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 175 rows 63 cols 611 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-26 11:26:15] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15823351442065533885.kers
Total runtime 2 ms.
[2026-05-26 11:26:15] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-26 11:26:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2026-05-26 11:26:15] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2026-05-26 11:26:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-26 11:26:15] [INFO ] After 56ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-26 11:26:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
TRAPS : Iteration 1
[2026-05-26 11:26:16] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-26 11:26:16] [INFO ] After 780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 936 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 20 factoid took 132 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (AND (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4))]
Knowledge-based reduction took 64218 ms.
Stuttering acceptance computed with spot in 212 ms :[(NOT p2), (AND (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4))]
Support contains 6 out of 656 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 53 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2026-05-26 11:26:16] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1362303586953173037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12575335325869846572.kers'
[2026-05-26 11:26:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1362303586953173037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12575335325869846572.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:26:16] [INFO ] Computed 25 invariants in 6 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12575335325869846572.kers
Total runtime 8 ms.
[2026-05-26 11:26:18] [INFO ] Implicit Places using invariants in 1534 ms returned []
[2026-05-26 11:26:18] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:26:18] [INFO ] Invariant cache hit.
[2026-05-26 11:26:18] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:26:23] [INFO ] Implicit Places using invariants and state equation in 5640 ms returned []
Implicit Place search using SMT with State Equation took 7176 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:26:23] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:26:23] [INFO ] Invariant cache hit.
[2026-05-26 11:26:23] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 30926ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 30931ms
Finished structural reductions in LTL mode , in 1 iterations and 38167 ms. Remains : 656/656 places, 2368/2368 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 7 factoid took 99 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 285 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 168570 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :1 out of 5
Probabilistic random walk after 168570 steps, saw 120996 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :1
[2026-05-26 11:26:58] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:26:58] [INFO ] Invariant cache hit.
[2026-05-26 11:26:58] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 112/236 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 96/332 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 516/848 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 82/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 88/936 variables, 40/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 24/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 180/1116 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/1124 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1124 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 96/1220 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1220 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 356/1576 variables, 284/787 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1576 variables, 178/965 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1576 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1576 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 965 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2802 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 118/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 112/236 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 96/332 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 516/848 variables, 332/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 82/432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 88/936 variables, 40/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/936 variables, 24/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/936 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 180/1116 variables, 4/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1116 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 8/1124 variables, 4/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1576 variables, and 511 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 4/8 constraints, State Equation: 372/656 constraints, ReadFeed: 106/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7832ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 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 656 transition count 2360
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 2360
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 648 transition count 2162
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 450 transition count 2162
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 524 place count 394 transition count 2106
Applied a total of 524 rules in 264 ms. Remains 394 /656 variables (removed 262) and now considering 2106/2368 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 394/656 places, 2106/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 471 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 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 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 211374 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 211374 steps, saw 121593 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2026-05-26 11:27:09] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2456544546774723040.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16613637353474749089.kers'
[2026-05-26 11:27:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2456544546774723040.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16613637353474749089.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 658 rows 394 cols 1604 entries
Finished phase 1 with 361 SingleSign rule and 8 generalized
[2026-05-26 11:27:09] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16613637353474749089.kers
Total runtime 4 ms.
[2026-05-26 11:27:09] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 84/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 76/166 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 36/202 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 386/588 variables, 202/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/588 variables, 82/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 88/676 variables, 40/337 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 28/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 108/784 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/784 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/792 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/792 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 36/828 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/828 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 224/1052 variables, 152/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1052 variables, 174/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1052 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 703 constraints, problems are : Problem set: 0 solved, 4 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 84/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 76/166 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 36/202 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 386/588 variables, 202/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/588 variables, 82/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/588 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 88/676 variables, 40/342 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/676 variables, 28/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/676 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/676 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 108/784 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/784 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 8/792 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/792 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/792 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/792 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 36/828 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/828 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 224/1052 variables, 152/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1052 variables, 174/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1052 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1052 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 721 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6237 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7258ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1061 ms.
Support contains 6 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 71 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 70 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2026-05-26 11:27:18] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-26 11:27:18] [INFO ] Invariant cache hit.
[2026-05-26 11:27:18] [INFO ] Implicit Places using invariants in 797 ms returned []
[2026-05-26 11:27:18] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-26 11:27:18] [INFO ] Invariant cache hit.
[2026-05-26 11:27:19] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:27:22] [INFO ] Implicit Places using invariants and state equation in 3217 ms returned []
Implicit Place search using SMT with State Equation took 4030 ms to find 0 implicit places.
[2026-05-26 11:27:22] [INFO ] Redundant transitions in 55 ms returned []
Running 2098 sub problems to find dead transitions.
[2026-05-26 11:27:22] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2026-05-26 11:27:22] [INFO ] Invariant cache hit.
[2026-05-26 11:27:22] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 33 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 67 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61077ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 61083ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65258 ms. Remains : 394/394 places, 2106/2106 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1952 edges and 394 vertex of which 64 / 394 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 338 transition count 412
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 260 transition count 411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 259 transition count 411
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 159 place count 259 transition count 394
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 201 place count 234 transition count 394
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 419 place count 125 transition count 285
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 474 place count 125 transition count 230
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 488 place count 118 transition count 236
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 494 place count 118 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 500 place count 118 transition count 224
Free-agglomeration rule applied 49 times.
Iterating global reduction 5 with 49 rules applied. Total rules applied 549 place count 118 transition count 175
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 5 with 49 rules applied. Total rules applied 598 place count 69 transition count 175
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 607 place count 69 transition count 175
Applied a total of 607 rules in 52 ms. Remains 69 /394 variables (removed 325) and now considering 175/2106 (removed 1931) 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-8573875747537173281.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12955101796558086616.kers'
[2026-05-26 11:28:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8573875747537173281.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12955101796558086616.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 175 rows 63 cols 611 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-26 11:28:23] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12955101796558086616.kers
Total runtime 2 ms.
[2026-05-26 11:28:23] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-26 11:28:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2026-05-26 11:28:23] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2026-05-26 11:28:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-26 11:28:23] [INFO ] After 60ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-26 11:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
TRAPS : Iteration 1
[2026-05-26 11:28:23] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-26 11:28:23] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 718 ms.
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (AND (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4))]
Knowledge-based reduction took 89504 ms.
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (AND (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4))]
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (AND (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4))]
Product exploration explored 100000 steps with 50000 reset in 949 ms.
Product exploration explored 100000 steps with 50000 reset in 671 ms.
Spot run failed in 155 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/ltsmin14240939286400656639
[2026-05-26 11:28:26] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14240939286400656639
Running compilation step : cd /tmp/ltsmin14240939286400656639;'/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/ltsmin14240939286400656639;'/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/ltsmin14240939286400656639;'/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 6 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 17 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2026-05-26 11:28:29] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14780512715980456812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4749645609494245878.kers'
[2026-05-26 11:28:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14780512715980456812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4749645609494245878.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:28:29] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4749645609494245878.kers
Total runtime 5 ms.
[2026-05-26 11:28:30] [INFO ] Implicit Places using invariants in 944 ms returned []
[2026-05-26 11:28:30] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:28:30] [INFO ] Invariant cache hit.
[2026-05-26 11:28:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:28:38] [INFO ] Implicit Places using invariants and state equation in 7256 ms returned []
Implicit Place search using SMT with State Equation took 8217 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:28:38] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:28:38] [INFO ] Invariant cache hit.
[2026-05-26 11:28:38] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 30788ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 30793ms
Finished structural reductions in LTL mode , in 1 iterations and 39034 ms. Remains : 656/656 places, 2368/2368 transitions.
Built C files in :
/tmp/ltsmin7439709553467321458
[2026-05-26 11:29:08] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7439709553467321458
Running compilation step : cd /tmp/ltsmin7439709553467321458;'/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/ltsmin7439709553467321458;'/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/ltsmin7439709553467321458;'/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 11:29:12] [INFO ] Flatten gal took : 131 ms
[2026-05-26 11:29:12] [INFO ] Flatten gal took : 92 ms
[2026-05-26 11:29:12] [INFO ] Time to serialize gal into /tmp/LTL1653860087595143535.gal : 33 ms
[2026-05-26 11:29:12] [INFO ] Time to serialize properties into /tmp/LTL11163396858139612064.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/LTL1653860087595143535.gal' '-t' 'CGAL' '-hoa' '/tmp/aut131949267188239914.hoa' '-atoms' '/tmp/LTL11163396858139612064.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/LTL11163396858139612064.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut131949267188239914.hoa
Detected timeout of ITS tools.
[2026-05-26 11:29:27] [INFO ] Flatten gal took : 77 ms
[2026-05-26 11:29:27] [INFO ] Flatten gal took : 76 ms
[2026-05-26 11:29:27] [INFO ] Time to serialize gal into /tmp/LTL5770445482478833510.gal : 21 ms
[2026-05-26 11:29:27] [INFO ] Time to serialize properties into /tmp/LTL5392374140970164610.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/LTL5770445482478833510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5392374140970164610.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("(((turn_1==1)&&(flag_1_active==1))&&(p25_5_6==1))")U("((flag_0_active==1)&&(p33_6_0==1))"))||(X(F(("((flag_1_active==0)||(p18_5_...249
Formula 0 simplified : (!"(((turn_1==1)&&(flag_1_active==1))&&(p25_5_6==1))" R !"((flag_0_active==1)&&(p33_6_0==1))") & XG(!"((flag_1_active==0)||(p18_5_1=...238
Detected timeout of ITS tools.
[2026-05-26 11:29:42] [INFO ] Flatten gal took : 74 ms
[2026-05-26 11:29:42] [INFO ] Applying decomposition
[2026-05-26 11:29:43] [INFO ] Flatten gal took : 77 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/graph8250430003625429701.txt' '-o' '/tmp/graph8250430003625429701.bin' '-w' '/tmp/graph8250430003625429701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8250430003625429701.bin' '-l' '-1' '-v' '-w' '/tmp/graph8250430003625429701.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:29:43] [INFO ] Decomposing Gal with order
[2026-05-26 11:29:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:29:43] [INFO ] Removed a total of 4642 redundant transitions.
[2026-05-26 11:29:44] [INFO ] Flatten gal took : 548 ms
[2026-05-26 11:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 678 labels/synchronizations in 165 ms.
[2026-05-26 11:29:44] [INFO ] Time to serialize gal into /tmp/LTL13550296908228851294.gal : 28 ms
[2026-05-26 11:29:44] [INFO ] Time to serialize properties into /tmp/LTL1551518644661350827.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/LTL13550296908228851294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1551518644661350827.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 : !(((("(((i1.u167.turn_1==1)&&(i10.i3.u164.flag_1_active==1))&&(i1.u3.p25_5_6==1))")U("((i17.i3.u5.flag_0_active==1)&&(i11.i1.u197.p33_...361
Formula 0 simplified : (!"(((i1.u167.turn_1==1)&&(i10.i3.u164.flag_1_active==1))&&(i1.u3.p25_5_6==1))" R !"((i17.i3.u5.flag_0_active==1)&&(i11.i1.u197.p33_...350
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-01 finished in 328627 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) U X(X(G(p1)))))'
Support contains 3 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 53 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
[2026-05-26 11:29:59] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12464658844965628109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13346378449306950374.kers'
[2026-05-26 11:29:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12464658844965628109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13346378449306950374.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 928 rows 657 cols 2144 entries
Finished phase 1 with 624 SingleSign rule and 8 generalized
[2026-05-26 11:29:59] [INFO ] Computed 25 invariants in 6 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13346378449306950374.kers
Total runtime 8 ms.
[2026-05-26 11:30:01] [INFO ] Implicit Places using invariants in 1729 ms returned []
[2026-05-26 11:30:01] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:30:01] [INFO ] Invariant cache hit.
[2026-05-26 11:30:01] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:30:08] [INFO ] Implicit Places using invariants and state equation in 6857 ms returned []
Implicit Place search using SMT with State Equation took 8591 ms to find 0 implicit places.
Running 2368 sub problems to find dead transitions.
[2026-05-26 11:30:08] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:30:08] [INFO ] Invariant cache hit.
[2026-05-26 11:30:08] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/657 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2368 unsolved
SMT process timed out in 30797ms, After SMT, problems are : Problem set: 0 solved, 2368 unsolved
Search for dead transitions found 0 dead transitions in 30802ms
Starting structural reductions in LTL mode, iteration 1 : 657/663 places, 2376/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39453 ms. Remains : 657/663 places, 2376/2424 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) U X(X(G(p1)))))'
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-02
Product exploration explored 100000 steps with 107 reset in 243 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-02 finished in 39921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((F(p0) U X(p1))) U (!p0&&F(!p2))))))'
Support contains 9 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 31 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2026-05-26 11:30:39] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8028185143043801545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11252350327851560429.kers'
[2026-05-26 11:30:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8028185143043801545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11252350327851560429.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:30:39] [INFO ] Computed 25 invariants in 6 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11252350327851560429.kers
Total runtime 8 ms.
[2026-05-26 11:30:40] [INFO ] Implicit Places using invariants in 1323 ms returned []
[2026-05-26 11:30:40] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:30:40] [INFO ] Invariant cache hit.
[2026-05-26 11:30:41] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:30:46] [INFO ] Implicit Places using invariants and state equation in 6248 ms returned []
Implicit Place search using SMT with State Equation took 7574 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:30:47] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:30:47] [INFO ] Invariant cache hit.
[2026-05-26 11:30:47] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31148ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31157ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38771 ms. Remains : 656/663 places, 2368/2424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((F(p0) U X(p1))) U (!p0&&F(!p2))))))'
Stuttering acceptance computed with spot in 389 ms :[(OR p0 p2), (OR p0 p2), (OR (NOT p1) p0 p2), p2, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 272 ms.
Product exploration explored 100000 steps with 0 reset in 479 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 7 factoid took 80 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 688 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 171171 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :2 out of 5
Probabilistic random walk after 171171 steps, saw 122685 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :2
[2026-05-26 11:31:23] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:31:23] [INFO ] Invariant cache hit.
[2026-05-26 11:31:23] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 171/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/236 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 96/332 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 516/848 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 84/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 88/936 variables, 40/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 22/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 180/1116 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1124 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1124 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 96/1220 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1220 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 356/1576 variables, 284/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1576 variables, 178/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1576 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1576 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 965 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 171/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 56/236 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/332 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 516/848 variables, 332/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 84/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 88/936 variables, 40/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/936 variables, 22/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/936 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 180/1116 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1116 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/1124 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 9/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7251ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 656 transition count 2361
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 649 transition count 2361
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 14 place count 649 transition count 2161
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 414 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 526 place count 393 transition count 2105
Applied a total of 526 rules in 179 ms. Remains 393 /656 variables (removed 263) and now considering 2105/2368 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 393/656 places, 2105/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 419 ms. (95 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 220806 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 3
Probabilistic random walk after 220806 steps, saw 127273 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2026-05-26 11:31:33] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8795990138924384353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4546243363176818643.kers'
[2026-05-26 11:31:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8795990138924384353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4546243363176818643.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 657 rows 393 cols 1602 entries
Finished phase 1 with 360 SingleSign rule and 8 generalized
[2026-05-26 11:31:33] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4546243363176818643.kers
Total runtime 6 ms.
[2026-05-26 11:31:33] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 118/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/165 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/201 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 385/586 variables, 201/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 84/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 88/674 variables, 40/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 25/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 108/782 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/782 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/790 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/790 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 36/826 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/826 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 224/1050 variables, 152/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1050 variables, 175/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1050 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1050 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1050/1050 variables, and 702 constraints, problems are : Problem set: 0 solved, 3 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 284/284 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 118/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 38/165 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 36/201 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 385/586 variables, 201/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 84/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 88/674 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 25/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/674 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 108/782 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/782 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/790 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/790 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/790 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/790 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/790 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 36/826 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/826 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 224/1050 variables, 152/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1050 variables, 175/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1050 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1050 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1050/1050 variables, and 717 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6171 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7003ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1166 ms.
Support contains 9 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 78 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 69 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2026-05-26 11:31:42] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:31:42] [INFO ] Invariant cache hit.
[2026-05-26 11:31:43] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2026-05-26 11:31:43] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:31:43] [INFO ] Invariant cache hit.
[2026-05-26 11:31:43] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:31:46] [INFO ] Implicit Places using invariants and state equation in 3684 ms returned []
Implicit Place search using SMT with State Equation took 4811 ms to find 0 implicit places.
[2026-05-26 11:31:47] [INFO ] Redundant transitions in 89 ms returned []
Running 2097 sub problems to find dead transitions.
[2026-05-26 11:31:47] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:31:47] [INFO ] Invariant cache hit.
[2026-05-26 11:31:47] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1050 variables, and 33 constraints, problems are : Problem set: 0 solved, 2097 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2097/2097 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
SMT process timed out in 61280ms, After SMT, problems are : Problem set: 0 solved, 2097 unsolved
Search for dead transitions found 0 dead transitions in 61288ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66272 ms. Remains : 393/393 places, 2105/2105 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1894 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 0 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 337 transition count 412
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 155 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 197 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 415 place count 126 transition count 286
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 466 place count 126 transition count 235
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 482 place count 118 transition count 235
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 490 place count 118 transition count 227
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 500 place count 118 transition count 217
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 558 place count 118 transition count 159
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 616 place count 60 transition count 159
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 624 place count 60 transition count 159
Applied a total of 624 rules in 23 ms. Remains 60 /393 variables (removed 333) and now considering 159/2105 (removed 1946) 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-4058869536067269169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14985346563501759178.kers'
[2026-05-26 11:32:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4058869536067269169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14985346563501759178.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 159 rows 52 cols 552 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-26 11:32:48] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14985346563501759178.kers
Total runtime 1 ms.
[2026-05-26 11:32:48] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2026-05-26 11:32:48] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-26 11:32:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2026-05-26 11:32:48] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2026-05-26 11:32:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 11:32:48] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-26 11:32:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2026-05-26 11:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
TRAPS : Iteration 1
[2026-05-26 11:32:48] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-26 11:32:48] [INFO ] After 450ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 635 ms.
Knowledge based reduction with 7 factoid took 110 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR p0 p2), (OR p0 p2), (OR (NOT p1) p0 p2), p2, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 90041 ms.
Stuttering acceptance computed with spot in 318 ms :[(OR p0 p2), (OR p0 p2), (OR (NOT p1) p0 p2), p2, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 9 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 15 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2026-05-26 11:32:49] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5437982828971660447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6614761099017248579.kers'
[2026-05-26 11:32:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5437982828971660447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6614761099017248579.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:32:49] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6614761099017248579.kers
Total runtime 6 ms.
[2026-05-26 11:32:51] [INFO ] Implicit Places using invariants in 1394 ms returned []
[2026-05-26 11:32:51] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:32:51] [INFO ] Invariant cache hit.
[2026-05-26 11:32:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:32:57] [INFO ] Implicit Places using invariants and state equation in 6356 ms returned []
Implicit Place search using SMT with State Equation took 7765 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:32:57] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:32:57] [INFO ] Invariant cache hit.
[2026-05-26 11:32:57] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31001ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31006ms
Finished structural reductions in LTL mode , in 1 iterations and 38797 ms. Remains : 656/656 places, 2368/2368 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 7 factoid took 71 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 131328 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :2 out of 5
Probabilistic random walk after 131328 steps, saw 95960 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :2
[2026-05-26 11:33:31] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:33:31] [INFO ] Invariant cache hit.
[2026-05-26 11:33:31] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 171/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/236 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 96/332 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 516/848 variables, 332/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/848 variables, 84/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/848 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 88/936 variables, 40/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 22/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/936 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 180/1116 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1124 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1124 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 96/1220 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1220 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 356/1576 variables, 284/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1576 variables, 178/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1576 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1576 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1576/1576 variables, and 965 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1967 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 656/656 constraints, ReadFeed: 284/284 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 171/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 56/236 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 96/332 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 516/848 variables, 332/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/848 variables, 84/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/848 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 88/936 variables, 40/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/936 variables, 22/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/936 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 180/1116 variables, 4/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1116 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/1124 variables, 4/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1124 variables, 3/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1124 variables, 9/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1124 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7072ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 656 transition count 2361
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 649 transition count 2361
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 14 place count 649 transition count 2161
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 414 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 526 place count 393 transition count 2105
Applied a total of 526 rules in 141 ms. Remains 393 /656 variables (removed 263) and now considering 2105/2368 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 393/656 places, 2105/2368 transitions.
RANDOM walk for 40000 steps (8 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 233487 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 3
Probabilistic random walk after 233487 steps, saw 133771 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2026-05-26 11:33:42] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7674470024236548220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13037323435573297600.kers'
[2026-05-26 11:33:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7674470024236548220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13037323435573297600.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 657 rows 393 cols 1602 entries
Finished phase 1 with 360 SingleSign rule and 8 generalized
[2026-05-26 11:33:42] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13037323435573297600.kers
Total runtime 4 ms.
[2026-05-26 11:33:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 118/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/165 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/201 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 385/586 variables, 201/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 84/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 88/674 variables, 40/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 25/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 108/782 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/782 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/790 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/790 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 36/826 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/826 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 224/1050 variables, 152/527 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1050 variables, 175/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1050 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1050 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1050/1050 variables, and 702 constraints, problems are : Problem set: 0 solved, 3 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 284/284 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 118/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 38/165 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 36/201 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 385/586 variables, 201/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 84/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/586 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 88/674 variables, 40/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/674 variables, 25/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/674 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 108/782 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/782 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/790 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/790 variables, 3/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/790 variables, 8/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/790 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/790 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 36/826 variables, 4/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/826 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 224/1050 variables, 152/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1050 variables, 175/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1050 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1050 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1050/1050 variables, and 717 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5334 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 393/393 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6175ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 878 ms.
Support contains 9 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 70 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 71 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2026-05-26 11:33:49] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:33:49] [INFO ] Invariant cache hit.
[2026-05-26 11:33:50] [INFO ] Implicit Places using invariants in 927 ms returned []
[2026-05-26 11:33:50] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:33:50] [INFO ] Invariant cache hit.
[2026-05-26 11:33:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:33:53] [INFO ] Implicit Places using invariants and state equation in 2875 ms returned []
Implicit Place search using SMT with State Equation took 3815 ms to find 0 implicit places.
[2026-05-26 11:33:53] [INFO ] Redundant transitions in 52 ms returned []
Running 2097 sub problems to find dead transitions.
[2026-05-26 11:33:53] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:33:53] [INFO ] Invariant cache hit.
[2026-05-26 11:33:53] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/1050 variables, and 43 constraints, problems are : Problem set: 0 solved, 2097 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2097/2097 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/1050 variables, and 64 constraints, problems are : Problem set: 0 solved, 2097 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/393 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2097 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60964ms problems are : Problem set: 0 solved, 2097 unsolved
Search for dead transitions found 0 dead transitions in 60968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64920 ms. Remains : 393/393 places, 2105/2105 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1894 edges and 393 vertex of which 64 / 393 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 337 transition count 412
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 155 place count 260 transition count 395
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 197 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 415 place count 126 transition count 286
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 466 place count 126 transition count 235
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 482 place count 118 transition count 235
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 490 place count 118 transition count 227
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 500 place count 118 transition count 217
Free-agglomeration rule applied 58 times.
Iterating global reduction 4 with 58 rules applied. Total rules applied 558 place count 118 transition count 159
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 4 with 58 rules applied. Total rules applied 616 place count 60 transition count 159
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 624 place count 60 transition count 159
Applied a total of 624 rules in 64 ms. Remains 60 /393 variables (removed 333) and now considering 159/2105 (removed 1946) 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-9909630934032466185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5954612679021017535.kers'
[2026-05-26 11:34:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9909630934032466185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5954612679021017535.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 159 rows 52 cols 552 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-26 11:34:54] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5954612679021017535.kers
Total runtime 2 ms.
[2026-05-26 11:34:54] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2026-05-26 11:34:54] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-26 11:34:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2026-05-26 11:34:54] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2026-05-26 11:34:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 11:34:54] [INFO ] After 39ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-26 11:34:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2026-05-26 11:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
TRAPS : Iteration 1
[2026-05-26 11:34:54] [INFO ] After 308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-26 11:34:54] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 658 ms.
Knowledge based reduction with 7 factoid took 113 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR p0 p2), (OR p0 p2), (OR (NOT p1) p0 p2), p2, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Knowledge-based reduction took 86792 ms.
Stuttering acceptance computed with spot in 319 ms :[(OR p0 p2), (OR p0 p2), (OR (NOT p1) p0 p2), p2, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 348 ms :[(OR p0 p2), (OR p0 p2), (OR (NOT p1) p0 p2), p2, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 335 ms.
Product exploration explored 100000 steps with 0 reset in 416 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/ltsmin10495892590547512179
[2026-05-26 11:34:56] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10495892590547512179
Running compilation step : cd /tmp/ltsmin10495892590547512179;'/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/ltsmin10495892590547512179;'/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/ltsmin10495892590547512179;'/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 9 out of 656 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 656/656 places, 2368/2368 transitions.
Applied a total of 0 rules in 15 ms. Remains 656 /656 variables (removed 0) and now considering 2368/2368 (removed 0) transitions.
[2026-05-26 11:34:59] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14036996249191750931.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2053861582666814001.kers'
[2026-05-26 11:34:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14036996249191750931.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2053861582666814001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:34:59] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2053861582666814001.kers
Total runtime 5 ms.
[2026-05-26 11:35:01] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2026-05-26 11:35:01] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:35:01] [INFO ] Invariant cache hit.
[2026-05-26 11:35:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:35:08] [INFO ] Implicit Places using invariants and state equation in 6725 ms returned []
Implicit Place search using SMT with State Equation took 8134 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:35:08] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:35:08] [INFO ] Invariant cache hit.
[2026-05-26 11:35:08] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31179ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31186ms
Finished structural reductions in LTL mode , in 1 iterations and 39346 ms. Remains : 656/656 places, 2368/2368 transitions.
Built C files in :
/tmp/ltsmin13400913492618330064
[2026-05-26 11:35:39] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13400913492618330064
Running compilation step : cd /tmp/ltsmin13400913492618330064;'/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/ltsmin13400913492618330064;'/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/ltsmin13400913492618330064;'/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 11:35:42] [INFO ] Flatten gal took : 96 ms
[2026-05-26 11:35:42] [INFO ] Flatten gal took : 79 ms
[2026-05-26 11:35:42] [INFO ] Time to serialize gal into /tmp/LTL12506741878707040108.gal : 29 ms
[2026-05-26 11:35:42] [INFO ] Time to serialize properties into /tmp/LTL15297383898557959129.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/LTL12506741878707040108.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13264484198508897293.hoa' '-atoms' '/tmp/LTL15297383898557959129.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15297383898557959129.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13264484198508897293.hoa
Detected timeout of ITS tools.
[2026-05-26 11:35:57] [INFO ] Flatten gal took : 87 ms
[2026-05-26 11:35:57] [INFO ] Flatten gal took : 99 ms
[2026-05-26 11:35:57] [INFO ] Time to serialize gal into /tmp/LTL5287721501681554226.gal : 17 ms
[2026-05-26 11:35:57] [INFO ] Time to serialize properties into /tmp/LTL16414148881238324349.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/LTL5287721501681554226.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16414148881238324349.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(G((X((F("(((turn_1==1)&&(flag_1_idle==1))&&(p25_7_8==1))"))U(X("(((turn_5==1)&&(flag_5_idle==1))&&(p25_6_1==1))"))))U((!("(((turn...262
Formula 0 simplified : XF(X(G!"(((turn_1==1)&&(flag_1_idle==1))&&(p25_7_8==1))" R X!"(((turn_5==1)&&(flag_5_idle==1))&&(p25_6_1==1))") R ("(((turn_1==1)&&(...242
Detected timeout of ITS tools.
[2026-05-26 11:36:13] [INFO ] Flatten gal took : 80 ms
[2026-05-26 11:36:13] [INFO ] Applying decomposition
[2026-05-26 11:36:13] [INFO ] Flatten gal took : 80 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9518498251732737694.txt' '-o' '/tmp/graph9518498251732737694.bin' '-w' '/tmp/graph9518498251732737694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9518498251732737694.bin' '-l' '-1' '-v' '-w' '/tmp/graph9518498251732737694.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:36:13] [INFO ] Decomposing Gal with order
[2026-05-26 11:36:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:36:13] [INFO ] Removed a total of 4628 redundant transitions.
[2026-05-26 11:36:13] [INFO ] Flatten gal took : 207 ms
[2026-05-26 11:36:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 498 labels/synchronizations in 58 ms.
[2026-05-26 11:36:13] [INFO ] Time to serialize gal into /tmp/LTL3369432652815069173.gal : 18 ms
[2026-05-26 11:36:13] [INFO ] Time to serialize properties into /tmp/LTL2132186391062018858.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/LTL3369432652815069173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2132186391062018858.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...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X((F("(((i12.u3.turn_1==1)&&(i18.u113.flag_1_idle==1))&&(i22.u6.p25_7_8==1))"))U(X("(((i12.u3.turn_5==1)&&(i16.u161.flag_5_idl...354
Formula 0 simplified : XF(X(G!"(((i12.u3.turn_1==1)&&(i18.u113.flag_1_idle==1))&&(i22.u6.p25_7_8==1))" R X!"(((i12.u3.turn_5==1)&&(i16.u161.flag_5_idle==1)...334
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-03 finished in 349660 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 1 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 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 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 655 transition count 2217
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 456 transition count 2217
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 421 place count 449 transition count 2161
Iterating global reduction 2 with 7 rules applied. Total rules applied 428 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2105
Applied a total of 540 rules in 152 ms. Remains 393 /663 variables (removed 270) and now considering 2105/2424 (removed 319) transitions.
[2026-05-26 11:36:29] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9952872894929121442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8525836786244424112.kers'
[2026-05-26 11:36:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9952872894929121442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8525836786244424112.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 657 rows 393 cols 1602 entries
Finished phase 1 with 360 SingleSign rule and 8 generalized
[2026-05-26 11:36:29] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8525836786244424112.kers
Total runtime 4 ms.
[2026-05-26 11:36:30] [INFO ] Implicit Places using invariants in 918 ms returned []
[2026-05-26 11:36:30] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:36:30] [INFO ] Invariant cache hit.
[2026-05-26 11:36:30] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:36:33] [INFO ] Implicit Places using invariants and state equation in 3141 ms returned []
Implicit Place search using SMT with State Equation took 4066 ms to find 0 implicit places.
[2026-05-26 11:36:33] [INFO ] Redundant transitions in 89 ms returned []
Running 2097 sub problems to find dead transitions.
[2026-05-26 11:36:33] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:36:33] [INFO ] Invariant cache hit.
[2026-05-26 11:36:33] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
SMT process timed out in 30936ms, After SMT, problems are : Problem set: 0 solved, 2097 unsolved
Search for dead transitions found 0 dead transitions in 30943ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2105/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35265 ms. Remains : 393/663 places, 2105/2424 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 51 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 409 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-04 finished in 35772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U p2)&&X((F(G(p0))&&F(p3)))))'
Support contains 11 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 50 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2026-05-26 11:37:04] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14527585887650378435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16089859983990661370.kers'
[2026-05-26 11:37:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14527585887650378435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16089859983990661370.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:37:04] [INFO ] Computed 25 invariants in 6 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16089859983990661370.kers
Total runtime 7 ms.
[2026-05-26 11:37:06] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2026-05-26 11:37:06] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:37:06] [INFO ] Invariant cache hit.
[2026-05-26 11:37:06] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:37:12] [INFO ] Implicit Places using invariants and state equation in 6232 ms returned []
Implicit Place search using SMT with State Equation took 7661 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:37:12] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:37:12] [INFO ] Invariant cache hit.
[2026-05-26 11:37:12] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31004ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31009ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38725 ms. Remains : 656/663 places, 2368/2424 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||F(p1)) U p2)&&X((F(G(p0))&&F(p3)))))'
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (OR (NOT p3) (NOT p0)), (NOT p0), (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 394 ms.
Stack based approach found an accepted trace after 103 steps with 0 reset with depth 104 and stack size 104 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-06 finished in 39482 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 2 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 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 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 655 transition count 2217
Deduced a syphon composed of 199 places in 4 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 456 transition count 2217
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 421 place count 449 transition count 2161
Iterating global reduction 2 with 7 rules applied. Total rules applied 428 place count 449 transition count 2161
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 540 place count 393 transition count 2105
Applied a total of 540 rules in 210 ms. Remains 393 /663 variables (removed 270) and now considering 2105/2424 (removed 319) transitions.
[2026-05-26 11:37:44] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12254678338655578990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8219282883985384279.kers'
[2026-05-26 11:37:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12254678338655578990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8219282883985384279.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 657 rows 393 cols 1602 entries
Finished phase 1 with 360 SingleSign rule and 8 generalized
[2026-05-26 11:37:44] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8219282883985384279.kers
Total runtime 5 ms.
[2026-05-26 11:37:45] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2026-05-26 11:37:45] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:37:45] [INFO ] Invariant cache hit.
[2026-05-26 11:37:46] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:37:48] [INFO ] Implicit Places using invariants and state equation in 2945 ms returned []
Implicit Place search using SMT with State Equation took 4104 ms to find 0 implicit places.
[2026-05-26 11:37:48] [INFO ] Redundant transitions in 96 ms returned []
Running 2097 sub problems to find dead transitions.
[2026-05-26 11:37:48] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:37:48] [INFO ] Invariant cache hit.
[2026-05-26 11:37:48] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2097 unsolved
SMT process timed out in 31077ms, After SMT, problems are : Problem set: 0 solved, 2097 unsolved
Search for dead transitions found 0 dead transitions in 31084ms
Starting structural reductions in SI_LTL mode, iteration 1 : 393/663 places, 2105/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35513 ms. Remains : 393/663 places, 2105/2424 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 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 432 ms.
Product exploration explored 100000 steps with 0 reset in 491 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 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1698 steps, run visited all 1 properties in 27 ms. (steps per millisecond=62 )
Probabilistic random walk after 1698 steps, saw 1453 distinct states, run finished after 36 ms. (steps per millisecond=47 ) properties seen :1
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 383 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 110 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2026-05-26 11:38:21] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:38:21] [INFO ] Invariant cache hit.
[2026-05-26 11:38:22] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2026-05-26 11:38:22] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:38:22] [INFO ] Invariant cache hit.
[2026-05-26 11:38:22] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:38:25] [INFO ] Implicit Places using invariants and state equation in 2793 ms returned []
Implicit Place search using SMT with State Equation took 3900 ms to find 0 implicit places.
[2026-05-26 11:38:25] [INFO ] Redundant transitions in 89 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4112 ms. Remains : 393/393 places, 2105/2105 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 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 463 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1698 steps, run visited all 1 properties in 26 ms. (steps per millisecond=65 )
Probabilistic random walk after 1698 steps, saw 1453 distinct states, run finished after 26 ms. (steps per millisecond=65 ) properties seen :1
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 453 ms.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 443 ms.
Product exploration explored 100000 steps with 0 reset in 512 ms.
Built C files in :
/tmp/ltsmin9101333258324768132
[2026-05-26 11:38:27] [INFO ] Too many transitions (2105) to apply POR reductions. Disabling POR matrices.
[2026-05-26 11:38:27] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9101333258324768132
Running compilation step : cd /tmp/ltsmin9101333258324768132;'/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/ltsmin9101333258324768132;'/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/ltsmin9101333258324768132;'/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 393 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 70 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2026-05-26 11:38:30] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:38:30] [INFO ] Invariant cache hit.
[2026-05-26 11:38:31] [INFO ] Implicit Places using invariants in 940 ms returned []
[2026-05-26 11:38:31] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2026-05-26 11:38:31] [INFO ] Invariant cache hit.
[2026-05-26 11:38:31] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:38:34] [INFO ] Implicit Places using invariants and state equation in 2920 ms returned []
Implicit Place search using SMT with State Equation took 3865 ms to find 0 implicit places.
[2026-05-26 11:38:34] [INFO ] Redundant transitions in 90 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4032 ms. Remains : 393/393 places, 2105/2105 transitions.
Built C files in :
/tmp/ltsmin6926896261921024566
[2026-05-26 11:38:34] [INFO ] Too many transitions (2105) to apply POR reductions. Disabling POR matrices.
[2026-05-26 11:38:34] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6926896261921024566
Running compilation step : cd /tmp/ltsmin6926896261921024566;'/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/ltsmin6926896261921024566;'/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/ltsmin6926896261921024566;'/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 11:38:37] [INFO ] Flatten gal took : 74 ms
[2026-05-26 11:38:37] [INFO ] Flatten gal took : 55 ms
[2026-05-26 11:38:37] [INFO ] Time to serialize gal into /tmp/LTL14251347265653390277.gal : 9 ms
[2026-05-26 11:38:37] [INFO ] Time to serialize properties into /tmp/LTL5720353921751913097.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/LTL14251347265653390277.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12173880420607602028.hoa' '-atoms' '/tmp/LTL5720353921751913097.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/LTL5720353921751913097.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12173880420607602028.hoa
Detected timeout of ITS tools.
[2026-05-26 11:38:52] [INFO ] Flatten gal took : 53 ms
[2026-05-26 11:38:52] [INFO ] Flatten gal took : 55 ms
[2026-05-26 11:38:52] [INFO ] Time to serialize gal into /tmp/LTL3265574376876256634.gal : 9 ms
[2026-05-26 11:38:52] [INFO ] Time to serialize properties into /tmp/LTL9031174646179448722.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/LTL3265574376876256634.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9031174646179448722.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((flag_7_waiting==0)||(p33_5_7==0))"))))
Formula 0 simplified : FG!"((flag_7_waiting==0)||(p33_5_7==0))"
Detected timeout of ITS tools.
[2026-05-26 11:39:07] [INFO ] Flatten gal took : 74 ms
[2026-05-26 11:39:07] [INFO ] Applying decomposition
[2026-05-26 11:39:07] [INFO ] Flatten gal took : 63 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/graph16681242213664825484.txt' '-o' '/tmp/graph16681242213664825484.bin' '-w' '/tmp/graph16681242213664825484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16681242213664825484.bin' '-l' '-1' '-v' '-w' '/tmp/graph16681242213664825484.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:39:07] [INFO ] Decomposing Gal with order
[2026-05-26 11:39:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:39:08] [INFO ] Removed a total of 4210 redundant transitions.
[2026-05-26 11:39:08] [INFO ] Flatten gal took : 273 ms
[2026-05-26 11:39:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 575 labels/synchronizations in 97 ms.
[2026-05-26 11:39:08] [INFO ] Time to serialize gal into /tmp/LTL6452738149057134532.gal : 23 ms
[2026-05-26 11:39:08] [INFO ] Time to serialize properties into /tmp/LTL8248522191789418386.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/LTL6452738149057134532.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8248522191789418386.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i14.u56.flag_7_waiting==0)||(i6.u59.p33_5_7==0))"))))
Formula 0 simplified : FG!"((i14.u56.flag_7_waiting==0)||(i6.u59.p33_5_7==0))"
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-08 finished in 99300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X((X(X(p0))&&(p2 U (p3||G(p2)))))&&(p0 U (p1||G(p0)))))))'
Support contains 6 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 52 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
[2026-05-26 11:39:23] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11643115884230988693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16906649509501427038.kers'
[2026-05-26 11:39:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11643115884230988693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16906649509501427038.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 928 rows 657 cols 2144 entries
Finished phase 1 with 624 SingleSign rule and 8 generalized
[2026-05-26 11:39:23] [INFO ] Computed 25 invariants in 7 ms
Computed 25 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16906649509501427038.kers
Total runtime 9 ms.
[2026-05-26 11:39:25] [INFO ] Implicit Places using invariants in 1580 ms returned []
[2026-05-26 11:39:25] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:39:25] [INFO ] Invariant cache hit.
[2026-05-26 11:39:25] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:39:32] [INFO ] Implicit Places using invariants and state equation in 7551 ms returned []
Implicit Place search using SMT with State Equation took 9142 ms to find 0 implicit places.
Running 2368 sub problems to find dead transitions.
[2026-05-26 11:39:32] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:39:32] [INFO ] Invariant cache hit.
[2026-05-26 11:39:32] [INFO ] State equation strengthened by 291 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/657 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2368 unsolved
SMT process timed out in 30930ms, After SMT, problems are : Problem set: 0 solved, 2368 unsolved
Search for dead transitions found 0 dead transitions in 30937ms
Starting structural reductions in LTL mode, iteration 1 : 657/663 places, 2376/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40142 ms. Remains : 657/663 places, 2376/2424 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(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X((X(X(p0))&&(p2 U (p3||G(p2)))))&&(p0 U (p1||G(p0)))))))'
Stuttering acceptance computed with spot in 727 ms :[(AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 1382 ms.
Product exploration explored 100000 steps with 25000 reset in 1231 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 31 factoid took 323 ms. Reduced automaton from 17 states, 54 edges and 4 AP (stutter sensitive) to 17 states, 52 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 21 to 17
RANDOM walk for 40000 steps (8 resets) in 599 ms. (66 steps per ms) remains 13/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
[2026-05-26 11:40:08] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:40:08] [INFO ] Invariant cache hit.
[2026-05-26 11:40:08] [INFO ] State equation strengthened by 291 read => feed constraints.
Problem apf4 is UNSAT
Problem apf11 is UNSAT
Problem apf15 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 171/177 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 60/237 variables, 4/9 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 121/358 variables, 5/14 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 4/18 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 56/414 variables, 2/20 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 1/21 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 625/1039 variables, 414/435 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1039 variables, 127/562 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1039 variables, 0/562 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 66/1105 variables, 30/592 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 19/611 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 0/611 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 135/1240 variables, 3/614 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1240 variables, 0/614 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 6/1246 variables, 3/617 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1246 variables, 0/617 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 72/1318 variables, 3/620 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 0/620 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 267/1585 variables, 213/833 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1585 variables, 145/978 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1585 variables, 0/978 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1585/1585 variables, and 978 constraints, problems are : Problem set: 4 solved, 9 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 657/657 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 171/177 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 60/237 variables, 4/9 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 5/14 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/16 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 121/358 variables, 5/21 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 56/414 variables, 2/23 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 625/1039 variables, 414/437 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1039 variables, 127/564 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1039 variables, 1/565 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1039 variables, 0/565 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 66/1105 variables, 30/595 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1105 variables, 19/614 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1105 variables, 2/616 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1105 variables, 0/616 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 135/1240 variables, 3/619 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1240 variables, 0/619 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 6/1246 variables, 3/622 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1246 variables, 6/628 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1246/1585 variables, and 628 constraints, problems are : Problem set: 4 solved, 9 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 5/8 constraints, State Equation: 444/657 constraints, ReadFeed: 146/291 constraints, PredecessorRefiner: 9/13 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10043ms problems are : Problem set: 4 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 2376/2376 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 657 transition count 2368
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 649 transition count 2368
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 649 transition count 2171
Deduced a syphon composed of 197 places in 2 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 452 transition count 2171
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 522 place count 396 transition count 2115
Applied a total of 522 rules in 114 ms. Remains 396 /657 variables (removed 261) and now considering 2115/2376 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 396/657 places, 2115/2376 transitions.
RANDOM walk for 40000 steps (8 resets) in 501 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 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 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 159840 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :7 out of 9
Probabilistic random walk after 159840 steps, saw 97520 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :7
[2026-05-26 11:40:21] [INFO ] Flow matrix only has 667 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9801711557624480196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5666869403744208330.kers'
[2026-05-26 11:40:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9801711557624480196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5666869403744208330.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 667 rows 396 cols 1622 entries
Finished phase 1 with 363 SingleSign rule and 8 generalized
[2026-05-26 11:40:21] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5666869403744208330.kers
Total runtime 4 ms.
[2026-05-26 11:40:21] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/117 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/155 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 326/481 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 110/591 variables, 50/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 27/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 136/727 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/727 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/737 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/737 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 45/782 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/782 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 281/1063 variables, 191/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1063 variables, 203/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1063 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1063 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1063/1063 variables, and 713 constraints, problems are : Problem set: 0 solved, 2 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 396/396 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/117 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/155 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 326/481 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 110/591 variables, 50/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 27/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 136/727 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/727 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/737 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/737 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/737 variables, 11/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/737 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/737 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 45/782 variables, 5/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/782 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 281/1063 variables, 191/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1063 variables, 203/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1063 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1063 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1063/1063 variables, and 727 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4226 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 396/396 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5082ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1104 ms.
Support contains 4 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2115/2115 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 396 transition count 2114
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 395 transition count 2114
Applied a total of 2 rules in 90 ms. Remains 395 /396 variables (removed 1) and now considering 2114/2115 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 395/396 places, 2114/2115 transitions.
RANDOM walk for 40000 steps (8 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 243720 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 243720 steps, saw 141188 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2026-05-26 11:40:31] [INFO ] Flow matrix only has 666 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12153844443293151193.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7997475054541706917.kers'
[2026-05-26 11:40:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12153844443293151193.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7997475054541706917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 666 rows 395 cols 1620 entries
Finished phase 1 with 362 SingleSign rule and 8 generalized
[2026-05-26 11:40:31] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7997475054541706917.kers
Total runtime 4 ms.
[2026-05-26 11:40:31] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/117 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/155 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 326/481 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 110/591 variables, 50/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 27/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 135/726 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/726 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/736 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/736 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/736 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 45/781 variables, 5/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/781 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 280/1061 variables, 190/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/1061 variables, 203/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1061 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1061 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 716 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 395/395 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/85 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/117 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 38/155 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 326/481 variables, 155/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/481 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 110/591 variables, 50/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/591 variables, 27/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 135/726 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/726 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 10/736 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/736 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/736 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/736 variables, 6/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/736 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 45/781 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/781 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 280/1061 variables, 190/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1061 variables, 203/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1061 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1061 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 724 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2810 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 395/395 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4515ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 959 ms.
Support contains 4 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2114/2114 transitions.
Applied a total of 0 rules in 76 ms. Remains 395 /395 variables (removed 0) and now considering 2114/2114 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 395/395 places, 2114/2114 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2114/2114 transitions.
Applied a total of 0 rules in 76 ms. Remains 395 /395 variables (removed 0) and now considering 2114/2114 (removed 0) transitions.
[2026-05-26 11:40:36] [INFO ] Flow matrix only has 666 transitions (discarded 1448 similar events)
[2026-05-26 11:40:36] [INFO ] Invariant cache hit.
[2026-05-26 11:40:37] [INFO ] Implicit Places using invariants in 952 ms returned []
[2026-05-26 11:40:37] [INFO ] Flow matrix only has 666 transitions (discarded 1448 similar events)
[2026-05-26 11:40:37] [INFO ] Invariant cache hit.
[2026-05-26 11:40:38] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:40:41] [INFO ] Implicit Places using invariants and state equation in 3270 ms returned []
Implicit Place search using SMT with State Equation took 4226 ms to find 0 implicit places.
[2026-05-26 11:40:41] [INFO ] Redundant transitions in 66 ms returned []
Running 2106 sub problems to find dead transitions.
[2026-05-26 11:40:41] [INFO ] Flow matrix only has 666 transitions (discarded 1448 similar events)
[2026-05-26 11:40:41] [INFO ] Invariant cache hit.
[2026-05-26 11:40:41] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2106 unsolved
SMT process timed out in 31343ms, After SMT, problems are : Problem set: 0 solved, 2106 unsolved
Search for dead transitions found 0 dead transitions in 31350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35734 ms. Remains : 395/395 places, 2114/2114 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1955 edges and 395 vertex of which 64 / 395 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 214 transitions
Ensure Unique test removed 1407 transitions
Reduce isomorphic transitions removed 1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 339 transition count 414
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 260 transition count 414
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 159 place count 260 transition count 398
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 198 place count 237 transition count 398
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 418 place count 127 transition count 288
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 472 place count 127 transition count 234
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 486 place count 120 transition count 234
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 493 place count 120 transition count 227
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 502 place count 120 transition count 218
Free-agglomeration rule applied 55 times.
Iterating global reduction 4 with 55 rules applied. Total rules applied 557 place count 120 transition count 163
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 4 with 55 rules applied. Total rules applied 612 place count 65 transition count 163
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 619 place count 65 transition count 163
Applied a total of 619 rules in 47 ms. Remains 65 /395 variables (removed 330) and now considering 163/2114 (removed 1951) 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-17673758760967243637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4543680788400480219.kers'
[2026-05-26 11:41:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17673758760967243637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4543680788400480219.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 163 rows 58 cols 570 entries
Finished phase 1 with 44 SingleSign rule and 3 generalized
[2026-05-26 11:41:12] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4543680788400480219.kers
Total runtime 1 ms.
[2026-05-26 11:41:12] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2026-05-26 11:41:12] [INFO ] [Real]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 11:41:12] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 11:41:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2026-05-26 11:41:12] [INFO ] [Nat]Absence check using 17 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 11:41:12] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-26 11:41:12] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-26 11:41:12] [INFO ] After 26ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 11:41:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
TRAPS : Iteration 1
[2026-05-26 11:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 2
[2026-05-26 11:41:13] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 11:41:13] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 597 ms.
Found 5 invariant AP formulas.
Knowledge based reduction with 36 factoid took 582 ms. Reduced automaton from 17 states, 52 edges and 4 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 66800 ms.
Stuttering acceptance computed with spot in 272 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 4 out of 657 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 2376/2376 transitions.
Applied a total of 0 rules in 26 ms. Remains 657 /657 variables (removed 0) and now considering 2376/2376 (removed 0) transitions.
[2026-05-26 11:41:14] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12792903987294804498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16090458248066747216.kers'
[2026-05-26 11:41:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12792903987294804498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16090458248066747216.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 928 rows 657 cols 2144 entries
Finished phase 1 with 624 SingleSign rule and 8 generalized
[2026-05-26 11:41:14] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16090458248066747216.kers
Total runtime 5 ms.
[2026-05-26 11:41:15] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2026-05-26 11:41:15] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:41:15] [INFO ] Invariant cache hit.
[2026-05-26 11:41:16] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:41:21] [INFO ] Implicit Places using invariants and state equation in 6379 ms returned []
Implicit Place search using SMT with State Equation took 7535 ms to find 0 implicit places.
Running 2368 sub problems to find dead transitions.
[2026-05-26 11:41:21] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:41:21] [INFO ] Invariant cache hit.
[2026-05-26 11:41:21] [INFO ] State equation strengthened by 291 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/657 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2368 unsolved
SMT process timed out in 30903ms, After SMT, problems are : Problem set: 0 solved, 2368 unsolved
Search for dead transitions found 0 dead transitions in 30909ms
Finished structural reductions in LTL mode , in 1 iterations and 38475 ms. Remains : 657/657 places, 2376/2376 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 63 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 246 ms. (161 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
[2026-05-26 11:41:52] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:41:52] [INFO ] Invariant cache hit.
[2026-05-26 11:41:52] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/168 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 60/228 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 96/324 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 460/784 variables, 324/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 44/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 64/848 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/848 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/848 variables, 40/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/848 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 88/936 variables, 40/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 22/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/936 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 180/1116 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1116 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 8/1124 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1124 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 97/1221 variables, 4/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1221 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 364/1585 variables, 285/793 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1585 variables, 185/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1585 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/1585 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1585/1585 variables, and 978 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 657/657 constraints, ReadFeed: 291/291 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/168 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 60/228 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 96/324 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 460/784 variables, 324/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 44/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 64/848 variables, 8/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/848 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/848 variables, 40/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/848 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 88/936 variables, 40/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/936 variables, 22/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/936 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 180/1116 variables, 4/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1116 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 8/1124 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1124 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1124 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1124 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 97/1221 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7672ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 64 ms.
Support contains 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 2376/2376 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 657 transition count 2368
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 649 transition count 2368
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 16 place count 649 transition count 2171
Deduced a syphon composed of 197 places in 2 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 410 place count 452 transition count 2171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 411 place count 451 transition count 2163
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 451 transition count 2163
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 524 place count 395 transition count 2107
Applied a total of 524 rules in 121 ms. Remains 395 /657 variables (removed 262) and now considering 2107/2376 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 395/657 places, 2107/2376 transitions.
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 359091 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 1
Probabilistic random walk after 359091 steps, saw 195890 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
[2026-05-26 11:42:03] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8393826272992843247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6573285754001480430.kers'
[2026-05-26 11:42:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8393826272992843247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6573285754001480430.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 659 rows 395 cols 1606 entries
Finished phase 1 with 362 SingleSign rule and 8 generalized
[2026-05-26 11:42:03] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6573285754001480430.kers
Total runtime 4 ms.
[2026-05-26 11:42:03] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/159 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 36/195 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 331/526 variables, 195/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 44/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/590 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 40/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 88/678 variables, 40/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/678 variables, 25/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/678 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 108/786 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/786 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/794 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/794 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 36/830 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/830 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 224/1054 variables, 152/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1054 variables, 175/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1054 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1054 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1054/1054 variables, and 708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 395/395 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/159 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/195 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 331/526 variables, 195/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 44/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/590 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 40/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 88/678 variables, 40/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/678 variables, 25/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/678 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 108/786 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/786 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 8/794 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/794 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/794 variables, 5/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/794 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 36/830 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/830 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 224/1054 variables, 152/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1054 variables, 175/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1054 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1054 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1054 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1054/1054 variables, and 715 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2598 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 395/395 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3547ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 4 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2107/2107 transitions.
Applied a total of 0 rules in 114 ms. Remains 395 /395 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 395/395 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2107/2107 transitions.
Applied a total of 0 rules in 110 ms. Remains 395 /395 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2026-05-26 11:42:07] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2026-05-26 11:42:07] [INFO ] Invariant cache hit.
[2026-05-26 11:42:08] [INFO ] Implicit Places using invariants in 1152 ms returned []
[2026-05-26 11:42:08] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2026-05-26 11:42:08] [INFO ] Invariant cache hit.
[2026-05-26 11:42:09] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:42:12] [INFO ] Implicit Places using invariants and state equation in 3319 ms returned []
Implicit Place search using SMT with State Equation took 4473 ms to find 0 implicit places.
[2026-05-26 11:42:12] [INFO ] Redundant transitions in 55 ms returned []
Running 2099 sub problems to find dead transitions.
[2026-05-26 11:42:12] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2026-05-26 11:42:12] [INFO ] Invariant cache hit.
[2026-05-26 11:42:12] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2099 unsolved
SMT process timed out in 30792ms, After SMT, problems are : Problem set: 0 solved, 2099 unsolved
Search for dead transitions found 0 dead transitions in 30796ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35446 ms. Remains : 395/395 places, 2107/2107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1954 edges and 395 vertex of which 64 / 395 are part of one of the 8 SCC in 1 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 339 transition count 413
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 260 transition count 412
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 159 place count 260 transition count 395
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 201 place count 235 transition count 395
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 419 place count 126 transition count 286
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 3 with 53 rules applied. Total rules applied 472 place count 126 transition count 233
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 4 with 16 rules applied. Total rules applied 488 place count 118 transition count 233
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 496 place count 118 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 505 place count 118 transition count 216
Free-agglomeration rule applied 54 times.
Iterating global reduction 5 with 54 rules applied. Total rules applied 559 place count 118 transition count 162
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 5 with 54 rules applied. Total rules applied 613 place count 64 transition count 162
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 620 place count 64 transition count 162
Applied a total of 620 rules in 19 ms. Remains 64 /395 variables (removed 331) and now considering 162/2107 (removed 1945) 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-13787946168169869510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8133005269916227965.kers'
[2026-05-26 11:42:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13787946168169869510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8133005269916227965.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 162 rows 56 cols 557 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-26 11:42:43] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8133005269916227965.kers
Total runtime 2 ms.
[2026-05-26 11:42:43] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2026-05-26 11:42:43] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 11:42:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2026-05-26 11:42:43] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-26 11:42:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-26 11:42:43] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 11:42:43] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 11:42:43] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 237 ms.
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 50986 ms.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 914 ms.
Product exploration explored 100000 steps with 25000 reset in 633 ms.
Spot run failed in 55 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/ltsmin15865798526268745192
[2026-05-26 11:42:45] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15865798526268745192
Running compilation step : cd /tmp/ltsmin15865798526268745192;'/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/ltsmin15865798526268745192;'/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/ltsmin15865798526268745192;'/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 4 out of 657 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 657/657 places, 2376/2376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 656 transition count 2368
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 656 transition count 2368
Applied a total of 2 rules in 30 ms. Remains 656 /657 variables (removed 1) and now considering 2368/2376 (removed 8) transitions.
[2026-05-26 11:42:48] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9812439709668313583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5481861366866991208.kers'
[2026-05-26 11:42:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9812439709668313583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5481861366866991208.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:42:48] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5481861366866991208.kers
Total runtime 5 ms.
[2026-05-26 11:42:50] [INFO ] Implicit Places using invariants in 1457 ms returned []
[2026-05-26 11:42:50] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:42:50] [INFO ] Invariant cache hit.
[2026-05-26 11:42:50] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:42:56] [INFO ] Implicit Places using invariants and state equation in 5674 ms returned []
Implicit Place search using SMT with State Equation took 7133 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:42:56] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:42:56] [INFO ] Invariant cache hit.
[2026-05-26 11:42:56] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31149ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31154ms
Starting structural reductions in LTL mode, iteration 1 : 656/657 places, 2368/2376 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38322 ms. Remains : 656/657 places, 2368/2376 transitions.
Built C files in :
/tmp/ltsmin12430380892652692660
[2026-05-26 11:43:27] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12430380892652692660
Running compilation step : cd /tmp/ltsmin12430380892652692660;'/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/ltsmin12430380892652692660;'/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/ltsmin12430380892652692660;'/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 11:43:30] [INFO ] Flatten gal took : 48 ms
[2026-05-26 11:43:30] [INFO ] Flatten gal took : 49 ms
[2026-05-26 11:43:30] [INFO ] Time to serialize gal into /tmp/LTL14198709136289659694.gal : 9 ms
[2026-05-26 11:43:30] [INFO ] Time to serialize properties into /tmp/LTL12646015402740725108.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/LTL14198709136289659694.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9461134824662894047.hoa' '-atoms' '/tmp/LTL12646015402740725108.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/LTL12646015402740725108.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9461134824662894047.hoa
Detected timeout of ITS tools.
[2026-05-26 11:43:45] [INFO ] Flatten gal took : 46 ms
[2026-05-26 11:43:45] [INFO ] Flatten gal took : 63 ms
[2026-05-26 11:43:45] [INFO ] Time to serialize gal into /tmp/LTL1486410798502217582.gal : 10 ms
[2026-05-26 11:43:45] [INFO ] Time to serialize properties into /tmp/LTL11687552219520292459.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/LTL1486410798502217582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11687552219520292459.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 : !(((("(p34_5_1!=1)")U((G("(p34_5_1!=1)"))||("((p34_5_1!=1)&&(!((turn_0==1)&&(p10_2_5==1))))")))U((G(("(p34_5_1!=1)")U(("((p34_5_1!=1)&...440
Formula 0 simplified : (!"(p34_5_1!=1)" M !"((p34_5_1!=1)&&(!((turn_0==1)&&(p10_2_5==1))))") R (F(!"((p34_5_1!=1)&&(!((turn_0==1)&&(p10_2_5==1))))" & !"(p3...341
Detected timeout of ITS tools.
[2026-05-26 11:44:00] [INFO ] Flatten gal took : 47 ms
[2026-05-26 11:44:00] [INFO ] Applying decomposition
[2026-05-26 11:44:00] [INFO ] Flatten gal took : 48 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/graph3908532997453293238.txt' '-o' '/tmp/graph3908532997453293238.bin' '-w' '/tmp/graph3908532997453293238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3908532997453293238.bin' '-l' '-1' '-v' '-w' '/tmp/graph3908532997453293238.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:44:00] [INFO ] Decomposing Gal with order
[2026-05-26 11:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:44:01] [INFO ] Removed a total of 4578 redundant transitions.
[2026-05-26 11:44:01] [INFO ] Flatten gal took : 175 ms
[2026-05-26 11:44:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 574 labels/synchronizations in 73 ms.
[2026-05-26 11:44:01] [INFO ] Time to serialize gal into /tmp/LTL6104493899801274994.gal : 16 ms
[2026-05-26 11:44:01] [INFO ] Time to serialize properties into /tmp/LTL10339567437604625156.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/LTL6104493899801274994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10339567437604625156.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 : !(((("(i23.u191.p34_5_1!=1)")U((G("(i23.u191.p34_5_1!=1)"))||("((i23.u191.p34_5_1!=1)&&(!((i1.u2.turn_0==1)&&(i7.u17.p10_2_5==1))))"))...614
Formula 0 simplified : (!"(i23.u191.p34_5_1!=1)" M !"((i23.u191.p34_5_1!=1)&&(!((i1.u2.turn_0==1)&&(i7.u17.p10_2_5==1))))") R (F(!"((i23.u191.p34_5_1!=1)&&...479
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-09 finished in 292797 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)||(G(p1)&&X(p2))))'
Support contains 5 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 30 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2026-05-26 11:44:16] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:44:16] [INFO ] Invariant cache hit.
[2026-05-26 11:44:17] [INFO ] Implicit Places using invariants in 1093 ms returned []
[2026-05-26 11:44:17] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:44:17] [INFO ] Invariant cache hit.
[2026-05-26 11:44:18] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:44:23] [INFO ] Implicit Places using invariants and state equation in 5522 ms returned []
Implicit Place search using SMT with State Equation took 6619 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6650 ms. Remains : 656/663 places, 2368/2424 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)||(G(p1)&&X(p2))))'
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p1), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-10
Entered a terminal (fully accepting) state of product in 8761 steps with 0 reset in 23 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-10 finished in 6990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 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 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 16 place count 655 transition count 2217
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 414 place count 456 transition count 2217
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 420 place count 450 transition count 2169
Iterating global reduction 2 with 6 rules applied. Total rules applied 426 place count 450 transition count 2169
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2113
Applied a total of 538 rules in 132 ms. Remains 394 /663 variables (removed 269) and now considering 2113/2424 (removed 311) transitions.
[2026-05-26 11:44:23] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6845615145965307606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8951097142517552820.kers'
[2026-05-26 11:44:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6845615145965307606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8951097142517552820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 665 rows 394 cols 1618 entries
Finished phase 1 with 361 SingleSign rule and 8 generalized
[2026-05-26 11:44:23] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8951097142517552820.kers
Total runtime 6 ms.
[2026-05-26 11:44:24] [INFO ] Implicit Places using invariants in 1042 ms returned []
[2026-05-26 11:44:24] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2026-05-26 11:44:24] [INFO ] Invariant cache hit.
[2026-05-26 11:44:24] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:44:27] [INFO ] Implicit Places using invariants and state equation in 3029 ms returned []
Implicit Place search using SMT with State Equation took 4073 ms to find 0 implicit places.
[2026-05-26 11:44:27] [INFO ] Redundant transitions in 53 ms returned []
Running 2105 sub problems to find dead transitions.
[2026-05-26 11:44:27] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2026-05-26 11:44:27] [INFO ] Invariant cache hit.
[2026-05-26 11:44:27] [INFO ] State equation strengthened by 291 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1059 variables, and 45 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1059 variables, and 65 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/291 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60907ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 60911ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2113/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65183 ms. Remains : 394/663 places, 2113/2424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-11
Product exploration explored 100000 steps with 243 reset in 324 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 1 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-11 finished in 65602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U (p1 U p2))&&(X(X(!p3)) U ((!p0&&X(X(!p3)))||X(X(G(!p3))))))))))'
Support contains 11 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 656 transition count 2368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 656 transition count 2368
Applied a total of 14 rules in 30 ms. Remains 656 /663 variables (removed 7) and now considering 2368/2424 (removed 56) transitions.
[2026-05-26 11:45:29] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-919336350569536054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8737277739940366377.kers'
[2026-05-26 11:45:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-919336350569536054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8737277739940366377.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 920 rows 656 cols 2128 entries
Finished phase 1 with 623 SingleSign rule and 8 generalized
[2026-05-26 11:45:29] [INFO ] Computed 25 invariants in 7 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8737277739940366377.kers
Total runtime 8 ms.
[2026-05-26 11:45:29] [INFO ] Implicit Places using invariants in 958 ms returned []
[2026-05-26 11:45:29] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:45:29] [INFO ] Invariant cache hit.
[2026-05-26 11:45:30] [INFO ] State equation strengthened by 284 read => feed constraints.
[2026-05-26 11:45:36] [INFO ] Implicit Places using invariants and state equation in 6386 ms returned []
Implicit Place search using SMT with State Equation took 7347 ms to find 0 implicit places.
Running 2360 sub problems to find dead transitions.
[2026-05-26 11:45:36] [INFO ] Flow matrix only has 920 transitions (discarded 1448 similar events)
[2026-05-26 11:45:36] [INFO ] Invariant cache hit.
[2026-05-26 11:45:36] [INFO ] State equation strengthened by 284 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/656 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2360 unsolved
SMT process timed out in 31164ms, After SMT, problems are : Problem set: 0 solved, 2360 unsolved
Search for dead transitions found 0 dead transitions in 31173ms
Starting structural reductions in LTL mode, iteration 1 : 656/663 places, 2368/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38561 ms. Remains : 656/663 places, 2368/2424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((p0 U (p1 U p2))&&(X(X(!p3)) U ((!p0&&X(X(!p3)))||X(X(G(!p3))))))))))'
Stuttering acceptance computed with spot in 439 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), (OR (NOT p2) p3), true, (NOT p2), (NOT p2), p3, p3, p3]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-12 finished in 39110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1)&&F(p2)))))'
Support contains 7 out of 663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 663/663 places, 2424/2424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 657 transition count 2376
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 657 transition count 2376
Applied a total of 12 rules in 53 ms. Remains 657 /663 variables (removed 6) and now considering 2376/2424 (removed 48) transitions.
[2026-05-26 11:46:08] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16667826970548710076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12173742631844340280.kers'
[2026-05-26 11:46:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16667826970548710076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12173742631844340280.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 928 rows 657 cols 2144 entries
Finished phase 1 with 624 SingleSign rule and 8 generalized
[2026-05-26 11:46:08] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12173742631844340280.kers
Total runtime 5 ms.
[2026-05-26 11:46:09] [INFO ] Implicit Places using invariants in 1417 ms returned []
[2026-05-26 11:46:09] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:46:09] [INFO ] Invariant cache hit.
[2026-05-26 11:46:10] [INFO ] State equation strengthened by 291 read => feed constraints.
[2026-05-26 11:46:15] [INFO ] Implicit Places using invariants and state equation in 5688 ms returned []
Implicit Place search using SMT with State Equation took 7108 ms to find 0 implicit places.
Running 2368 sub problems to find dead transitions.
[2026-05-26 11:46:15] [INFO ] Flow matrix only has 928 transitions (discarded 1448 similar events)
[2026-05-26 11:46:15] [INFO ] Invariant cache hit.
[2026-05-26 11:46:15] [INFO ] State equation strengthened by 291 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/657 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2368 unsolved
SMT process timed out in 31253ms, After SMT, problems are : Problem set: 0 solved, 2368 unsolved
Search for dead transitions found 0 dead transitions in 31269ms
Starting structural reductions in LTL mode, iteration 1 : 657/663 places, 2376/2424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38439 ms. Remains : 657/663 places, 2376/2424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1)&&F(p2)))))'
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 281 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-14 finished in 38958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U (F(p0)&&p2)) U p3))'
Support contains 9 out of 663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 663/663 places, 2424/2424 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 663 transition count 2416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 655 transition count 2416
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 16 place count 655 transition count 2216
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 416 place count 455 transition count 2216
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 421 place count 450 transition count 2176
Iterating global reduction 2 with 5 rules applied. Total rules applied 426 place count 450 transition count 2176
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 538 place count 394 transition count 2120
Applied a total of 538 rules in 129 ms. Remains 394 /663 variables (removed 269) and now considering 2120/2424 (removed 304) transitions.
[2026-05-26 11:46:47] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11692157063898887804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9200058171472763015.kers'
[2026-05-26 11:46:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11692157063898887804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9200058171472763015.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 672 rows 394 cols 1632 entries
Finished phase 1 with 361 SingleSign rule and 8 generalized
[2026-05-26 11:46:47] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9200058171472763015.kers
Total runtime 4 ms.
[2026-05-26 11:46:48] [INFO ] Implicit Places using invariants in 988 ms returned []
[2026-05-26 11:46:48] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2026-05-26 11:46:48] [INFO ] Invariant cache hit.
[2026-05-26 11:46:48] [INFO ] State equation strengthened by 298 read => feed constraints.
[2026-05-26 11:46:51] [INFO ] Implicit Places using invariants and state equation in 3159 ms returned []
Implicit Place search using SMT with State Equation took 4149 ms to find 0 implicit places.
[2026-05-26 11:46:51] [INFO ] Redundant transitions in 53 ms returned []
Running 2112 sub problems to find dead transitions.
[2026-05-26 11:46:51] [INFO ] Flow matrix only has 672 transitions (discarded 1448 similar events)
[2026-05-26 11:46:51] [INFO ] Invariant cache hit.
[2026-05-26 11:46:51] [INFO ] State equation strengthened by 298 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1066 variables, and 44 constraints, problems are : Problem set: 0 solved, 2112 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 2112/2112 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 2112 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1066 variables, and 49 constraints, problems are : Problem set: 0 solved, 2112 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/298 constraints, PredecessorRefiner: 0/2112 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60900ms problems are : Problem set: 0 solved, 2112 unsolved
Search for dead transitions found 0 dead transitions in 60904ms
Starting structural reductions in SI_LTL mode, iteration 1 : 394/663 places, 2120/2424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65246 ms. Remains : 394/663 places, 2120/2424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)||p1) U (F(p1)&&p2)) U p3))'
Stuttering acceptance computed with spot in 175 ms :[(NOT p3), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-08-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 420 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-08-LTLFireability-15 finished in 65891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(F((p2&&(X(X(p4))||p3))))))'
Spot run failed in 59 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((F(p0) U X(p1))) U (!p0&&F(!p2))))))'
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' '!(G(F(p0)))'
Spot run failed in 54 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' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X((X(X(p0))&&(p2 U (p3||G(p2)))))&&(p0 U (p1||G(p0)))))))'
Spot run failed in 78 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 11:47:53] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9969598231242299790
[2026-05-26 11:47:53] [INFO ] Too many transitions (2424) to apply POR reductions. Disabling POR matrices.
[2026-05-26 11:47:53] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9969598231242299790
Running compilation step : cd /tmp/ltsmin9969598231242299790;'/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 11:47:53] [INFO ] Applying decomposition
[2026-05-26 11:47:53] [INFO ] Flatten gal took : 81 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/graph16207114299547037967.txt' '-o' '/tmp/graph16207114299547037967.bin' '-w' '/tmp/graph16207114299547037967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16207114299547037967.bin' '-l' '-1' '-v' '-w' '/tmp/graph16207114299547037967.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:47:53] [INFO ] Decomposing Gal with order
[2026-05-26 11:47:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:47:53] [INFO ] Removed a total of 4835 redundant transitions.
[2026-05-26 11:47:54] [INFO ] Flatten gal took : 241 ms
[2026-05-26 11:47:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 664 labels/synchronizations in 57 ms.
[2026-05-26 11:47:54] [INFO ] Time to serialize gal into /tmp/LTLFireability15322983251811927687.gal : 17 ms
[2026-05-26 11:47:54] [INFO ] Time to serialize properties into /tmp/LTLFireability5495840549605130815.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/LTLFireability15322983251811927687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5495840549605130815.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !(((("(((i17.i3.u6.turn_1==1)&&(i8.i1.u173.flag_1_active==1))&&(i8.i1.u173.p25_5_6==1))")U("((i7.i6.u172.flag_0_active==1)&&(i7.i2.u19...368
Formula 0 simplified : (!"(((i17.i3.u6.turn_1==1)&&(i8.i1.u173.flag_1_active==1))&&(i8.i1.u173.p25_5_6==1))" R !"((i7.i6.u172.flag_0_active==1)&&(i7.i2.u19...357
Compilation finished in 9267 ms.
Running link step : cd /tmp/ltsmin9969598231242299790;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin9969598231242299790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true))||X(<>(((LTLAPp2==true)&&(X(X((LTLAPp4==true)))||(LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 279 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9969598231242299790;'/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((<>((LTLAPp5==true)) U X((LTLAPp6==true)))) U (!(LTLAPp5==true)&&<>(!(LTLAPp7==true))))))' '--buchi-type=spotba'
LTSmin run took 7233 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9969598231242299790;'/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' '[](<>((LTLAPp8==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin9969598231242299790;'/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' '[](<>((LTLAPp8==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9969598231242299790;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(((LTLAPp9==true) U ([]((LTLAPp9==true))||(LTLAPp10==true))) U ([](((LTLAPp9==true) U ((LTLAPp10==true)||[]((LTLAPp9==true)))))||(X((X(X((LTLAPp9==true)))&&((LTLAPp11==true) U ((LTLAPp12==true)||[]((LTLAPp11==true))))))&&((LTLAPp9==true) U ((LTLAPp10==true)||[]((LTLAPp9==true)))))))' '--buchi-type=spotba'
LTSmin run took 380 ms.
FORMULA EisenbergMcGuire-PT-08-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9969598231242299790;'/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' '[](<>((LTLAPp8==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 12:17:13] [INFO ] Applying decomposition
[2026-05-26 12:17:17] [INFO ] Flatten gal took : 4216 ms
[2026-05-26 12:17:18] [INFO ] Decomposing Gal with order
[2026-05-26 12:17:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 12:17:20] [INFO ] Removed a total of 5037 redundant transitions.
[2026-05-26 12:17:21] [INFO ] Flatten gal took : 1986 ms
[2026-05-26 12:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 180 ms.
[2026-05-26 12:17:21] [INFO ] Time to serialize gal into /tmp/LTLFireability14472043173005559590.gal : 103 ms
[2026-05-26 12:17:21] [INFO ] Time to serialize properties into /tmp/LTLFireability5692671227664333310.ltl : 19 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/LTLFireability14472043173005559590.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5692671227664333310.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((u18.flag_7_waiting==0)||(u1.p33_5_7==0))"))))
Formula 0 simplified : FG!"((u18.flag_7_waiting==0)||(u1.p33_5_7==0))"
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-08"
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-08, 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-177955740500276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 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 ;