About the Execution of ITS-Tools for FireWire-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6380.428 | 1873180.00 | 2574246.00 | 6210.60 | TFFFFFFFFFFFTFFT | 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.r130-smll-177955809000252.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 FireWire-PT-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000252
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.3K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:08 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 153K 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 FireWire-PT-14-LTLFireability-00
FORMULA_NAME FireWire-PT-14-LTLFireability-01
FORMULA_NAME FireWire-PT-14-LTLFireability-02
FORMULA_NAME FireWire-PT-14-LTLFireability-03
FORMULA_NAME FireWire-PT-14-LTLFireability-04
FORMULA_NAME FireWire-PT-14-LTLFireability-05
FORMULA_NAME FireWire-PT-14-LTLFireability-06
FORMULA_NAME FireWire-PT-14-LTLFireability-07
FORMULA_NAME FireWire-PT-14-LTLFireability-08
FORMULA_NAME FireWire-PT-14-LTLFireability-09
FORMULA_NAME FireWire-PT-14-LTLFireability-10
FORMULA_NAME FireWire-PT-14-LTLFireability-11
FORMULA_NAME FireWire-PT-14-LTLFireability-12
FORMULA_NAME FireWire-PT-14-LTLFireability-13
FORMULA_NAME FireWire-PT-14-LTLFireability-14
FORMULA_NAME FireWire-PT-14-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779828346165
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 20:45:48] [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 20:45:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 20:45:49] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2026-05-26 20:45:49] [INFO ] Transformed 205 places.
[2026-05-26 20:45:49] [INFO ] Transformed 610 transitions.
[2026-05-26 20:45:49] [INFO ] Found NUPN structural information;
[2026-05-26 20:45:49] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 451 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
FORMULA FireWire-PT-14-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 539/539 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 200 transition count 529
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 200 transition count 529
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 200 transition count 526
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 198 transition count 520
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 198 transition count 520
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 196 transition count 516
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 196 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 195 transition count 513
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 195 transition count 513
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 195 transition count 507
Applied a total of 29 rules in 165 ms. Remains 195 /205 variables (removed 10) and now considering 507/539 (removed 32) transitions.
[2026-05-26 20:45:49] [INFO ] Flow matrix only has 475 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8818879678270698773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8141690406068536628.kers'
[2026-05-26 20:45:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8818879678270698773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8141690406068536628.kers]
Normalized transition count is 474 out of 475 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 474 rows 195 cols 1653 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-26 20:45:49] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8141690406068536628.kers
Total runtime 6 ms.
[2026-05-26 20:45:50] [INFO ] Implicit Places using invariants in 755 ms returned []
[2026-05-26 20:45:50] [INFO ] Flow matrix only has 475 transitions (discarded 32 similar events)
[2026-05-26 20:45:50] [INFO ] Invariant cache hit.
[2026-05-26 20:45:50] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-26 20:45:51] [INFO ] Implicit Places using invariants and state equation in 907 ms returned [21, 81, 140]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1734 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 192/205 places, 507/539 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1951 ms. Remains : 192/205 places, 507/539 transitions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Applied a total of 0 rules in 18 ms. Remains 192 /192 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2026-05-26 20:45:51] [INFO ] Flow matrix only has 475 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-534532561861984703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15474648854813183285.kers'
[2026-05-26 20:45:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-534532561861984703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15474648854813183285.kers]
Normalized transition count is 474 out of 475 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 474 rows 192 cols 1625 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-26 20:45:51] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15474648854813183285.kers
Total runtime 5 ms.
[2026-05-26 20:45:51] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-26 20:45:51] [INFO ] Flow matrix only has 475 transitions (discarded 32 similar events)
[2026-05-26 20:45:51] [INFO ] Invariant cache hit.
[2026-05-26 20:45:51] [INFO ] State equation strengthened by 70 read => feed constraints.
[2026-05-26 20:45:52] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Running 506 sub problems to find dead transitions.
[2026-05-26 20:45:52] [INFO ] Flow matrix only has 475 transitions (discarded 32 similar events)
[2026-05-26 20:45:52] [INFO ] Invariant cache hit.
[2026-05-26 20:45:52] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 4 (OVERLAPS) 474/666 variables, 192/207 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 69/276 constraints. Problems are: Problem set: 0 solved, 506 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/667 variables, and 276 constraints, problems are : Problem set: 0 solved, 506 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 69/70 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 506 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 4 (OVERLAPS) 474/666 variables, 192/207 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 69/276 constraints. Problems are: Problem set: 0 solved, 506 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 506/782 constraints. Problems are: Problem set: 0 solved, 506 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/667 variables, and 783 constraints, problems are : Problem set: 0 solved, 506 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 69/70 constraints, PredecessorRefiner: 506/506 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60882ms problems are : Problem set: 0 solved, 506 unsolved
Search for dead transitions found 0 dead transitions in 60919ms
Finished structural reductions in LTL mode , in 1 iterations and 61941 ms. Remains : 192/192 places, 507/507 transitions.
Support contains 40 out of 192 places after structural reductions.
[2026-05-26 20:46:53] [INFO ] Flatten gal took : 139 ms
[2026-05-26 20:46:53] [INFO ] Flatten gal took : 79 ms
[2026-05-26 20:46:54] [INFO ] Input system was already deterministic with 507 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (1134 resets) in 2368 ms. (16 steps per ms) remains 15/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (24 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (23 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (25 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (26 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (21 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (25 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
[2026-05-26 20:46:55] [INFO ] Flow matrix only has 475 transitions (discarded 32 similar events)
[2026-05-26 20:46:55] [INFO ] Invariant cache hit.
[2026-05-26 20:46:55] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 145/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 9/179 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 464/643 variables, 179/189 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 68/257 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 23/666 variables, 13/270 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 1/667 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/667 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/667 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 667/667 variables, and 274 constraints, problems are : Problem set: 0 solved, 15 unsolved in 4969 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 192/192 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 145/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 9/179 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 464/643 variables, 179/190 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 68/258 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 15/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/643 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 23/666 variables, 13/286 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/666 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/666 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/666 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 15 unsolved
SMT process timed out in 10011ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 507/507 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 192 transition count 504
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 192 transition count 501
Deduced a syphon composed of 3 places in 20 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 189 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 188 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 188 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 187 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 187 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 186 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 186 transition count 493
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 183 transition count 490
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 180 transition count 496
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 180 transition count 490
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 180 transition count 487
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 180 transition count 491
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 178 transition count 487
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 178 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 177 transition count 482
Applied a total of 49 rules in 272 ms. Remains 177 /192 variables (removed 15) and now considering 482/507 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 177/192 places, 482/507 transitions.
RANDOM walk for 40000 steps (1299 resets) in 1409 ms. (28 steps per ms) remains 13/15 properties
BEST_FIRST walk for 40001 steps (35 resets) in 317 ms. (125 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40002 steps (53 resets) in 170 ms. (233 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 304 ms. (131 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (262 resets) in 218 ms. (182 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (267 resets) in 154 ms. (258 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (380 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (388 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
[2026-05-26 20:47:06] [INFO ] Flow matrix only has 446 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8232058917221067805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14228279116547122946.kers'
[2026-05-26 20:47:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8232058917221067805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14228279116547122946.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 446 rows 177 cols 1538 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-26 20:47:06] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14228279116547122946.kers
Total runtime 3 ms.
[2026-05-26 20:47:06] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 149/159 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 437/596 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 24/620 variables, 15/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 3/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/620 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/623 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/623 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/623 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 623/623 variables, and 251 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 149/159 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 437/596 variables, 159/164 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/596 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 24/620 variables, 15/251 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/620 variables, 3/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/620 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/620 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/623 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/623 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/623 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/623 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 623/623 variables, and 262 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4892 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 177/177 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6550ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 3948 ms.
Support contains 10 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 482/482 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 175 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 175 transition count 478
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 174 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 174 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 173 transition count 473
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 173 transition count 473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 172 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 172 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 171 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 171 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 170 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 170 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 169 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 169 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 460
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 168 transition count 462
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 22 place count 167 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 167 transition count 458
Applied a total of 24 rules in 88 ms. Remains 167 /177 variables (removed 10) and now considering 458/482 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 167/177 places, 458/482 transitions.
RANDOM walk for 40000 steps (1296 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (57 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (41 resets) in 108 ms. (366 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (263 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (266 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (397 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (397 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 325610 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 6
Probabilistic random walk after 325610 steps, saw 97409 distinct states, run finished after 3010 ms. (steps per millisecond=108 ) properties seen :0
[2026-05-26 20:47:20] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6564014229082830550.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17168553142327541981.kers'
[2026-05-26 20:47:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6564014229082830550.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17168553142327541981.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 421 rows 167 cols 1453 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-26 20:47:20] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17168553142327541981.kers
Total runtime 5 ms.
[2026-05-26 20:47:20] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 139/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 412/561 variables, 149/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 62/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 24/585 variables, 15/231 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/588 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/588 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/588 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 588/588 variables, and 237 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1745 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 139/149 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 412/561 variables, 149/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 62/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 24/585 variables, 15/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 3/588 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/588 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 588/588 variables, and 243 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4990ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1800 ms.
Support contains 10 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 458/458 transitions.
Applied a total of 0 rules in 12 ms. Remains 167 /167 variables (removed 0) and now considering 458/458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 167/167 places, 458/458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 458/458 transitions.
Applied a total of 0 rules in 11 ms. Remains 167 /167 variables (removed 0) and now considering 458/458 (removed 0) transitions.
[2026-05-26 20:47:26] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2026-05-26 20:47:26] [INFO ] Invariant cache hit.
[2026-05-26 20:47:27] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-26 20:47:27] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2026-05-26 20:47:27] [INFO ] Invariant cache hit.
[2026-05-26 20:47:27] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-26 20:47:27] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2026-05-26 20:47:27] [INFO ] Redundant transitions in 32 ms returned []
Running 452 sub problems to find dead transitions.
[2026-05-26 20:47:27] [INFO ] Flow matrix only has 421 transitions (discarded 37 similar events)
[2026-05-26 20:47:27] [INFO ] Invariant cache hit.
[2026-05-26 20:47:27] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 421/588 variables, 167/183 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 62/245 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 8/253 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/588 variables, and 253 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (OVERLAPS) 421/588 variables, 167/191 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 62/253 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/588 variables, 452/705 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 588/588 variables, and 705 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60981 ms. Remains : 167/167 places, 458/458 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 135 edges and 167 vertex of which 29 / 167 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 141 transition count 313
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 141 transition count 304
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 21 place count 141 transition count 289
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 33 place count 132 transition count 286
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 132 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 132 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 131 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 131 transition count 284
Applied a total of 43 rules in 40 ms. Remains 131 /167 variables (removed 36) and now considering 284/458 (removed 174) transitions.
Running SMT prover for 6 properties.
[2026-05-26 20:48:27] [INFO ] Flow matrix only has 282 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13588008385962916516.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15368437607592974574.kers'
[2026-05-26 20:48:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13588008385962916516.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15368437607592974574.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 131 cols 1043 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-26 20:48:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15368437607592974574.kers
Total runtime 2 ms.
[2026-05-26 20:48:28] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-26 20:48:28] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-26 20:48:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-26 20:48:28] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-26 20:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2026-05-26 20:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
TRAPS : Iteration 1
[2026-05-26 20:48:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
TRAPS : Iteration 2
[2026-05-26 20:48:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
TRAPS : Iteration 3
[2026-05-26 20:48:30] [INFO ] After 2040ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-26 20:48:30] [INFO ] After 2385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 2839 ms.
FORMULA FireWire-PT-14-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 51 stabilizing places and 119 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(p1))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 191 transition count 503
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 503
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 185 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 185 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 182 transition count 488
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 182 transition count 488
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 179 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 179 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 176 transition count 473
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 176 transition count 473
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 173 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 173 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 170 transition count 458
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 170 transition count 458
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 167 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 167 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 165 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 165 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 163 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 163 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 161 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 161 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 159 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 159 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 158 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 158 transition count 431
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 155 transition count 428
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 152 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 152 transition count 428
Applied a total of 84 rules in 164 ms. Remains 152 /192 variables (removed 40) and now considering 428/507 (removed 79) transitions.
[2026-05-26 20:48:31] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7366395392927523853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6348279630212611462.kers'
[2026-05-26 20:48:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7366395392927523853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6348279630212611462.kers]
Normalized transition count is 388 out of 389 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 388 rows 152 cols 1321 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-26 20:48:31] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6348279630212611462.kers
Total runtime 3 ms.
[2026-05-26 20:48:31] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-26 20:48:31] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2026-05-26 20:48:31] [INFO ] Invariant cache hit.
[2026-05-26 20:48:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 20:48:32] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2026-05-26 20:48:32] [INFO ] Redundant transitions in 10 ms returned []
Running 421 sub problems to find dead transitions.
[2026-05-26 20:48:32] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2026-05-26 20:48:32] [INFO ] Invariant cache hit.
[2026-05-26 20:48:32] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/540 variables, 152/168 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/541 variables, and 227 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/540 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 421/648 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 649 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 152/192 places, 428/507 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61135 ms. Remains : 152/192 places, 428/507 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(p1))))'
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-00
Product exploration explored 100000 steps with 37 reset in 483 ms.
Product exploration explored 100000 steps with 7 reset in 274 ms.
Computed a total of 14 stabilizing places and 40 stable transitions
Computed a total of 14 stabilizing places and 40 stable transitions
Knowledge based reduction with 5 factoid took 67 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1299 resets) in 170 ms. (233 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
[2026-05-26 20:49:33] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2026-05-26 20:49:33] [INFO ] Invariant cache hit.
[2026-05-26 20:49:33] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 295/349 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/521 variables, 85/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/538 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/540 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/540 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 295/349 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/521 variables, 85/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/538 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/540 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/541 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1143ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 428/428 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 422
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 152 transition count 428
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 149 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 149 transition count 416
Applied a total of 24 rules in 30 ms. Remains 149 /152 variables (removed 3) and now considering 416/428 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 149/152 places, 416/428 transitions.
RANDOM walk for 40000 steps (1279 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (45 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 738359 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 738359 steps, saw 218483 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
[2026-05-26 20:49:38] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9449757902128039691.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16742321725756288821.kers'
[2026-05-26 20:49:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9449757902128039691.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16742321725756288821.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 149 cols 1297 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-26 20:49:38] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16742321725756288821.kers
Total runtime 3 ms.
[2026-05-26 20:49:38] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 290/343 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/509 variables, 83/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/526 variables, 11/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/528 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 290/343 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/509 variables, 83/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/526 variables, 11/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/528 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1202ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 15 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 149/149 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 13 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2026-05-26 20:49:39] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2026-05-26 20:49:39] [INFO ] Invariant cache hit.
[2026-05-26 20:49:39] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-26 20:49:39] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2026-05-26 20:49:39] [INFO ] Invariant cache hit.
[2026-05-26 20:49:39] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 20:49:40] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2026-05-26 20:49:40] [INFO ] Redundant transitions in 6 ms returned []
Running 410 sub problems to find dead transitions.
[2026-05-26 20:49:40] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2026-05-26 20:49:40] [INFO ] Invariant cache hit.
[2026-05-26 20:49:40] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/165 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 225 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/169 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 410/635 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/528 variables, and 635 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61127 ms. Remains : 149/149 places, 416/416 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 149 vertex of which 29 / 149 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 3 place count 123 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 123 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 122 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 122 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 121 transition count 259
Free-agglomeration rule applied 10 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 27 place count 121 transition count 243
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 40 place count 111 transition count 240
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 111 transition count 240
Applied a total of 46 rules in 46 ms. Remains 111 /149 variables (removed 38) and now considering 240/416 (removed 176) transitions.
Running SMT prover for 1 properties.
[2026-05-26 20:50:40] [INFO ] Flow matrix only has 238 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17780324718317863215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16880249457014236110.kers'
[2026-05-26 20:50:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17780324718317863215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16880249457014236110.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 111 cols 883 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-26 20:50:40] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16880249457014236110.kers
Total runtime 3 ms.
[2026-05-26 20:50:40] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-26 20:50:40] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 20:50:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-26 20:50:40] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 20:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 1
[2026-05-26 20:50:40] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 20:50:40] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 568 ms.
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 67602 ms.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 428/428 transitions.
Applied a total of 0 rules in 15 ms. Remains 152 /152 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2026-05-26 20:50:41] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12675931561681704256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12943960705649605162.kers'
[2026-05-26 20:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12675931561681704256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12943960705649605162.kers]
Normalized transition count is 388 out of 389 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 388 rows 152 cols 1321 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-26 20:50:41] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12943960705649605162.kers
Total runtime 3 ms.
[2026-05-26 20:50:41] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-26 20:50:41] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2026-05-26 20:50:41] [INFO ] Invariant cache hit.
[2026-05-26 20:50:41] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 20:50:42] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2026-05-26 20:50:42] [INFO ] Redundant transitions in 7 ms returned []
Running 421 sub problems to find dead transitions.
[2026-05-26 20:50:42] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2026-05-26 20:50:42] [INFO ] Invariant cache hit.
[2026-05-26 20:50:42] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/540 variables, 152/168 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/541 variables, and 227 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/540 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 421/648 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 649 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61134 ms. Remains : 152/152 places, 428/428 transitions.
Computed a total of 14 stabilizing places and 40 stable transitions
Computed a total of 14 stabilizing places and 40 stable transitions
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1255 resets) in 325 ms. (122 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (46 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2026-05-26 20:51:42] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2026-05-26 20:51:42] [INFO ] Invariant cache hit.
[2026-05-26 20:51:42] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 295/349 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/521 variables, 85/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/538 variables, 11/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/538 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/540 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/540 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 295/349 variables, 54/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/521 variables, 85/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/521 variables, 38/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/521 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/538 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/540 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/541 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1391ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 428/428 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 422
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 152 transition count 428
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 149 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 149 transition count 416
Applied a total of 24 rules in 21 ms. Remains 149 /152 variables (removed 3) and now considering 416/428 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 149/152 places, 416/428 transitions.
RANDOM walk for 40000 steps (1312 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (54 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 886022 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 886022 steps, saw 259900 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2026-05-26 20:51:47] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14763843623040313088.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11036381886503504245.kers'
[2026-05-26 20:51:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14763843623040313088.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11036381886503504245.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 149 cols 1297 entries
Finished phase 1 with 142 SingleSign rule and 0 generalized
[2026-05-26 20:51:47] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11036381886503504245.kers
Total runtime 4 ms.
[2026-05-26 20:51:47] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 290/343 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/509 variables, 83/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/526 variables, 11/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/528 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 290/343 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/509 variables, 83/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/509 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/526 variables, 11/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/528 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/528 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1448ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 149/149 places, 416/416 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 416/416 transitions.
Applied a total of 0 rules in 7 ms. Remains 149 /149 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2026-05-26 20:51:48] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2026-05-26 20:51:48] [INFO ] Invariant cache hit.
[2026-05-26 20:51:48] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-26 20:51:48] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2026-05-26 20:51:48] [INFO ] Invariant cache hit.
[2026-05-26 20:51:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 20:51:49] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2026-05-26 20:51:49] [INFO ] Redundant transitions in 4 ms returned []
Running 410 sub problems to find dead transitions.
[2026-05-26 20:51:49] [INFO ] Flow matrix only has 379 transitions (discarded 37 similar events)
[2026-05-26 20:51:49] [INFO ] Invariant cache hit.
[2026-05-26 20:51:49] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/165 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/221 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 225 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (OVERLAPS) 379/528 variables, 149/169 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 410/635 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/528 variables, and 635 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60743 ms. Remains : 149/149 places, 416/416 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 136 edges and 149 vertex of which 29 / 149 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 123 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 123 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 14 place count 122 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 122 transition count 260
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 121 transition count 259
Free-agglomeration rule applied 10 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 27 place count 121 transition count 243
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 40 place count 111 transition count 240
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 111 transition count 240
Applied a total of 46 rules in 34 ms. Remains 111 /149 variables (removed 38) and now considering 240/416 (removed 176) transitions.
Running SMT prover for 1 properties.
[2026-05-26 20:52:49] [INFO ] Flow matrix only has 238 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12811229386757637400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15235297941355023123.kers'
[2026-05-26 20:52:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12811229386757637400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15235297941355023123.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 238 rows 111 cols 883 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-26 20:52:49] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15235297941355023123.kers
Total runtime 2 ms.
[2026-05-26 20:52:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-26 20:52:49] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-26 20:52:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-26 20:52:49] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 20:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
TRAPS : Iteration 1
[2026-05-26 20:52:50] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-26 20:52:50] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 747 ms.
Knowledge based reduction with 5 factoid took 99 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 67996 ms.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 162 ms.
Product exploration explored 100000 steps with 6 reset in 266 ms.
Built C files in :
/tmp/ltsmin337098182112860888
[2026-05-26 20:52:51] [INFO ] Computing symmetric may disable matrix : 428 transitions.
[2026-05-26 20:52:51] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 20:52:51] [INFO ] Computing symmetric may enable matrix : 428 transitions.
[2026-05-26 20:52:51] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 20:52:51] [INFO ] Computing Do-Not-Accords matrix : 428 transitions.
[2026-05-26 20:52:51] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 20:52:51] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin337098182112860888
Running compilation step : cd /tmp/ltsmin337098182112860888;'/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'
Compilation finished in 2459 ms.
Running link step : cd /tmp/ltsmin337098182112860888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 183 ms.
Running LTSmin : cd /tmp/ltsmin337098182112860888;'/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' '--hoa' '/tmp/stateBased305588063937317513.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 428/428 transitions.
Applied a total of 0 rules in 9 ms. Remains 152 /152 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2026-05-26 20:53:06] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5891098080052055827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11117817032297834667.kers'
[2026-05-26 20:53:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5891098080052055827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11117817032297834667.kers]
Normalized transition count is 388 out of 389 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 388 rows 152 cols 1321 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-26 20:53:06] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11117817032297834667.kers
Total runtime 3 ms.
[2026-05-26 20:53:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-26 20:53:06] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2026-05-26 20:53:06] [INFO ] Invariant cache hit.
[2026-05-26 20:53:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 20:53:06] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2026-05-26 20:53:06] [INFO ] Redundant transitions in 4 ms returned []
Running 421 sub problems to find dead transitions.
[2026-05-26 20:53:06] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2026-05-26 20:53:06] [INFO ] Invariant cache hit.
[2026-05-26 20:53:06] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/540 variables, 152/168 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/224 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/541 variables, and 227 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/540 variables, 152/171 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 421/648 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/541 variables, and 649 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 152/152 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60810 ms. Remains : 152/152 places, 428/428 transitions.
Built C files in :
/tmp/ltsmin729721941375309507
[2026-05-26 20:54:07] [INFO ] Computing symmetric may disable matrix : 428 transitions.
[2026-05-26 20:54:07] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 20:54:07] [INFO ] Computing symmetric may enable matrix : 428 transitions.
[2026-05-26 20:54:07] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 20:54:07] [INFO ] Computing Do-Not-Accords matrix : 428 transitions.
[2026-05-26 20:54:07] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 20:54:07] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin729721941375309507
Running compilation step : cd /tmp/ltsmin729721941375309507;'/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'
Compilation finished in 1600 ms.
Running link step : cd /tmp/ltsmin729721941375309507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin729721941375309507;'/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' '--hoa' '/tmp/stateBased17934123593687046850.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 20:54:22] [INFO ] Flatten gal took : 35 ms
[2026-05-26 20:54:22] [INFO ] Flatten gal took : 34 ms
[2026-05-26 20:54:22] [INFO ] Time to serialize gal into /tmp/LTL6040490759235330204.gal : 6 ms
[2026-05-26 20:54:22] [INFO ] Time to serialize properties into /tmp/LTL6451396473413933599.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/LTL6040490759235330204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7400006644271731407.hoa' '-atoms' '/tmp/LTL6451396473413933599.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/LTL6451396473413933599.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7400006644271731407.hoa
Detected timeout of ITS tools.
[2026-05-26 20:54:37] [INFO ] Flatten gal took : 26 ms
[2026-05-26 20:54:37] [INFO ] Flatten gal took : 25 ms
[2026-05-26 20:54:37] [INFO ] Time to serialize gal into /tmp/LTL4920564036339142412.gal : 5 ms
[2026-05-26 20:54:37] [INFO ] Time to serialize properties into /tmp/LTL12591394468961454268.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4920564036339142412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12591394468961454268.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((p9!=1)||(p99!=1))"))&&(F("((p10!=1)||(p115!=1))")))))
Formula 0 simplified : F(G!"((p9!=1)||(p99!=1))" | G!"((p10!=1)||(p115!=1))")
Detected timeout of ITS tools.
[2026-05-26 20:54:52] [INFO ] Flatten gal took : 24 ms
[2026-05-26 20:54:52] [INFO ] Applying decomposition
[2026-05-26 20:54:52] [INFO ] Flatten gal took : 28 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/graph1780871387824091207.txt' '-o' '/tmp/graph1780871387824091207.bin' '-w' '/tmp/graph1780871387824091207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1780871387824091207.bin' '-l' '-1' '-v' '-w' '/tmp/graph1780871387824091207.weights' '-q' '0' '-e' '0.001'
[2026-05-26 20:54:52] [INFO ] Decomposing Gal with order
[2026-05-26 20:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 20:54:52] [INFO ] Removed a total of 632 redundant transitions.
[2026-05-26 20:54:53] [INFO ] Flatten gal took : 136 ms
[2026-05-26 20:54:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 21 ms.
[2026-05-26 20:54:53] [INFO ] Time to serialize gal into /tmp/LTL13204748231157739845.gal : 8 ms
[2026-05-26 20:54:53] [INFO ] Time to serialize properties into /tmp/LTL7797485918178395924.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/LTL13204748231157739845.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7797485918178395924.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i3.u3.p9!=1)||(i3.u3.p99!=1))"))&&(F("((i3.u3.p10!=1)||(i7.u33.p115!=1))")))))
Formula 0 simplified : F(G!"((i3.u3.p9!=1)||(i3.u3.p99!=1))" | G!"((i3.u3.p10!=1)||(i7.u33.p115!=1))")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-14-LTLFireability-00 finished in 396908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 492
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 485
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 477
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 477
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 470
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 470
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 462
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 462
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 455
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 455
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 166 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 166 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 165 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 165 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 164 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 164 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 163 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 163 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 162 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 162 transition count 435
Applied a total of 60 rules in 27 ms. Remains 162 /192 variables (removed 30) and now considering 435/507 (removed 72) transitions.
[2026-05-26 20:55:08] [INFO ] Flow matrix only has 403 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11499631415329612882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10462426105409064272.kers'
[2026-05-26 20:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11499631415329612882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10462426105409064272.kers]
Normalized transition count is 402 out of 403 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 402 rows 162 cols 1364 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-26 20:55:08] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10462426105409064272.kers
Total runtime 6 ms.
[2026-05-26 20:55:08] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-26 20:55:08] [INFO ] Flow matrix only has 403 transitions (discarded 32 similar events)
[2026-05-26 20:55:08] [INFO ] Invariant cache hit.
[2026-05-26 20:55:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 20:55:09] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2026-05-26 20:55:09] [INFO ] Flow matrix only has 403 transitions (discarded 32 similar events)
[2026-05-26 20:55:09] [INFO ] Invariant cache hit.
[2026-05-26 20:55:09] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 4 (OVERLAPS) 402/564 variables, 162/176 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 434 unsolved
SMT process timed out in 30193ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 30195ms
Starting structural reductions in LTL mode, iteration 1 : 162/192 places, 435/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31047 ms. Remains : 162/192 places, 435/507 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1))&&F((!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-01 finished in 31400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X((p0||(G(p1) U p2)))))))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 502
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 497
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 492
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 487
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 487
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 176 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 176 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 174 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 174 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 173 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 173 transition count 462
Applied a total of 38 rules in 33 ms. Remains 173 /192 variables (removed 19) and now considering 462/507 (removed 45) transitions.
[2026-05-26 20:55:39] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5411867263587842593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16890375251886372118.kers'
[2026-05-26 20:55:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5411867263587842593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16890375251886372118.kers]
Normalized transition count is 429 out of 430 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 429 rows 173 cols 1459 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-26 20:55:39] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16890375251886372118.kers
Total runtime 2 ms.
[2026-05-26 20:55:39] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-26 20:55:39] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2026-05-26 20:55:39] [INFO ] Invariant cache hit.
[2026-05-26 20:55:40] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-26 20:55:40] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-26 20:55:40] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2026-05-26 20:55:40] [INFO ] Invariant cache hit.
[2026-05-26 20:55:40] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/602 variables, 173/187 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 62/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 602/603 variables, and 249 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 173/173 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/602 variables, 173/187 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/602 variables, 62/249 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 461/710 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 602/603 variables, and 711 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 173/173 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in LTL mode, iteration 1 : 173/192 places, 462/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61148 ms. Remains : 173/192 places, 462/507 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(X(X((p0||(G(p1) U p2)))))||p0))))'
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-02 finished in 61532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(G(p1)||(X(X(p2))&&F(p3))))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 503
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 497
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 493
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 493
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 487
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 487
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 176 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 176 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 174 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 174 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 173 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 173 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 172 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 172 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 171 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 171 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 170 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 170 transition count 455
Applied a total of 44 rules in 36 ms. Remains 170 /192 variables (removed 22) and now considering 455/507 (removed 52) transitions.
[2026-05-26 20:56:41] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2471594969064684221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-596365412635897107.kers'
[2026-05-26 20:56:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2471594969064684221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-596365412635897107.kers]
Normalized transition count is 422 out of 423 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 422 rows 170 cols 1436 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-26 20:56:41] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-596365412635897107.kers
Total runtime 4 ms.
[2026-05-26 20:56:41] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-26 20:56:41] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
[2026-05-26 20:56:41] [INFO ] Invariant cache hit.
[2026-05-26 20:56:41] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-26 20:56:41] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Running 454 sub problems to find dead transitions.
[2026-05-26 20:56:41] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
[2026-05-26 20:56:41] [INFO ] Invariant cache hit.
[2026-05-26 20:56:41] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 422/592 variables, 170/185 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 61/246 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/593 variables, and 246 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 454 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 4 (OVERLAPS) 422/592 variables, 170/185 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 61/246 constraints. Problems are: Problem set: 0 solved, 454 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 454/700 constraints. Problems are: Problem set: 0 solved, 454 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/593 variables, and 701 constraints, problems are : Problem set: 0 solved, 454 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 454/454 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 454 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Starting structural reductions in LTL mode, iteration 1 : 170/192 places, 455/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61134 ms. Remains : 170/192 places, 455/507 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(G(p1)||(X(X(p2))&&F(p3))))))'
Stuttering acceptance computed with spot in 529 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-03
Product exploration explored 100000 steps with 4 reset in 135 ms.
Product exploration explored 100000 steps with 3 reset in 126 ms.
Computed a total of 29 stabilizing places and 67 stable transitions
Computed a total of 29 stabilizing places and 67 stable transitions
Knowledge based reduction with 13 factoid took 134 ms. Reduced automaton from 11 states, 21 edges and 4 AP (stutter sensitive) to 9 states, 15 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (1156 resets) in 808 ms. (49 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (228 resets) in 131 ms. (303 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (15 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
[2026-05-26 20:57:43] [INFO ] Flow matrix only has 423 transitions (discarded 32 similar events)
[2026-05-26 20:57:43] [INFO ] Invariant cache hit.
[2026-05-26 20:57:43] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/155 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/565 variables, 155/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 58/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/592 variables, 15/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/593 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/593 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 593/593 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 170/170 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 54/593 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/170 constraints, ReadFeed: 0/62 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 317ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 14 factoid took 48 ms. Proved property starting from automaton with 9 states, 15 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 1014 ms.
FORMULA FireWire-PT-14-LTLFireability-03 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-03 finished in 62998 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((X(X(p0))||(G((p1 U p2)) U p1)))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 492
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 485
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 477
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 477
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 470
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 470
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 462
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 462
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 455
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 455
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 165 transition count 442
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 165 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 163 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 163 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 162 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 162 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 161 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 161 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 160 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 160 transition count 431
Applied a total of 64 rules in 26 ms. Remains 160 /192 variables (removed 32) and now considering 431/507 (removed 76) transitions.
[2026-05-26 20:57:44] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2059696788100880860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7220105241173793620.kers'
[2026-05-26 20:57:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2059696788100880860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7220105241173793620.kers]
Normalized transition count is 398 out of 399 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 160 cols 1348 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 20:57:44] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7220105241173793620.kers
Total runtime 2 ms.
[2026-05-26 20:57:44] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-26 20:57:44] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 20:57:44] [INFO ] Invariant cache hit.
[2026-05-26 20:57:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 20:57:44] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2026-05-26 20:57:44] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 20:57:44] [INFO ] Invariant cache hit.
[2026-05-26 20:57:44] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/558 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/559 variables, and 232 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 57/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/558 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 430/662 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/559 variables, and 662 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 57/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60249ms
Starting structural reductions in LTL mode, iteration 1 : 160/192 places, 431/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61043 ms. Remains : 160/192 places, 431/507 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((X(X(p0))||(G((p1 U p2)) U p1)))))'
Stuttering acceptance computed with spot in 769 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Running random walk in product with property : FireWire-PT-14-LTLFireability-04
Product exploration explored 100000 steps with 25105 reset in 672 ms.
Product exploration explored 100000 steps with 25031 reset in 407 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge based reduction with 14 factoid took 252 ms. Reduced automaton from 14 states, 66 edges and 3 AP (stutter sensitive) to 14 states, 66 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (1196 resets) in 312 ms. (127 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (302 resets) in 364 ms. (109 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (306 resets) in 372 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (301 resets) in 255 ms. (156 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (254 resets) in 66 ms. (597 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (329 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (309 resets) in 56 ms. (701 steps per ms) remains 5/5 properties
[2026-05-26 20:58:47] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 20:58:47] [INFO ] Invariant cache hit.
[2026-05-26 20:58:47] [INFO ] State equation strengthened by 58 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
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/96 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/146 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 387/533 variables, 146/153 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 55/208 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/558 variables, 14/222 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 2/224 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/559 variables, 1/225 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 225 constraints, problems are : Problem set: 1 solved, 4 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 90/96 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/146 variables, 4/7 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 387/533 variables, 146/154 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 55/209 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 25/558 variables, 14/224 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 2/226 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 3/229 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/559 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/559 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 230 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2110ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4336 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 431/431 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 428
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 160 transition count 425
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 157 transition count 425
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 154 transition count 422
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 152 transition count 426
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 152 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 152 transition count 420
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 152 transition count 465
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 41 place count 148 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 64 place count 148 transition count 434
Applied a total of 64 rules in 33 ms. Remains 148 /160 variables (removed 12) and now considering 434/431 (removed -3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 148/160 places, 434/431 transitions.
RANDOM walk for 40000 steps (1189 resets) in 183 ms. (217 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (381 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (376 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
[2026-05-26 20:58:54] [INFO ] Flow matrix only has 398 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1465535562438969347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13513772893154594112.kers'
[2026-05-26 20:58:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1465535562438969347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13513772893154594112.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 148 cols 1398 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-26 20:58:54] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13513772893154594112.kers
Total runtime 2 ms.
[2026-05-26 20:58:54] [INFO ] State equation strengthened by 63 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/140 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 393/533 variables, 140/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 61/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/546 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/546 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/140 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 393/533 variables, 140/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 61/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 13/546 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/546 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1486ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 556 ms.
Support contains 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 148/148 places, 434/434 transitions.
RANDOM walk for 40000 steps (1256 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (379 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (388 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 102112 steps, run visited all 2 properties in 851 ms. (steps per millisecond=119 )
Probabilistic random walk after 102112 steps, saw 32865 distinct states, run finished after 857 ms. (steps per millisecond=119 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge based reduction with 15 factoid took 1117 ms. Reduced automaton from 14 states, 66 edges and 3 AP (stutter sensitive) to 13 states, 46 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 538 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Knowledge-based reduction took 12023 ms.
Stuttering acceptance computed with spot in 638 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 431/431 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2026-05-26 20:58:59] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17694252560634335427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15981796912465346859.kers'
[2026-05-26 20:58:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17694252560634335427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15981796912465346859.kers]
Normalized transition count is 398 out of 399 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 160 cols 1348 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 20:58:59] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15981796912465346859.kers
Total runtime 3 ms.
[2026-05-26 20:58:59] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-26 20:58:59] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 20:58:59] [INFO ] Invariant cache hit.
[2026-05-26 20:59:00] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 20:59:00] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 160/160 places, 431/431 transitions.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge based reduction with 13 factoid took 1555 ms. Reduced automaton from 13 states, 46 edges and 3 AP (stutter sensitive) to 13 states, 46 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (1138 resets) in 374 ms. (106 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40002 steps (311 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (308 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (255 resets) in 76 ms. (519 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (311 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (300 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
[2026-05-26 20:59:02] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 20:59:02] [INFO ] Invariant cache hit.
[2026-05-26 20:59:02] [INFO ] State equation strengthened by 58 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) 90/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/146 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 387/533 variables, 146/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 55/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 25/558 variables, 14/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/559 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 225 constraints, problems are : Problem set: 0 solved, 4 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 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) 90/96 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/146 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 387/533 variables, 146/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 55/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 25/558 variables, 14/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/559 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/559 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1910 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2408ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1719 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 431/431 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 428
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 160 transition count 425
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 157 transition count 425
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 154 transition count 422
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 152 transition count 426
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 152 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 152 transition count 420
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 152 transition count 465
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 41 place count 148 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 64 place count 148 transition count 434
Applied a total of 64 rules in 38 ms. Remains 148 /160 variables (removed 12) and now considering 434/431 (removed -3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 148/160 places, 434/431 transitions.
RANDOM walk for 40000 steps (1248 resets) in 197 ms. (202 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (361 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (392 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
[2026-05-26 20:59:06] [INFO ] Flow matrix only has 398 transitions (discarded 36 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10803994185809148189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13275949979145740484.kers'
[2026-05-26 20:59:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10803994185809148189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13275949979145740484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 148 cols 1398 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-26 20:59:06] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13275949979145740484.kers
Total runtime 2 ms.
[2026-05-26 20:59:06] [INFO ] State equation strengthened by 63 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/140 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 393/533 variables, 140/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 61/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 13/546 variables, 8/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/546 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/140 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 393/533 variables, 140/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 61/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 13/546 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/546 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/546 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 221 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1659 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1948ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 434/434 transitions.
Applied a total of 0 rules in 11 ms. Remains 148 /148 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 148/148 places, 434/434 transitions.
RANDOM walk for 40000 steps (1291 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (392 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (391 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 102112 steps, run visited all 2 properties in 649 ms. (steps per millisecond=157 )
Probabilistic random walk after 102112 steps, saw 32865 distinct states, run finished after 649 ms. (steps per millisecond=157 ) properties seen :2
Knowledge based reduction with 13 factoid took 1454 ms. Reduced automaton from 13 states, 46 edges and 3 AP (stutter sensitive) to 13 states, 46 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 587 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Knowledge-based reduction took 10967 ms.
Stuttering acceptance computed with spot in 644 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 653 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 25028 reset in 209 ms.
Product exploration explored 100000 steps with 25104 reset in 315 ms.
Spot run failed in 156 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/ltsmin9310228886250180121
[2026-05-26 20:59:13] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9310228886250180121
Running compilation step : cd /tmp/ltsmin9310228886250180121;'/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'
Compilation finished in 1257 ms.
Running link step : cd /tmp/ltsmin9310228886250180121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9310228886250180121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14634914913032131290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 431/431 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2026-05-26 20:59:28] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1881315965877481726.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4524563425167365263.kers'
[2026-05-26 20:59:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1881315965877481726.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4524563425167365263.kers]
Normalized transition count is 398 out of 399 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 160 cols 1348 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 20:59:28] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4524563425167365263.kers
Total runtime 4 ms.
[2026-05-26 20:59:28] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-26 20:59:28] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 20:59:28] [INFO ] Invariant cache hit.
[2026-05-26 20:59:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 20:59:29] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 160/160 places, 431/431 transitions.
Built C files in :
/tmp/ltsmin2621056288065604823
[2026-05-26 20:59:29] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2621056288065604823
Running compilation step : cd /tmp/ltsmin2621056288065604823;'/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'
Compilation finished in 1031 ms.
Running link step : cd /tmp/ltsmin2621056288065604823;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2621056288065604823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14349661929547015112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 20:59:44] [INFO ] Flatten gal took : 21 ms
[2026-05-26 20:59:44] [INFO ] Flatten gal took : 19 ms
[2026-05-26 20:59:44] [INFO ] Time to serialize gal into /tmp/LTL3728567242313587534.gal : 5 ms
[2026-05-26 20:59:44] [INFO ] Time to serialize properties into /tmp/LTL4923014138577033528.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/LTL3728567242313587534.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7449097061120718700.hoa' '-atoms' '/tmp/LTL4923014138577033528.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/LTL4923014138577033528.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7449097061120718700.hoa
Detected timeout of ITS tools.
[2026-05-26 20:59:59] [INFO ] Flatten gal took : 27 ms
[2026-05-26 20:59:59] [INFO ] Flatten gal took : 26 ms
[2026-05-26 20:59:59] [INFO ] Time to serialize gal into /tmp/LTL17257402450488920840.gal : 7 ms
[2026-05-26 20:59:59] [INFO ] Time to serialize properties into /tmp/LTL6149283553444233219.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/LTL17257402450488920840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6149283553444233219.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((X(X("((p10==0)||(p44==0))")))||((G(("((p81==1)&&(p123==1))")U("((p8==1)&&(p76==1))")))U("((p81==1)&&(p123==1))"))))))
Formula 0 simplified : GF(XX!"((p10==0)||(p44==0))" & (F(!"((p81==1)&&(p123==1))" R !"((p8==1)&&(p76==1))") R !"((p81==1)&&(p123==1))"))
Detected timeout of ITS tools.
[2026-05-26 21:00:14] [INFO ] Flatten gal took : 30 ms
[2026-05-26 21:00:14] [INFO ] Applying decomposition
[2026-05-26 21:00:14] [INFO ] Flatten gal took : 12 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/graph6212079556073077591.txt' '-o' '/tmp/graph6212079556073077591.bin' '-w' '/tmp/graph6212079556073077591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6212079556073077591.bin' '-l' '-1' '-v' '-w' '/tmp/graph6212079556073077591.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:00:14] [INFO ] Decomposing Gal with order
[2026-05-26 21:00:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:00:14] [INFO ] Removed a total of 708 redundant transitions.
[2026-05-26 21:00:14] [INFO ] Flatten gal took : 62 ms
[2026-05-26 21:00:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 22 ms.
[2026-05-26 21:00:14] [INFO ] Time to serialize gal into /tmp/LTL11477424580569667160.gal : 10 ms
[2026-05-26 21:00:14] [INFO ] Time to serialize properties into /tmp/LTL2612626458646720182.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/LTL11477424580569667160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2612626458646720182.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G((X(X("((i0.u3.p10==0)||(i1.u15.p44==0))")))||((G(("((i5.i0.u24.p81==1)&&(i5.i1.u39.p123==1))")U("((i0.u2.p8==1)&&(i2.u22.p76==1...212
Formula 0 simplified : GF(XX!"((i0.u3.p10==0)||(i1.u15.p44==0))" & (F(!"((i5.i0.u24.p81==1)&&(i5.i1.u39.p123==1))" R !"((i0.u2.p8==1)&&(i2.u22.p76==1))") R...202
Detected timeout of ITS tools.
Treatment of property FireWire-PT-14-LTLFireability-04 finished in 165718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 191 transition count 503
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 503
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 185 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 185 transition count 496
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 183 transition count 491
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 183 transition count 491
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 181 transition count 486
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 181 transition count 486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 179 transition count 481
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 179 transition count 481
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 177 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 177 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 175 transition count 471
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 175 transition count 471
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 173 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 173 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 171 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 171 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 169 transition count 457
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 169 transition count 457
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 167 transition count 452
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 167 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 166 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 166 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 165 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 165 transition count 448
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 164 transition count 446
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 164 transition count 446
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 161 transition count 443
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 158 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 158 transition count 443
Applied a total of 72 rules in 66 ms. Remains 158 /192 variables (removed 34) and now considering 443/507 (removed 64) transitions.
[2026-05-26 21:00:29] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4557168124722687929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6150699011311718186.kers'
[2026-05-26 21:00:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4557168124722687929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6150699011311718186.kers]
Normalized transition count is 403 out of 404 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 158 cols 1375 entries
Finished phase 1 with 151 SingleSign rule and 0 generalized
[2026-05-26 21:00:29] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-6150699011311718186.kers
Total runtime 14 ms.
[2026-05-26 21:00:30] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-26 21:00:30] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2026-05-26 21:00:30] [INFO ] Invariant cache hit.
[2026-05-26 21:00:30] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 21:00:30] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2026-05-26 21:00:30] [INFO ] Redundant transitions in 5 ms returned []
Running 436 sub problems to find dead transitions.
[2026-05-26 21:00:30] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
[2026-05-26 21:00:30] [INFO ] Invariant cache hit.
[2026-05-26 21:00:30] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 403/561 variables, 158/175 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 59/234 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/562 variables, and 236 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 403/561 variables, 158/177 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 59/236 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 436/672 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/562 variables, and 674 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60224ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in SI_LTL mode, iteration 1 : 158/192 places, 443/507 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60976 ms. Remains : 158/192 places, 443/507 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 42 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-14-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-06 finished in 61051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 8 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 191 transition count 503
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 503
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 186 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 186 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 184 transition count 493
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 184 transition count 493
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 182 transition count 488
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 182 transition count 488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 180 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 180 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 178 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 178 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 176 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 176 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 174 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 174 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 172 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 172 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 171 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 171 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 170 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 170 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 169 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 169 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 168 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 168 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 167 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 167 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 164 transition count 449
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 161 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 161 transition count 449
Applied a total of 66 rules in 78 ms. Remains 161 /192 variables (removed 31) and now considering 449/507 (removed 58) transitions.
[2026-05-26 21:01:30] [INFO ] Flow matrix only has 410 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1918401244618947311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5046825506049237505.kers'
[2026-05-26 21:01:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1918401244618947311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5046825506049237505.kers]
Normalized transition count is 409 out of 410 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 409 rows 161 cols 1399 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-26 21:01:30] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5046825506049237505.kers
Total runtime 4 ms.
[2026-05-26 21:01:31] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-26 21:01:31] [INFO ] Flow matrix only has 410 transitions (discarded 39 similar events)
[2026-05-26 21:01:31] [INFO ] Invariant cache hit.
[2026-05-26 21:01:31] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 21:01:31] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2026-05-26 21:01:31] [INFO ] Redundant transitions in 7 ms returned []
Running 442 sub problems to find dead transitions.
[2026-05-26 21:01:31] [INFO ] Flow matrix only has 410 transitions (discarded 39 similar events)
[2026-05-26 21:01:31] [INFO ] Invariant cache hit.
[2026-05-26 21:01:31] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 409/570 variables, 161/178 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 59/237 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/571 variables, and 239 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 442 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (OVERLAPS) 409/570 variables, 161/180 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/570 variables, 59/239 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/570 variables, 442/681 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/570 variables, 2/683 constraints. Problems are: Problem set: 0 solved, 442 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/571 variables, and 683 constraints, problems are : Problem set: 0 solved, 442 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 442 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Starting structural reductions in SI_LTL mode, iteration 1 : 161/192 places, 449/507 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61158 ms. Remains : 161/192 places, 449/507 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 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-07 finished in 61348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&X(p1)&&(!p1 U (p2||G(!p1))))))))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 492
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 485
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 477
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 477
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 470
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 470
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 462
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 462
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 455
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 455
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 165 transition count 442
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 165 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 163 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 163 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 162 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 162 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 161 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 161 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 160 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 160 transition count 431
Applied a total of 64 rules in 31 ms. Remains 160 /192 variables (removed 32) and now considering 431/507 (removed 76) transitions.
[2026-05-26 21:02:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14778539964616447005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4023783392735586966.kers'
[2026-05-26 21:02:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14778539964616447005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4023783392735586966.kers]
Normalized transition count is 398 out of 399 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 160 cols 1348 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 21:02:32] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4023783392735586966.kers
Total runtime 2 ms.
[2026-05-26 21:02:32] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-26 21:02:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 21:02:32] [INFO ] Invariant cache hit.
[2026-05-26 21:02:32] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 21:02:32] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2026-05-26 21:02:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 21:02:32] [INFO ] Invariant cache hit.
[2026-05-26 21:02:32] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/558 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 430 unsolved
SMT process timed out in 30231ms, After SMT, problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 30234ms
Starting structural reductions in LTL mode, iteration 1 : 160/192 places, 431/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30964 ms. Remains : 160/192 places, 431/507 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&X(p1)&&(!p1 U (p2||G(!p1))))))))'
Stuttering acceptance computed with spot in 231 ms :[true, p0, p0, (AND p0 (NOT p1)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-09
Product exploration explored 100000 steps with 4 reset in 298 ms.
Product exploration explored 100000 steps with 1 reset in 348 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge based reduction with 16 factoid took 80 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 36751 steps (1070 resets) in 217 ms. (168 steps per ms) remains 0/9 properties
Knowledge based reduction with 16 factoid took 216 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, p0, p0, (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Knowledge-based reduction took 587 ms.
Stuttering acceptance computed with spot in 181 ms :[true, p0, p0, (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 431/431 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2026-05-26 21:03:04] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 21:03:04] [INFO ] Invariant cache hit.
[2026-05-26 21:03:05] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-26 21:03:05] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 21:03:05] [INFO ] Invariant cache hit.
[2026-05-26 21:03:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 21:03:05] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 160/160 places, 431/431 transitions.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge based reduction with 16 factoid took 67 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1167 resets) in 205 ms. (194 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (245 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (301 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (239 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (247 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (310 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
[2026-05-26 21:03:06] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 21:03:06] [INFO ] Invariant cache hit.
[2026-05-26 21:03:06] [INFO ] State equation strengthened by 58 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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) 89/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/145 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 386/531 variables, 145/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 54/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 27/558 variables, 15/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/559 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/559 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 225 constraints, problems are : Problem set: 0 solved, 5 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 5/4 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) 89/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/145 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 386/531 variables, 145/153 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 54/207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 27/558 variables, 15/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/559 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/559 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 231 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3859ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 208 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 431/431 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 428
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 160 transition count 425
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 157 transition count 425
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 154 transition count 422
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 151 transition count 428
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 151 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 151 transition count 419
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 151 transition count 425
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 42 place count 148 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 48 place count 148 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 147 transition count 412
Applied a total of 49 rules in 62 ms. Remains 147 /160 variables (removed 13) and now considering 412/431 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 147/160 places, 412/431 transitions.
RANDOM walk for 40000 steps (1319 resets) in 235 ms. (169 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (386 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (405 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2026-05-26 21:03:10] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3868911903461187789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-825587085563938318.kers'
[2026-05-26 21:03:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3868911903461187789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-825587085563938318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 375 rows 147 cols 1281 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-26 21:03:10] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-825587085563938318.kers
Total runtime 4 ms.
[2026-05-26 21:03:10] [INFO ] State equation strengthened by 56 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 326/416 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/511 variables, 49/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/521 variables, 7/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/522 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 210 constraints, problems are : Problem set: 0 solved, 2 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 84/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 326/416 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/511 variables, 49/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/521 variables, 7/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/521 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/521 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/522 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/522 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1488ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 147/147 places, 412/412 transitions.
RANDOM walk for 39017 steps (1212 resets) in 168 ms. (230 steps per ms) remains 0/2 properties
Knowledge based reduction with 16 factoid took 175 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, p0, p0, (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Knowledge-based reduction took 6480 ms.
Stuttering acceptance computed with spot in 174 ms :[true, p0, p0, (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 209 ms :[true, p0, p0, (AND p0 (NOT p1)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 20 reset in 261 ms.
Product exploration explored 100000 steps with 4 reset in 347 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/ltsmin670107637498816552
[2026-05-26 21:03:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin670107637498816552
Running compilation step : cd /tmp/ltsmin670107637498816552;'/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'
Compilation finished in 1050 ms.
Running link step : cd /tmp/ltsmin670107637498816552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin670107637498816552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2844753442471320975.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 431/431 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2026-05-26 21:03:28] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-740339537275537540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17259790239841875134.kers'
[2026-05-26 21:03:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-740339537275537540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17259790239841875134.kers]
Normalized transition count is 398 out of 399 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 160 cols 1348 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 21:03:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17259790239841875134.kers
Total runtime 2 ms.
[2026-05-26 21:03:28] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-26 21:03:28] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 21:03:28] [INFO ] Invariant cache hit.
[2026-05-26 21:03:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 21:03:28] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 160/160 places, 431/431 transitions.
Built C files in :
/tmp/ltsmin6677109802371540570
[2026-05-26 21:03:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6677109802371540570
Running compilation step : cd /tmp/ltsmin6677109802371540570;'/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'
Compilation finished in 1179 ms.
Running link step : cd /tmp/ltsmin6677109802371540570;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6677109802371540570;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7185081770281791207.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 21:03:43] [INFO ] Flatten gal took : 22 ms
[2026-05-26 21:03:43] [INFO ] Flatten gal took : 21 ms
[2026-05-26 21:03:43] [INFO ] Time to serialize gal into /tmp/LTL4972068044442997294.gal : 5 ms
[2026-05-26 21:03:44] [INFO ] Time to serialize properties into /tmp/LTL3383584140933862595.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/LTL4972068044442997294.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10871787558410262628.hoa' '-atoms' '/tmp/LTL3383584140933862595.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3383584140933862595.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10871787558410262628.hoa
Detected timeout of ITS tools.
[2026-05-26 21:03:59] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:03:59] [INFO ] Flatten gal took : 15 ms
[2026-05-26 21:03:59] [INFO ] Time to serialize gal into /tmp/LTL3207448792276554570.gal : 8 ms
[2026-05-26 21:03:59] [INFO ] Time to serialize properties into /tmp/LTL7900190109869247965.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/LTL3207448792276554570.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7900190109869247965.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((!("((p3==1)&&(p87==1))"))U((G(!("((p3==1)&&(p87==1))")))||(((!("((p3==1)&&(p87==1))"))&&(X("((p10==1)&&(p108==1))")))&&((!("((p1...271
Formula 0 simplified : X((X!"((p10==1)&&(p108==1))" | ("((p10==1)&&(p108==1))" M !"((!((p10==1)&&(p108==1)))&&(!((p8==1)&&(p50==1))))")) U "((p3==1)&&(p87=...161
Detected timeout of ITS tools.
[2026-05-26 21:04:14] [INFO ] Flatten gal took : 17 ms
[2026-05-26 21:04:14] [INFO ] Applying decomposition
[2026-05-26 21:04:14] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4352374019382548423.txt' '-o' '/tmp/graph4352374019382548423.bin' '-w' '/tmp/graph4352374019382548423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4352374019382548423.bin' '-l' '-1' '-v' '-w' '/tmp/graph4352374019382548423.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:04:14] [INFO ] Decomposing Gal with order
[2026-05-26 21:04:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:04:14] [INFO ] Removed a total of 708 redundant transitions.
[2026-05-26 21:04:14] [INFO ] Flatten gal took : 47 ms
[2026-05-26 21:04:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 29 ms.
[2026-05-26 21:04:14] [INFO ] Time to serialize gal into /tmp/LTL7455770003672068306.gal : 7 ms
[2026-05-26 21:04:14] [INFO ] Time to serialize properties into /tmp/LTL10974295824653199922.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/LTL7455770003672068306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10974295824653199922.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((!("((i0.i0.u0.p3==1)&&(i4.u34.p87==1))"))U((G(!("((i0.i0.u0.p3==1)&&(i4.u34.p87==1))")))||(((!("((i0.i0.u0.p3==1)&&(i4.u34.p87==...387
Formula 0 simplified : X((X!"((i1.u3.p10==1)&&(i4.u33.p108==1))" | ("((i1.u3.p10==1)&&(i4.u33.p108==1))" M !"((!((i1.u3.p10==1)&&(i4.u33.p108==1)))&&(!((i1...232
Detected timeout of ITS tools.
Treatment of property FireWire-PT-14-LTLFireability-09 finished in 117340 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 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 191 transition count 503
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 188 transition count 503
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 185 transition count 496
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 185 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 182 transition count 488
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 182 transition count 488
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 179 transition count 481
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 179 transition count 481
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 176 transition count 473
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 176 transition count 473
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 173 transition count 466
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 173 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 170 transition count 458
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 170 transition count 458
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 167 transition count 451
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 167 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 165 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 165 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 163 transition count 442
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 163 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 162 transition count 439
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 162 transition count 439
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 161 transition count 437
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 161 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 160 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 160 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 159 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 159 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 156 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 153 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 153 transition count 430
Applied a total of 82 rules in 70 ms. Remains 153 /192 variables (removed 39) and now considering 430/507 (removed 77) transitions.
[2026-05-26 21:04:29] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6770813065337969934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4263102991648884602.kers'
[2026-05-26 21:04:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6770813065337969934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4263102991648884602.kers]
Normalized transition count is 390 out of 391 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 390 rows 153 cols 1329 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-26 21:04:29] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4263102991648884602.kers
Total runtime 4 ms.
[2026-05-26 21:04:29] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-26 21:04:29] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2026-05-26 21:04:29] [INFO ] Invariant cache hit.
[2026-05-26 21:04:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-26 21:04:30] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2026-05-26 21:04:30] [INFO ] Redundant transitions in 4 ms returned []
Running 423 sub problems to find dead transitions.
[2026-05-26 21:04:30] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2026-05-26 21:04:30] [INFO ] Invariant cache hit.
[2026-05-26 21:04:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 390/543 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/544 variables, and 229 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (OVERLAPS) 390/543 variables, 153/173 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 56/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 423/652 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/543 variables, 2/654 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/544 variables, and 654 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/192 places, 430/507 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61034 ms. Remains : 153/192 places, 430/507 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 : FireWire-PT-14-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-10 finished in 61131 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(((p1||X(X(p2)))&&p0))) U (p2 U p3)))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 190 transition count 502
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 190 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 188 transition count 497
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 186 transition count 492
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 186 transition count 492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 184 transition count 487
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 184 transition count 487
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 182 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 182 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 180 transition count 477
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 178 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 178 transition count 472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 177 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 177 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 176 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 176 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 175 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 175 transition count 466
Applied a total of 34 rules in 31 ms. Remains 175 /192 variables (removed 17) and now considering 466/507 (removed 41) transitions.
[2026-05-26 21:05:30] [INFO ] Flow matrix only has 434 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1037375283945307345.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4849157164502852601.kers'
[2026-05-26 21:05:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1037375283945307345.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4849157164502852601.kers]
Normalized transition count is 433 out of 434 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 433 rows 175 cols 1475 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-26 21:05:30] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4849157164502852601.kers
Total runtime 4 ms.
[2026-05-26 21:05:31] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-26 21:05:31] [INFO ] Flow matrix only has 434 transitions (discarded 32 similar events)
[2026-05-26 21:05:31] [INFO ] Invariant cache hit.
[2026-05-26 21:05:31] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-26 21:05:31] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2026-05-26 21:05:31] [INFO ] Flow matrix only has 434 transitions (discarded 32 similar events)
[2026-05-26 21:05:31] [INFO ] Invariant cache hit.
[2026-05-26 21:05:31] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (OVERLAPS) 433/608 variables, 175/190 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 62/252 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/609 variables, and 252 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 175/175 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (OVERLAPS) 433/608 variables, 175/190 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 62/252 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 465/717 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/609 variables, and 718 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 175/175 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60325ms
Starting structural reductions in LTL mode, iteration 1 : 175/192 places, 466/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61448 ms. Remains : 175/192 places, 466/507 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(X(p1))||p2)&&p0))) U (p1 U p3)))'
Stuttering acceptance computed with spot in 575 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND p0 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1) p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-11 finished in 62087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||G(p1)) U X((!p2||X(p3)))))'
Support contains 7 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 187 transition count 495
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 187 transition count 495
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 185 transition count 490
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 185 transition count 490
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 183 transition count 485
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 181 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 181 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 179 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 179 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 177 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 177 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 175 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 175 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 174 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 174 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 173 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 173 transition count 461
Applied a total of 38 rules in 33 ms. Remains 173 /192 variables (removed 19) and now considering 461/507 (removed 46) transitions.
[2026-05-26 21:06:32] [INFO ] Flow matrix only has 429 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16749592747722004120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1144191584382054783.kers'
[2026-05-26 21:06:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16749592747722004120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1144191584382054783.kers]
Normalized transition count is 428 out of 429 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 428 rows 173 cols 1460 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-26 21:06:32] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1144191584382054783.kers
Total runtime 4 ms.
[2026-05-26 21:06:33] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-26 21:06:33] [INFO ] Flow matrix only has 429 transitions (discarded 32 similar events)
[2026-05-26 21:06:33] [INFO ] Invariant cache hit.
[2026-05-26 21:06:33] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-26 21:06:33] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-26 21:06:33] [INFO ] Flow matrix only has 429 transitions (discarded 32 similar events)
[2026-05-26 21:06:33] [INFO ] Invariant cache hit.
[2026-05-26 21:06:33] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 428/601 variables, 173/188 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 61/249 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/602 variables, and 249 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 173/173 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 428/601 variables, 173/188 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/601 variables, 61/249 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 460/709 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/602 variables, and 709 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 173/173 constraints, ReadFeed: 61/62 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in LTL mode, iteration 1 : 173/192 places, 461/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61371 ms. Remains : 173/192 places, 461/507 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||G(p1)) U X((!p2||X(p3)))))'
Stuttering acceptance computed with spot in 431 ms :[(AND p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Computed a total of 32 stabilizing places and 73 stable transitions
Computed a total of 32 stabilizing places and 73 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 18 factoid took 16 ms. Proved property starting from automaton with 11 states, 21 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA FireWire-PT-14-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-12 finished in 62350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(G(p1))))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 507/507 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 189 transition count 500
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 186 transition count 492
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 183 transition count 485
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 180 transition count 477
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 180 transition count 477
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 177 transition count 470
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 177 transition count 470
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 174 transition count 462
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 174 transition count 462
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 171 transition count 455
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 171 transition count 455
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 168 transition count 448
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 168 transition count 448
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 165 transition count 442
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 165 transition count 442
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 163 transition count 437
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 163 transition count 437
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 162 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 162 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 161 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 161 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 160 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 160 transition count 431
Applied a total of 64 rules in 36 ms. Remains 160 /192 variables (removed 32) and now considering 431/507 (removed 76) transitions.
[2026-05-26 21:07:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3922503452396052572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12606067803907413421.kers'
[2026-05-26 21:07:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3922503452396052572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12606067803907413421.kers]
Normalized transition count is 398 out of 399 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 160 cols 1348 entries
Finished phase 1 with 153 SingleSign rule and 0 generalized
[2026-05-26 21:07:35] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-12606067803907413421.kers
Total runtime 14 ms.
[2026-05-26 21:07:35] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-26 21:07:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 21:07:35] [INFO ] Invariant cache hit.
[2026-05-26 21:07:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 21:07:35] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2026-05-26 21:07:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2026-05-26 21:07:35] [INFO ] Invariant cache hit.
[2026-05-26 21:07:35] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/558 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/232 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 430 unsolved
SMT process timed out in 30208ms, After SMT, problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 30209ms
Starting structural reductions in LTL mode, iteration 1 : 160/192 places, 431/507 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31071 ms. Remains : 160/192 places, 431/507 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(X(G(p1))))))'
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-13 finished in 31299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Spot run failed in 57 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(p0))||(G((p1 U p2)) U p1)))))'
Spot run failed in 52 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&X(p1)&&(!p1 U (p2||G(!p1))))))))'
Spot run failed in 52 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 21:08:06] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8625303214869211133
[2026-05-26 21:08:06] [INFO ] Computing symmetric may disable matrix : 507 transitions.
[2026-05-26 21:08:06] [INFO ] Applying decomposition
[2026-05-26 21:08:06] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 21:08:06] [INFO ] Computing symmetric may enable matrix : 507 transitions.
[2026-05-26 21:08:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 21:08:06] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:08:06] [INFO ] Computing Do-Not-Accords matrix : 507 transitions.
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/graph5600807541849402395.txt' '-o' '/tmp/graph5600807541849402395.bin' '-w' '/tmp/graph5600807541849402395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5600807541849402395.bin' '-l' '-1' '-v' '-w' '/tmp/graph5600807541849402395.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:08:06] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 21:08:06] [INFO ] Decomposing Gal with order
[2026-05-26 21:08:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:08:06] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8625303214869211133
Running compilation step : cd /tmp/ltsmin8625303214869211133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 21:08:06] [INFO ] Removed a total of 838 redundant transitions.
[2026-05-26 21:08:06] [INFO ] Flatten gal took : 51 ms
[2026-05-26 21:08:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 17 ms.
[2026-05-26 21:08:06] [INFO ] Time to serialize gal into /tmp/LTLFireability16646690261802780332.gal : 8 ms
[2026-05-26 21:08:06] [INFO ] Time to serialize properties into /tmp/LTLFireability7523066117155331505.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/LTLFireability16646690261802780332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7523066117155331505.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G((F("((i0.i0.u3.p9!=1)||(i0.u34.p99!=1))"))&&(F("((i0.i0.u3.p10!=1)||(i5.i1.u26.p115!=1))")))))
Formula 0 simplified : F(G!"((i0.i0.u3.p9!=1)||(i0.u34.p99!=1))" | G!"((i0.i0.u3.p10!=1)||(i5.i1.u26.p115!=1))")
Compilation finished in 2084 ms.
Running link step : cd /tmp/ltsmin8625303214869211133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin8625303214869211133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t47, t50, t51, t53, t59, t61, t66, t71, t75, t76, t81, t85, t89, t96, t99, t101, t138, t139, ...1434
Computing Next relation with stutter on 3.3322e+06 deadlock states
4 unique states visited
0 strongly connected components in search stack
6 transitions explored
3 items max in DFS search stack
17906 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,179.148,2210692,1,0,1.43633e+06,5507,3081,2.24995e+07,251,36379,1304999
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FireWire-PT-14-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G((X(X("((i0.i0.u3.p10==0)||(i1.u16.p44==0))")))||((G(("((i5.i1.u26.p81==1)&&(i5.i0.u41.p123==1))")U("((i0.i0.u2.p8==1)&&(i2.u18....218
Formula 1 simplified : GF(XX!"((i0.i0.u3.p10==0)||(i1.u16.p44==0))" & (F(!"((i5.i1.u26.p81==1)&&(i5.i0.u41.p123==1))" R !"((i0.i0.u2.p8==1)&&(i2.u18.p76==1...208
Computing Next relation with stutter on 3.3322e+06 deadlock states
25 unique states visited
15 strongly connected components in search stack
27 transitions explored
20 items max in DFS search stack
9586 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,275.018,2433828,1,0,1.43633e+06,5507,3031,2.57245e+07,254,36379,1918785
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FireWire-PT-14-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((!("((i6.i0.u0.p3==1)&&(i4.u28.p87==1))"))U((G(!("((i6.i0.u0.p3==1)&&(i4.u28.p87==1))")))||(((!("((i6.i0.u0.p3==1)&&(i4.u28.p87==...399
Formula 2 simplified : X((X!"((i0.i0.u3.p10==1)&&(i4.u37.p108==1))" | ("((i0.i0.u3.p10==1)&&(i4.u37.p108==1))" M !"((!((i0.i0.u3.p10==1)&&(i4.u37.p108==1))...241
Computing Next relation with stutter on 3.3322e+06 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin8625303214869211133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8625303214869211133;'/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((!(LTLAPp5==true) U ([](!(LTLAPp5==true))||(!(LTLAPp5==true)&&X((LTLAPp6==true))&&(!(LTLAPp6==true) U ((LTLAPp7==true)||[](!(LTLAPp6==true))))))))' '--buchi-type=spotba'
LTSmin run took 129943 ms.
FORMULA FireWire-PT-14-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1870706 ms.
BK_STOP 1779830219345
--------------------
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="FireWire-PT-14"
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 FireWire-PT-14, 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 r130-smll-177955809000252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 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 ;