About the Execution of ITS-Tools for FireWire-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10336.632 | 3600000.00 | 5585108.00 | 12645.90 | FFFTFFFFF?FF?FFF | 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-177955809000284.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-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000284
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.9K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 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 168K 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-18-LTLFireability-00
FORMULA_NAME FireWire-PT-18-LTLFireability-01
FORMULA_NAME FireWire-PT-18-LTLFireability-02
FORMULA_NAME FireWire-PT-18-LTLFireability-03
FORMULA_NAME FireWire-PT-18-LTLFireability-04
FORMULA_NAME FireWire-PT-18-LTLFireability-05
FORMULA_NAME FireWire-PT-18-LTLFireability-06
FORMULA_NAME FireWire-PT-18-LTLFireability-07
FORMULA_NAME FireWire-PT-18-LTLFireability-08
FORMULA_NAME FireWire-PT-18-LTLFireability-09
FORMULA_NAME FireWire-PT-18-LTLFireability-10
FORMULA_NAME FireWire-PT-18-LTLFireability-11
FORMULA_NAME FireWire-PT-18-LTLFireability-12
FORMULA_NAME FireWire-PT-18-LTLFireability-13
FORMULA_NAME FireWire-PT-18-LTLFireability-14
FORMULA_NAME FireWire-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779843189388
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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 00:53:11] [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-27 00:53:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 00:53:12] [INFO ] Load time of PNML (sax parser for PT used): 222 ms
[2026-05-27 00:53:12] [INFO ] Transformed 437 places.
[2026-05-27 00:53:12] [INFO ] Transformed 707 transitions.
[2026-05-27 00:53:12] [INFO ] Found NUPN structural information;
[2026-05-27 00:53:12] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FireWire-PT-18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 427 transition count 707
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 107 place count 330 transition count 610
Iterating global reduction 1 with 97 rules applied. Total rules applied 204 place count 330 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 205 place count 330 transition count 609
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 223 place count 312 transition count 566
Iterating global reduction 2 with 18 rules applied. Total rules applied 241 place count 312 transition count 566
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 246 place count 307 transition count 560
Iterating global reduction 2 with 5 rules applied. Total rules applied 251 place count 307 transition count 560
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 253 place count 307 transition count 558
Applied a total of 253 rules in 193 ms. Remains 307 /437 variables (removed 130) and now considering 558/707 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11298245419004571440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17763988091116723347.kers'
[2026-05-27 00:53:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11298245419004571440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17763988091116723347.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 558 rows 307 cols 1776 entries
Finished phase 1 with 300 SingleSign rule and 0 generalized
[2026-05-27 00:53:13] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17763988091116723347.kers
Total runtime 7 ms.
[2026-05-27 00:53:13] [INFO ] Implicit Places using invariants in 822 ms returned []
[2026-05-27 00:53:13] [INFO ] Invariant cache hit.
[2026-05-27 00:53:14] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
Running 557 sub problems to find dead transitions.
[2026-05-27 00:53:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/865 variables, and 18 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/865 variables, and 23 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 0/557 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60716ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60758ms
Starting structural reductions in LTL mode, iteration 1 : 307/437 places, 558/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62780 ms. Remains : 307/437 places, 558/707 transitions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Applied a total of 0 rules in 10 ms. Remains 307 /307 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2026-05-27 00:54:15] [INFO ] Invariant cache hit.
[2026-05-27 00:54:16] [INFO ] Implicit Places using invariants in 445 ms returned []
[2026-05-27 00:54:16] [INFO ] Invariant cache hit.
[2026-05-27 00:54:16] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1042 ms. Remains : 307/307 places, 558/558 transitions.
Support contains 48 out of 307 places after structural reductions.
[2026-05-27 00:54:17] [INFO ] Flatten gal took : 149 ms
[2026-05-27 00:54:17] [INFO ] Flatten gal took : 83 ms
[2026-05-27 00:54:17] [INFO ] Input system was already deterministic with 558 transitions.
Support contains 45 out of 307 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (18 resets) in 2330 ms. (17 steps per ms) remains 29/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (10 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (11 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (10 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
[2026-05-27 00:54:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 230/269 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 16/285 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 537/822 variables, 285/292 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 2/294 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 0/294 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 19/841 variables, 10/304 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 2/306 constraints. Problems are: Problem set: 1 solved, 28 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 841/865 variables, and 306 constraints, problems are : Problem set: 1 solved, 28 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/307 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 231/269 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 16/285 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 537/822 variables, 285/298 constraints. Problems are: Problem set: 1 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 26/324 constraints. Problems are: Problem set: 1 solved, 28 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/865 variables, and 324 constraints, problems are : Problem set: 1 solved, 28 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 285/307 constraints, PredecessorRefiner: 26/29 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10051ms problems are : Problem set: 1 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 307 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 307/307 places, 558/558 transitions.
Graph (trivial) has 179 edges and 307 vertex of which 11 / 307 are part of one of the 3 SCC in 12 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 299 transition count 514
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 268 transition count 510
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 266 transition count 508
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 264 transition count 508
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 73 place count 264 transition count 485
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 119 place count 241 transition count 485
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 120 place count 240 transition count 484
Iterating global reduction 4 with 1 rules applied. Total rules applied 121 place count 240 transition count 484
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 121 place count 240 transition count 483
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 123 place count 239 transition count 483
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 124 place count 238 transition count 482
Iterating global reduction 4 with 1 rules applied. Total rules applied 125 place count 238 transition count 482
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 237 transition count 480
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 237 transition count 480
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 171 place count 215 transition count 458
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 217 place count 192 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 192 transition count 546
Free-agglomeration rule applied 15 times.
Iterating global reduction 4 with 15 rules applied. Total rules applied 234 place count 192 transition count 531
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 253 place count 177 transition count 527
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 256 place count 174 transition count 524
Iterating global reduction 5 with 3 rules applied. Total rules applied 259 place count 174 transition count 524
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 269 place count 174 transition count 514
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 275 place count 174 transition count 508
Applied a total of 275 rules in 313 ms. Remains 174 /307 variables (removed 133) and now considering 508/558 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 174/307 places, 508/558 transitions.
RANDOM walk for 40000 steps (1695 resets) in 1205 ms. (33 steps per ms) remains 18/28 properties
BEST_FIRST walk for 4004 steps (40 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (38 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 24 ms. (160 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4003 steps (47 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (41 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (36 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4003 steps (36 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
[2026-05-27 00:54:29] [INFO ] Flow matrix only has 495 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6913265500112122667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13455482779649807079.kers'
[2026-05-27 00:54:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6913265500112122667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13455482779649807079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 495 rows 174 cols 1799 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-27 00:54:29] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13455482779649807079.kers
Total runtime 3 ms.
[2026-05-27 00:54:29] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 138/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 7/166 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 492/658 variables, 166/173 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 43/216 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 11/669 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/669 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 224 constraints, problems are : Problem set: 0 solved, 14 unsolved in 1198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 138/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 7/166 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 492/658 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 13/234 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 11/669 variables, 8/242 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/669 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 243 constraints, problems are : Problem set: 0 solved, 14 unsolved in 10568 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 174/174 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11795ms problems are : Problem set: 0 solved, 14 unsolved
Parikh walk visited 0 properties in 30125 ms.
Support contains 21 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 508/508 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 174 transition count 505
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 172 transition count 505
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 172 transition count 503
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 170 transition count 503
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 169 transition count 461
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 169 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 169 transition count 460
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 24 place count 163 transition count 454
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 162 transition count 453
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 162 transition count 453
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 38 place count 156 transition count 470
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 156 transition count 469
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 155 transition count 463
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 155 transition count 463
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 49 place count 155 transition count 455
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 155 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 53 place count 153 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 58 place count 153 transition count 448
Applied a total of 58 rules in 70 ms. Remains 153 /174 variables (removed 21) and now considering 448/508 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 153/174 places, 448/508 transitions.
RANDOM walk for 40000 steps (1782 resets) in 953 ms. (41 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (427 resets) in 158 ms. (251 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (437 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (424 resets) in 139 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (138 resets) in 136 ms. (291 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (427 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (434 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (412 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (126 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (429 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (439 resets) in 73 ms. (540 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (428 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (427 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
[2026-05-27 00:55:12] [INFO ] Flow matrix only has 439 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9446700249570361531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13065408540504852076.kers'
[2026-05-27 00:55:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9446700249570361531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13065408540504852076.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 439 rows 153 cols 1638 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-27 00:55:12] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13065408540504852076.kers
Total runtime 3 ms.
[2026-05-27 00:55:12] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 118/133 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/145 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 439/584 variables, 145/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 41/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/584 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 8/592 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/592 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/592 variables, and 201 constraints, problems are : Problem set: 0 solved, 10 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 118/133 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/145 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 439/584 variables, 145/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/584 variables, 41/197 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/584 variables, 10/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 8/592 variables, 8/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/592 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/592 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 592/592 variables, and 215 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4317 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5097ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 13512 ms.
Support contains 15 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 448/448 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 153 transition count 446
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 151 transition count 446
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 151 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 149 transition count 395
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 149 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 149 transition count 394
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 148 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 148 transition count 392
Applied a total of 17 rules in 35 ms. Remains 148 /153 variables (removed 5) and now considering 392/448 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 148/153 places, 392/448 transitions.
RANDOM walk for 40000 steps (1934 resets) in 279 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (477 resets) in 93 ms. (425 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (182 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (491 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (498 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (492 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (167 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (482 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (479 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (492 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (466 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 290619 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 10
Probabilistic random walk after 290619 steps, saw 89591 distinct states, run finished after 3010 ms. (steps per millisecond=96 ) properties seen :0
[2026-05-27 00:55:34] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12212795267514430608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-172748474979394665.kers'
[2026-05-27 00:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12212795267514430608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-172748474979394665.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 386 rows 148 cols 1446 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-27 00:55:34] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-172748474979394665.kers
Total runtime 2 ms.
[2026-05-27 00:55:34] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 114/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/140 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 386/526 variables, 140/147 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 37/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 8/534 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/534 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 192 constraints, problems are : Problem set: 0 solved, 10 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 114/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/140 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 386/526 variables, 140/151 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 37/188 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 8/534 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/534 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/534 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 207 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4838ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 9423 ms.
Support contains 15 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 392/392 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 148/148 places, 392/392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 392/392 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 392/392 (removed 0) transitions.
[2026-05-27 00:55:48] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
[2026-05-27 00:55:48] [INFO ] Invariant cache hit.
[2026-05-27 00:55:48] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-27 00:55:48] [INFO ] Flow matrix only has 386 transitions (discarded 6 similar events)
[2026-05-27 00:55:48] [INFO ] Invariant cache hit.
[2026-05-27 00:55:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-27 00:55:49] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
[2026-05-27 00:55:49] [INFO ] Redundant transitions in 76 ms returned [366, 369]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 386 sub problems to find dead transitions.
[2026-05-27 00:55:49] [INFO ] Flow matrix only has 384 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10795669552390758633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9749940961345865404.kers'
[2026-05-27 00:55:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10795669552390758633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9749940961345865404.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 384 rows 148 cols 1438 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-27 00:55:49] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9749940961345865404.kers
Total runtime 3 ms.
[2026-05-27 00:55:49] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 384/532 variables, 148/167 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 37/204 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (OVERLAPS) 384/532 variables, 148/167 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 37/204 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 386/590 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 590 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60332ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 148/148 places, 390/392 transitions.
Applied a total of 0 rules in 7 ms. Remains 148 /148 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61250 ms. Remains : 148/148 places, 390/392 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 89 stabilizing places and 142 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Graph (trivial) has 220 edges and 307 vertex of which 11 / 307 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 298 transition count 511
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 79 place count 261 transition count 507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 259 transition count 507
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 81 place count 259 transition count 481
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 133 place count 233 transition count 481
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 144 place count 222 transition count 426
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 222 transition count 426
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 222 transition count 424
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 157 place count 222 transition count 421
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 163 place count 219 transition count 421
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 167 place count 215 transition count 415
Iterating global reduction 4 with 4 rules applied. Total rules applied 171 place count 215 transition count 415
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 173 place count 213 transition count 411
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 213 transition count 411
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 176 place count 212 transition count 408
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 212 transition count 408
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 178 place count 211 transition count 406
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 211 transition count 406
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 180 place count 210 transition count 403
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 210 transition count 403
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 182 place count 209 transition count 401
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 209 transition count 401
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 184 place count 208 transition count 398
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 208 transition count 398
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 186 place count 207 transition count 396
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 207 transition count 396
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 188 place count 206 transition count 393
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 206 transition count 393
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 205 transition count 391
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 205 transition count 391
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 204 transition count 388
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 204 transition count 388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 203 transition count 386
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 203 transition count 386
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 202 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 202 transition count 384
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 201 transition count 382
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 201 transition count 382
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 245 place count 178 transition count 359
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 177 transition count 357
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 177 transition count 357
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 307 place count 147 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 309 place count 147 transition count 419
Applied a total of 309 rules in 133 ms. Remains 147 /307 variables (removed 160) and now considering 419/558 (removed 139) transitions.
[2026-05-27 00:56:50] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8098111145710308119.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11673468925396138431.kers'
[2026-05-27 00:56:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8098111145710308119.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11673468925396138431.kers]
Normalized transition count is 399 out of 400 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 147 cols 1542 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 00:56:50] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11673468925396138431.kers
Total runtime 2 ms.
[2026-05-27 00:56:50] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-27 00:56:50] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2026-05-27 00:56:50] [INFO ] Invariant cache hit.
[2026-05-27 00:56:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 00:56:51] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2026-05-27 00:56:51] [INFO ] Redundant transitions in 8 ms returned []
Running 414 sub problems to find dead transitions.
[2026-05-27 00:56:51] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2026-05-27 00:56:51] [INFO ] Invariant cache hit.
[2026-05-27 00:56:51] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (OVERLAPS) 399/546 variables, 147/160 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 414 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/547 variables, and 169 constraints, problems are : Problem set: 0 solved, 414 unsolved in 29825 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (OVERLAPS) 1/147 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (OVERLAPS) 399/546 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 414/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/547 variables, and 586 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in SI_LTL mode, iteration 1 : 147/307 places, 419/558 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60988 ms. Remains : 147/307 places, 419/558 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 315 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 360 ms.
Product exploration explored 100000 steps with 1 reset in 197 ms.
Computed a total of 32 stabilizing places and 62 stable transitions
Computed a total of 32 stabilizing places and 62 stable transitions
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2064 resets) in 383 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (469 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 680846 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 1
Probabilistic random walk after 680846 steps, saw 202662 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
[2026-05-27 00:57:55] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2026-05-27 00:57:55] [INFO ] Invariant cache hit.
[2026-05-27 00:57:55] [INFO ] State equation strengthened by 9 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) 74/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/139 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/538 variables, 139/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/546 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/547 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 9/9 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) 74/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/139 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 399/538 variables, 139/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 9/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/546 variables, 8/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/546 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/547 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 974ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 419/419 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 147 transition count 416
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 19 place count 147 transition count 400
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 131 transition count 394
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 127 transition count 390
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 127 transition count 390
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 127 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 73 place count 127 transition count 366
Applied a total of 73 rules in 46 ms. Remains 127 /147 variables (removed 20) and now considering 366/419 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 127/147 places, 366/419 transitions.
RANDOM walk for 40000 steps (2000 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (506 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 913076 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :0 out of 1
Probabilistic random walk after 913076 steps, saw 239336 distinct states, run finished after 3001 ms. (steps per millisecond=304 ) properties seen :0
[2026-05-27 00:57:59] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8564496008152003428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2968106535425630230.kers'
[2026-05-27 00:57:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8564496008152003428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2968106535425630230.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 359 rows 127 cols 1298 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-27 00:57:59] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2968106535425630230.kers
Total runtime 2 ms.
[2026-05-27 00:57:59] [INFO ] State equation strengthened by 67 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) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/119 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 359/478 variables, 119/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 67/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/486 variables, 8/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/486 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 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) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/119 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 359/478 variables, 119/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 67/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/486 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/486 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 366/366 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 127/127 places, 366/366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 366/366 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2026-05-27 00:58:00] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2026-05-27 00:58:00] [INFO ] Invariant cache hit.
[2026-05-27 00:58:00] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-27 00:58:00] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2026-05-27 00:58:00] [INFO ] Invariant cache hit.
[2026-05-27 00:58:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-27 00:58:01] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
[2026-05-27 00:58:01] [INFO ] Redundant transitions in 5 ms returned []
Running 362 sub problems to find dead transitions.
[2026-05-27 00:58:01] [INFO ] Flow matrix only has 359 transitions (discarded 7 similar events)
[2026-05-27 00:58:01] [INFO ] Invariant cache hit.
[2026-05-27 00:58:01] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (OVERLAPS) 359/486 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 67/208 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 208 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 6 (OVERLAPS) 359/486 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 67/208 constraints. Problems are: Problem set: 0 solved, 362 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 362/570 constraints. Problems are: Problem set: 0 solved, 362 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 572 constraints, problems are : Problem set: 0 solved, 362 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 362/362 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 362 unsolved
Search for dead transitions found 0 dead transitions in 60303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61228 ms. Remains : 127/127 places, 366/366 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 83 edges and 127 vertex of which 20 / 127 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 108 transition count 247
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 247
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 108 transition count 237
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 1 with 2 rules applied. Total rules applied 17 place count 107 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 107 transition count 218
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 107 transition count 214
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 103 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 103 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 101 transition count 210
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 3 with 2 rules applied. Total rules applied 51 place count 100 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 100 transition count 208
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 3 with 2 rules applied. Total rules applied 54 place count 99 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 98 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 98 transition count 180
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 98 transition count 178
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 96 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 96 transition count 174
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 96 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 94 transition count 172
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 94 transition count 172
Applied a total of 72 rules in 66 ms. Remains 94 /127 variables (removed 33) and now considering 172/366 (removed 194) transitions.
Running SMT prover for 1 properties.
[2026-05-27 00:59:01] [INFO ] Flow matrix only has 170 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-3953371121080711235.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18222184360129816554.kers'
[2026-05-27 00:59:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3953371121080711235.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18222184360129816554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 94 cols 642 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-27 00:59:01] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18222184360129816554.kers
Total runtime 2 ms.
[2026-05-27 00:59:01] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-27 00:59:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-27 00:59:01] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-27 00:59:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-27 00:59:01] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-27 00:59:02] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-27 00:59:02] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 402 ms.
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Knowledge-based reduction took 70017 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 419/419 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2026-05-27 00:59:02] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9082687974670129459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9810948675633284078.kers'
[2026-05-27 00:59:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9082687974670129459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9810948675633284078.kers]
Normalized transition count is 399 out of 400 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 399 rows 147 cols 1542 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-27 00:59:02] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9810948675633284078.kers
Total runtime 3 ms.
[2026-05-27 00:59:02] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-27 00:59:02] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2026-05-27 00:59:02] [INFO ] Invariant cache hit.
[2026-05-27 00:59:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 00:59:02] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2026-05-27 00:59:02] [INFO ] Redundant transitions in 3 ms returned []
Running 414 sub problems to find dead transitions.
[2026-05-27 00:59:02] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2026-05-27 00:59:02] [INFO ] Invariant cache hit.
[2026-05-27 00:59:02] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (OVERLAPS) 399/546 variables, 147/160 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/547 variables, and 169 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (OVERLAPS) 1/147 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 7 (OVERLAPS) 399/546 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 414/584 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/547 variables, and 585 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60761 ms. Remains : 147/147 places, 419/419 transitions.
Computed a total of 32 stabilizing places and 62 stable transitions
Computed a total of 32 stabilizing places and 62 stable transitions
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2059 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (480 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 732524 steps, run timeout after 3001 ms. (steps per millisecond=244 ) properties seen :0 out of 1
Probabilistic random walk after 732524 steps, saw 216379 distinct states, run finished after 3001 ms. (steps per millisecond=244 ) properties seen :0
[2026-05-27 01:00:06] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2026-05-27 01:00:06] [INFO ] Invariant cache hit.
[2026-05-27 01:00:06] [INFO ] State equation strengthened by 9 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) 74/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/139 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 399/538 variables, 139/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 9/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/546 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/547 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 9/9 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) 74/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/139 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 399/538 variables, 139/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 9/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/546 variables, 8/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/546 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/547 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 977ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 419/419 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 147 transition count 416
Free-agglomeration rule applied 16 times.
Iterating global reduction 1 with 16 rules applied. Total rules applied 19 place count 147 transition count 400
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 131 transition count 394
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 127 transition count 390
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 127 transition count 390
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 127 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 73 place count 127 transition count 366
Applied a total of 73 rules in 36 ms. Remains 127 /147 variables (removed 20) and now considering 366/419 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 127/147 places, 366/419 transitions.
RANDOM walk for 40000 steps (2010 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35366 steps (432 resets) in 125 ms. (280 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Knowledge-based reduction took 4423 ms.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 169 ms.
Product exploration explored 100000 steps with 1 reset in 182 ms.
Built C files in :
/tmp/ltsmin1421418190422046272
[2026-05-27 01:00:07] [INFO ] Computing symmetric may disable matrix : 419 transitions.
[2026-05-27 01:00:07] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:00:07] [INFO ] Computing symmetric may enable matrix : 419 transitions.
[2026-05-27 01:00:07] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:00:08] [INFO ] Computing Do-Not-Accords matrix : 419 transitions.
[2026-05-27 01:00:08] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:00:08] [INFO ] Built C files in 200ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1421418190422046272
Running compilation step : cd /tmp/ltsmin1421418190422046272;'/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 1906 ms.
Running link step : cd /tmp/ltsmin1421418190422046272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin1421418190422046272;'/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/stateBased11515304930003200709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 419/419 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2026-05-27 01:00:22] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2026-05-27 01:00:22] [INFO ] Invariant cache hit.
[2026-05-27 01:00:23] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-27 01:00:23] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2026-05-27 01:00:23] [INFO ] Invariant cache hit.
[2026-05-27 01:00:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 01:00:23] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2026-05-27 01:00:23] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 615 ms. Remains : 147/147 places, 419/419 transitions.
Built C files in :
/tmp/ltsmin9682813327459708036
[2026-05-27 01:00:23] [INFO ] Computing symmetric may disable matrix : 419 transitions.
[2026-05-27 01:00:23] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:00:23] [INFO ] Computing symmetric may enable matrix : 419 transitions.
[2026-05-27 01:00:23] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:00:23] [INFO ] Computing Do-Not-Accords matrix : 419 transitions.
[2026-05-27 01:00:23] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:00:23] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9682813327459708036
Running compilation step : cd /tmp/ltsmin9682813327459708036;'/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 1520 ms.
Running link step : cd /tmp/ltsmin9682813327459708036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9682813327459708036;'/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/stateBased17678785548171893475.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 01:00:38] [INFO ] Flatten gal took : 40 ms
[2026-05-27 01:00:38] [INFO ] Flatten gal took : 30 ms
[2026-05-27 01:00:38] [INFO ] Time to serialize gal into /tmp/LTL4359003473423391665.gal : 11 ms
[2026-05-27 01:00:38] [INFO ] Time to serialize properties into /tmp/LTL3370382889826783525.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/LTL4359003473423391665.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1353256304330780630.hoa' '-atoms' '/tmp/LTL3370382889826783525.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/LTL3370382889826783525.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1353256304330780630.hoa
Detected timeout of ITS tools.
[2026-05-27 01:00:53] [INFO ] Flatten gal took : 27 ms
[2026-05-27 01:00:53] [INFO ] Flatten gal took : 27 ms
[2026-05-27 01:00:53] [INFO ] Time to serialize gal into /tmp/LTL9892161454127720802.gal : 6 ms
[2026-05-27 01:00:53] [INFO ] Time to serialize properties into /tmp/LTL14739824606615777179.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9892161454127720802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14739824606615777179.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("((p19==0)||(p230==0))"))))
Formula 0 simplified : GF!"((p19==0)||(p230==0))"
Detected timeout of ITS tools.
[2026-05-27 01:01:08] [INFO ] Flatten gal took : 24 ms
[2026-05-27 01:01:08] [INFO ] Applying decomposition
[2026-05-27 01:01:09] [INFO ] Flatten gal took : 21 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/graph8269528579584716127.txt' '-o' '/tmp/graph8269528579584716127.bin' '-w' '/tmp/graph8269528579584716127.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8269528579584716127.bin' '-l' '-1' '-v' '-w' '/tmp/graph8269528579584716127.weights' '-q' '0' '-e' '0.001'
[2026-05-27 01:01:09] [INFO ] Decomposing Gal with order
[2026-05-27 01:01:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 01:01:09] [INFO ] Removed a total of 597 redundant transitions.
[2026-05-27 01:01:09] [INFO ] Flatten gal took : 181 ms
[2026-05-27 01:01:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 205 labels/synchronizations in 41 ms.
[2026-05-27 01:01:09] [INFO ] Time to serialize gal into /tmp/LTL1984106239303480647.gal : 13 ms
[2026-05-27 01:01:09] [INFO ] Time to serialize properties into /tmp/LTL13248115773763087126.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/LTL1984106239303480647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13248115773763087126.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("((i0.i0.u3.p19==0)||(i0.i2.u26.p230==0))"))))
Formula 0 simplified : GF!"((i0.i0.u3.p19==0)||(i0.i2.u26.p230==0))"
Detected timeout of ITS tools.
Treatment of property FireWire-PT-18-LTLFireability-00 finished in 274330 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 (X(X((G(p1) U (G(p2) U X(p3))))) U p0))))'
Support contains 6 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 297 transition count 507
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 297 transition count 507
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 297 transition count 506
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 292 transition count 498
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 292 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 289 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 289 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 287 transition count 486
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 287 transition count 486
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 285 transition count 482
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 285 transition count 482
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 283 transition count 476
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 283 transition count 476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 281 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 281 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 279 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 279 transition count 466
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 277 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 277 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 275 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 275 transition count 456
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 273 transition count 452
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 273 transition count 452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 271 transition count 447
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 271 transition count 447
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 269 transition count 443
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 269 transition count 443
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 267 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 267 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 266 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 266 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 265 transition count 437
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 265 transition count 437
Applied a total of 85 rules in 52 ms. Remains 265 /307 variables (removed 42) and now considering 437/558 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7846184992182987247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16134667958430258288.kers'
[2026-05-27 01:01:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7846184992182987247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16134667958430258288.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 437 rows 265 cols 1332 entries
Finished phase 1 with 258 SingleSign rule and 0 generalized
[2026-05-27 01:01:24] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16134667958430258288.kers
Total runtime 3 ms.
[2026-05-27 01:01:24] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-27 01:01:24] [INFO ] Invariant cache hit.
[2026-05-27 01:01:25] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2026-05-27 01:01:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 437/702 variables, 265/279 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/702 variables, and 280 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 8/8 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/264 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/265 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (OVERLAPS) 437/702 variables, 265/281 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 436/717 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/702 variables, and 722 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 265/307 places, 437/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61066 ms. Remains : 265/307 places, 437/558 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (X(X((G(p1) U (G(p2) U X(p3))))) U p0))))'
Stuttering acceptance computed with spot in 784 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-01
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-01 finished in 61983 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(p0))))&&F(p1)))'
Support contains 2 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 297 transition count 504
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 297 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 297 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 294 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 294 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 292 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 292 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 291 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 291 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 290 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 290 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 289 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 289 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 288 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 288 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 287 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 287 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 286 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 286 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 285 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 285 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 284 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 284 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 283 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 283 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 282 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 282 transition count 469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 281 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 281 transition count 468
Applied a total of 53 rules in 77 ms. Remains 281 /307 variables (removed 26) and now considering 468/558 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5538155941597126318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1896281701587161938.kers'
[2026-05-27 01:02:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5538155941597126318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1896281701587161938.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 281 cols 1446 entries
Finished phase 1 with 274 SingleSign rule and 0 generalized
[2026-05-27 01:02:26] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1896281701587161938.kers
Total runtime 4 ms.
[2026-05-27 01:02:26] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-27 01:02:26] [INFO ] Invariant cache hit.
[2026-05-27 01:02:27] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2026-05-27 01:02:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 281/749 variables, and 19 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/281 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 467 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 5 (OVERLAPS) 468/749 variables, 281/301 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 467/768 constraints. Problems are: Problem set: 0 solved, 467 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/749 variables, and 768 constraints, problems are : Problem set: 0 solved, 467 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 467/467 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 467 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 281/307 places, 468/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61356 ms. Remains : 281/307 places, 468/558 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(p0))))&&F(p1)))'
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-18-LTLFireability-04
Stuttering criterion allowed to conclude after 89 steps with 1 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-04 finished in 61619 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) U ((p0 U p1)&&(p0||X(X(X(!p2))))))))'
Support contains 6 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 296 transition count 522
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 296 transition count 522
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 291 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 291 transition count 514
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 288 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 288 transition count 508
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 287 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 287 transition count 505
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 286 transition count 503
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 286 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 285 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 285 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 284 transition count 498
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 284 transition count 498
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 283 transition count 495
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 283 transition count 495
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 282 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 282 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 281 transition count 490
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 281 transition count 490
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 280 transition count 488
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 280 transition count 488
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 279 transition count 485
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 279 transition count 485
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 278 transition count 483
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 278 transition count 483
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 277 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 277 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 276 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 276 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 275 transition count 478
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 275 transition count 478
Applied a total of 64 rules in 46 ms. Remains 275 /307 variables (removed 32) and now considering 478/558 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11956350262925351509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-394750633615676236.kers'
[2026-05-27 01:03:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11956350262925351509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-394750633615676236.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 478 rows 275 cols 1492 entries
Finished phase 1 with 268 SingleSign rule and 0 generalized
[2026-05-27 01:03:28] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-394750633615676236.kers
Total runtime 2 ms.
[2026-05-27 01:03:28] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-27 01:03:28] [INFO ] Invariant cache hit.
[2026-05-27 01:03:29] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2026-05-27 01:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 275/753 variables, and 21 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/275 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (OVERLAPS) 478/753 variables, 275/297 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 477/774 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 753/753 variables, and 774 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 275/307 places, 478/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61024 ms. Remains : 275/307 places, 478/558 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) U ((p0 U p1)&&(X(X(X(!p2)))||p0)))))'
Stuttering acceptance computed with spot in 963 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (NOT p0), (OR (NOT p1) (AND (NOT p0) p2)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p0) p2), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-05
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-05 finished in 62079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (X(X(G(p0)))||(G(p1)&&X((!p2&&X(p0)))))))'
Support contains 4 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 296 transition count 504
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 296 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 296 transition count 503
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 291 transition count 495
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 291 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 288 transition count 489
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 288 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 286 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 286 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 284 transition count 479
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 284 transition count 479
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 282 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 282 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 280 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 278 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 278 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 276 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 274 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 274 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 272 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 272 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 271 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 271 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 270 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 270 transition count 445
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 269 transition count 444
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 269 transition count 444
Applied a total of 77 rules in 72 ms. Remains 269 /307 variables (removed 38) and now considering 444/558 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15222899490760083969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18067087679563308509.kers'
[2026-05-27 01:04:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15222899490760083969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18067087679563308509.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 444 rows 269 cols 1354 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-05-27 01:04:30] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18067087679563308509.kers
Total runtime 4 ms.
[2026-05-27 01:04:30] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-27 01:04:30] [INFO ] Invariant cache hit.
[2026-05-27 01:04:31] [INFO ] Implicit Places using invariants and state equation in 611 ms returned []
Implicit Place search using SMT with State Equation took 983 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2026-05-27 01:04:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/713 variables, and 17 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/269 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 444/713 variables, 269/290 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 443/733 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/713 variables, and 733 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 269/307 places, 444/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61187 ms. Remains : 269/307 places, 444/558 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(p0)) U (X(X(G(p0)))||(G(p1)&&X((!p2&&X(p0)))))))'
Stuttering acceptance computed with spot in 423 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-07 finished in 61695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (X(X((p1||G(p2))))&&(p0 U p3))))'
Support contains 6 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 296 transition count 504
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 296 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 296 transition count 503
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 291 transition count 495
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 291 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 288 transition count 489
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 288 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 286 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 286 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 284 transition count 479
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 284 transition count 479
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 282 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 282 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 280 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 278 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 278 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 276 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 274 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 274 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 272 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 272 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 270 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 270 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 269 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 269 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 268 transition count 441
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 268 transition count 441
Applied a total of 79 rules in 67 ms. Remains 268 /307 variables (removed 39) and now considering 441/558 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8329302826109729932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-967921033355423107.kers'
[2026-05-27 01:05:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8329302826109729932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-967921033355423107.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 441 rows 268 cols 1342 entries
Finished phase 1 with 261 SingleSign rule and 0 generalized
[2026-05-27 01:05:32] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-967921033355423107.kers
Total runtime 3 ms.
[2026-05-27 01:05:32] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-27 01:05:32] [INFO ] Invariant cache hit.
[2026-05-27 01:05:32] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 440 sub problems to find dead transitions.
[2026-05-27 01:05:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 268/709 variables, and 23 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/268 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (OVERLAPS) 441/709 variables, 268/291 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/709 variables, 440/731 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 709/709 variables, and 734 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 268/307 places, 441/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61010 ms. Remains : 268/307 places, 441/558 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (X(X((p1||G(p2))))&&(p0 U p3))))'
Stuttering acceptance computed with spot in 766 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), p0, (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p3), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-08
Product exploration explored 100000 steps with 33442 reset in 218 ms.
Stack based approach found an accepted trace after 538 steps with 176 reset with depth 4 and stack size 4 in 2 ms.
FORMULA FireWire-PT-18-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-18-LTLFireability-08 finished in 62121 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' '!((!((p1 U p2)||p0) U G(!p1)))'
Support contains 4 out of 307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Graph (trivial) has 214 edges and 307 vertex of which 11 / 307 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 298 transition count 512
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 262 transition count 508
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 260 transition count 508
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 79 place count 260 transition count 482
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 131 place count 234 transition count 482
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 141 place count 224 transition count 429
Iterating global reduction 3 with 10 rules applied. Total rules applied 151 place count 224 transition count 429
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 224 transition count 427
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 153 place count 224 transition count 424
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 221 transition count 424
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 162 place count 218 transition count 421
Iterating global reduction 4 with 3 rules applied. Total rules applied 165 place count 218 transition count 421
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 167 place count 216 transition count 417
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 216 transition count 417
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 215 transition count 414
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 215 transition count 414
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 214 transition count 412
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 214 transition count 412
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 217 place count 192 transition count 390
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 218 place count 191 transition count 388
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 191 transition count 388
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 279 place count 161 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 281 place count 161 transition count 448
Applied a total of 281 rules in 50 ms. Remains 161 /307 variables (removed 146) and now considering 448/558 (removed 110) transitions.
[2026-05-27 01:06:34] [INFO ] Flow matrix only has 429 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13385985410419107103.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14294871124835737582.kers'
[2026-05-27 01:06:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13385985410419107103.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14294871124835737582.kers]
Normalized transition count is 428 out of 429 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 428 rows 161 cols 1648 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 01:06:34] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14294871124835737582.kers
Total runtime 3 ms.
[2026-05-27 01:06:34] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-27 01:06:34] [INFO ] Flow matrix only has 429 transitions (discarded 19 similar events)
[2026-05-27 01:06:34] [INFO ] Invariant cache hit.
[2026-05-27 01:06:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 01:06:34] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2026-05-27 01:06:34] [INFO ] Redundant transitions in 5 ms returned []
Running 443 sub problems to find dead transitions.
[2026-05-27 01:06:34] [INFO ] Flow matrix only has 429 transitions (discarded 19 similar events)
[2026-05-27 01:06:34] [INFO ] Invariant cache hit.
[2026-05-27 01:06:34] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 428/589 variables, 161/175 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 9/184 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/590 variables, and 184 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (OVERLAPS) 428/589 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 9/185 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 443/628 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/590 variables, and 628 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 161/307 places, 448/558 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60980 ms. Remains : 161/307 places, 448/558 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' '!((!((p1 U p2)||p0) U G(!p1)))'
Stuttering acceptance computed with spot in 127 ms :[p1, true, p2, p1]
Running random walk in product with property : FireWire-PT-18-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 3 reset in 118 ms.
Computed a total of 43 stabilizing places and 92 stable transitions
Computed a total of 43 stabilizing places and 92 stable transitions
Knowledge based reduction with 17 factoid took 64 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2058 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (477 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 743452 steps, run timeout after 3002 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 743452 steps, saw 216994 distinct states, run finished after 3002 ms. (steps per millisecond=247 ) properties seen :0
[2026-05-27 01:07:38] [INFO ] Flow matrix only has 429 transitions (discarded 19 similar events)
[2026-05-27 01:07:38] [INFO ] Invariant cache hit.
[2026-05-27 01:07:38] [INFO ] State equation strengthened by 9 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) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/153 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 428/581 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/589 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/590 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/153 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 428/581 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/589 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/589 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/590 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 448/448 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 161 transition count 445
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 161 transition count 444
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 160 transition count 444
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 158 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 157 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 157 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 156 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 156 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 155 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 155 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 154 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 154 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 153 transition count 430
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 153 transition count 430
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 152 transition count 428
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 152 transition count 428
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 151 transition count 425
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 151 transition count 425
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 150 transition count 423
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 150 transition count 423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 149 transition count 420
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 149 transition count 420
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 148 transition count 418
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 148 transition count 418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 147 transition count 416
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 147 transition count 416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 146 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 146 transition count 414
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 146 transition count 399
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 69 place count 131 transition count 393
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 127 transition count 389
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 127 transition count 389
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 83 place count 127 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 101 place count 127 transition count 365
Applied a total of 101 rules in 80 ms. Remains 127 /161 variables (removed 34) and now considering 365/448 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 127/161 places, 365/448 transitions.
RANDOM walk for 40000 steps (1932 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (487 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 843824 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :0 out of 1
Probabilistic random walk after 843824 steps, saw 225196 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
[2026-05-27 01:07:42] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16906816527517694687.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15292315944101049304.kers'
[2026-05-27 01:07:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16906816527517694687.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15292315944101049304.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 358 rows 127 cols 1332 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-27 01:07:42] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15292315944101049304.kers
Total runtime 2 ms.
[2026-05-27 01:07:42] [INFO ] State equation strengthened by 47 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) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/119 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 358/477 variables, 119/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 47/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/485 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/119 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 358/477 variables, 119/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 47/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/485 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/485 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 755ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 365/365 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/127 places, 365/365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 365/365 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2026-05-27 01:07:43] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
[2026-05-27 01:07:43] [INFO ] Invariant cache hit.
[2026-05-27 01:07:43] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-27 01:07:43] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
[2026-05-27 01:07:43] [INFO ] Invariant cache hit.
[2026-05-27 01:07:44] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-27 01:07:44] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
[2026-05-27 01:07:44] [INFO ] Redundant transitions in 4 ms returned []
Running 361 sub problems to find dead transitions.
[2026-05-27 01:07:44] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
[2026-05-27 01:07:44] [INFO ] Invariant cache hit.
[2026-05-27 01:07:44] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 358/485 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 47/188 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 188 constraints, problems are : Problem set: 0 solved, 361 unsolved in 27740 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 358/485 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 47/188 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 361/549 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 549 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57926ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 57927ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58750 ms. Remains : 127/127 places, 365/365 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 64 edges and 127 vertex of which 20 / 127 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 108 transition count 246
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 246
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 108 transition count 236
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 1 with 2 rules applied. Total rules applied 17 place count 107 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 107 transition count 217
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 107 transition count 213
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 103 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 103 transition count 209
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 101 transition count 209
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 3 with 2 rules applied. Total rules applied 51 place count 100 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 100 transition count 207
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 3 with 2 rules applied. Total rules applied 54 place count 99 transition count 206
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 99 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 97 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 97 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 97 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 95 transition count 198
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 95 transition count 198
Applied a total of 68 rules in 38 ms. Remains 95 /127 variables (removed 32) and now considering 198/365 (removed 167) transitions.
Running SMT prover for 1 properties.
[2026-05-27 01:08:42] [INFO ] Flow matrix only has 196 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-4631448536280401877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10242878288523521735.kers'
[2026-05-27 01:08:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4631448536280401877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10242878288523521735.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 95 cols 776 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-27 01:08:42] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10242878288523521735.kers
Total runtime 2 ms.
[2026-05-27 01:08:42] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-27 01:08:42] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-27 01:08:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-27 01:08:42] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-27 01:08:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-27 01:08:42] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-27 01:08:42] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-27 01:08:42] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 439 ms.
Knowledge based reduction with 17 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, p1]
Knowledge-based reduction took 67500 ms.
Stuttering acceptance computed with spot in 61 ms :[true, p1]
Support contains 2 out of 161 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2026-05-27 01:08:43] [INFO ] Flow matrix only has 429 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9847695471276480784.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8936463861851405228.kers'
[2026-05-27 01:08:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9847695471276480784.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8936463861851405228.kers]
Normalized transition count is 428 out of 429 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 428 rows 161 cols 1648 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-27 01:08:43] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8936463861851405228.kers
Total runtime 4 ms.
[2026-05-27 01:08:43] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-27 01:08:43] [INFO ] Flow matrix only has 429 transitions (discarded 19 similar events)
[2026-05-27 01:08:43] [INFO ] Invariant cache hit.
[2026-05-27 01:08:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 01:08:44] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 940 ms to find 0 implicit places.
[2026-05-27 01:08:44] [INFO ] Redundant transitions in 7 ms returned []
Running 443 sub problems to find dead transitions.
[2026-05-27 01:08:44] [INFO ] Flow matrix only has 429 transitions (discarded 19 similar events)
[2026-05-27 01:08:44] [INFO ] Invariant cache hit.
[2026-05-27 01:08:44] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 428/589 variables, 161/175 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 9/184 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/590 variables, and 184 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 1/161 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 7 (OVERLAPS) 428/589 variables, 161/176 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 9/185 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 443/628 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/590 variables, and 628 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 60230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61191 ms. Remains : 161/161 places, 448/448 transitions.
Computed a total of 43 stabilizing places and 92 stable transitions
Computed a total of 43 stabilizing places and 92 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2077 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (487 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 739548 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 739548 steps, saw 215914 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
[2026-05-27 01:09:47] [INFO ] Flow matrix only has 429 transitions (discarded 19 similar events)
[2026-05-27 01:09:47] [INFO ] Invariant cache hit.
[2026-05-27 01:09:47] [INFO ] State equation strengthened by 9 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) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/153 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 428/581 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/589 variables, 8/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/589 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/590 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/153 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 428/581 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 9/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/589 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/589 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/590 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 779ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 448/448 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 161 transition count 445
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 161 transition count 444
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 160 transition count 444
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 158 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 157 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 157 transition count 440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 156 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 156 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 155 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 155 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 154 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 154 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 153 transition count 430
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 153 transition count 430
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 152 transition count 428
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 152 transition count 428
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 151 transition count 425
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 151 transition count 425
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 150 transition count 423
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 150 transition count 423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 149 transition count 420
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 149 transition count 420
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 148 transition count 418
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 148 transition count 418
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 147 transition count 416
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 147 transition count 416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 146 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 146 transition count 414
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 48 place count 146 transition count 399
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 69 place count 131 transition count 393
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 127 transition count 389
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 127 transition count 389
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 83 place count 127 transition count 383
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 101 place count 127 transition count 365
Applied a total of 101 rules in 64 ms. Remains 127 /161 variables (removed 34) and now considering 365/448 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 127/161 places, 365/448 transitions.
RANDOM walk for 40000 steps (1933 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (513 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 925987 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 1
Probabilistic random walk after 925987 steps, saw 247811 distinct states, run finished after 3001 ms. (steps per millisecond=308 ) properties seen :0
[2026-05-27 01:09:51] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10817526079957621556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13012098359706945012.kers'
[2026-05-27 01:09:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10817526079957621556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13012098359706945012.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 358 rows 127 cols 1332 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-27 01:09:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13012098359706945012.kers
Total runtime 2 ms.
[2026-05-27 01:09:51] [INFO ] State equation strengthened by 47 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) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/119 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 358/477 variables, 119/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 47/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/485 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/119 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 358/477 variables, 119/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 47/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/485 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/485 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 700ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 365/365 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/127 places, 365/365 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 365/365 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 365/365 (removed 0) transitions.
[2026-05-27 01:09:52] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
[2026-05-27 01:09:52] [INFO ] Invariant cache hit.
[2026-05-27 01:09:52] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-27 01:09:52] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
[2026-05-27 01:09:52] [INFO ] Invariant cache hit.
[2026-05-27 01:09:52] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-27 01:09:52] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2026-05-27 01:09:52] [INFO ] Redundant transitions in 5 ms returned []
Running 361 sub problems to find dead transitions.
[2026-05-27 01:09:52] [INFO ] Flow matrix only has 358 transitions (discarded 7 similar events)
[2026-05-27 01:09:52] [INFO ] Invariant cache hit.
[2026-05-27 01:09:52] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 358/485 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 47/188 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/485 variables, and 188 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 358/485 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 47/188 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 361/549 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/485 variables, and 549 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60250ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60251ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61083 ms. Remains : 127/127 places, 365/365 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 64 edges and 127 vertex of which 20 / 127 are part of one of the 3 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 108 transition count 246
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 108 transition count 246
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 108 transition count 236
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 1 with 2 rules applied. Total rules applied 17 place count 107 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 107 transition count 217
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 107 transition count 213
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 103 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 103 transition count 209
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 101 transition count 209
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 3 with 2 rules applied. Total rules applied 51 place count 100 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 100 transition count 207
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 3 with 2 rules applied. Total rules applied 54 place count 99 transition count 206
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 99 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 97 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 97 transition count 200
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 97 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 95 transition count 198
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 95 transition count 198
Applied a total of 68 rules in 27 ms. Remains 95 /127 variables (removed 32) and now considering 198/365 (removed 167) transitions.
Running SMT prover for 1 properties.
[2026-05-27 01:10:53] [INFO ] Flow matrix only has 196 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-15674594179846831572.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10021895950717183146.kers'
[2026-05-27 01:10:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15674594179846831572.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10021895950717183146.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 95 cols 776 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-27 01:10:53] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10021895950717183146.kers
Total runtime 1 ms.
[2026-05-27 01:10:53] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-27 01:10:53] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-27 01:10:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-27 01:10:53] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-27 01:10:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-27 01:10:53] [INFO ] After 23ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-27 01:10:53] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-27 01:10:53] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 430 ms.
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, p1]
Knowledge-based reduction took 69419 ms.
Stuttering acceptance computed with spot in 64 ms :[true, p1]
Stuttering acceptance computed with spot in 65 ms :[true, p1]
Product exploration explored 100000 steps with 2 reset in 89 ms.
Product exploration explored 100000 steps with 2 reset in 105 ms.
Built C files in :
/tmp/ltsmin468372532558901416
[2026-05-27 01:10:54] [INFO ] Computing symmetric may disable matrix : 448 transitions.
[2026-05-27 01:10:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:10:54] [INFO ] Computing symmetric may enable matrix : 448 transitions.
[2026-05-27 01:10:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:10:54] [INFO ] Computing Do-Not-Accords matrix : 448 transitions.
[2026-05-27 01:10:54] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:10:54] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin468372532558901416
Running compilation step : cd /tmp/ltsmin468372532558901416;'/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 1774 ms.
Running link step : cd /tmp/ltsmin468372532558901416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin468372532558901416;'/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/stateBased16571450864357701610.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 448/448 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 161 transition count 447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 160 transition count 447
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 158 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 157 transition count 443
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 157 transition count 443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 156 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 156 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 155 transition count 438
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 155 transition count 438
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 154 transition count 436
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 154 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 153 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 153 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 152 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 152 transition count 431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 151 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 151 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 150 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 150 transition count 426
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 149 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 149 transition count 423
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 148 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 148 transition count 421
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 147 transition count 419
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 147 transition count 419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 146 transition count 417
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 146 transition count 417
Applied a total of 30 rules in 32 ms. Remains 146 /161 variables (removed 15) and now considering 417/448 (removed 31) transitions.
[2026-05-27 01:11:09] [INFO ] Flow matrix only has 398 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6689732429630468765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1252362076784238963.kers'
[2026-05-27 01:11:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6689732429630468765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1252362076784238963.kers]
Normalized transition count is 397 out of 398 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 397 rows 146 cols 1534 entries
Finished phase 1 with 139 SingleSign rule and 0 generalized
[2026-05-27 01:11:09] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1252362076784238963.kers
Total runtime 2 ms.
[2026-05-27 01:11:09] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-27 01:11:09] [INFO ] Flow matrix only has 398 transitions (discarded 19 similar events)
[2026-05-27 01:11:09] [INFO ] Invariant cache hit.
[2026-05-27 01:11:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 01:11:09] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2026-05-27 01:11:09] [INFO ] Redundant transitions in 6 ms returned []
Running 412 sub problems to find dead transitions.
[2026-05-27 01:11:09] [INFO ] Flow matrix only has 398 transitions (discarded 19 similar events)
[2026-05-27 01:11:09] [INFO ] Invariant cache hit.
[2026-05-27 01:11:09] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 397/543 variables, 146/160 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/544 variables, and 169 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (OVERLAPS) 1/146 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 397/543 variables, 146/160 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 412/581 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/544 variables, and 581 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 146/161 places, 417/448 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61118 ms. Remains : 146/161 places, 417/448 transitions.
Built C files in :
/tmp/ltsmin9216707720246276613
[2026-05-27 01:12:10] [INFO ] Computing symmetric may disable matrix : 417 transitions.
[2026-05-27 01:12:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:12:10] [INFO ] Computing symmetric may enable matrix : 417 transitions.
[2026-05-27 01:12:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:12:10] [INFO ] Computing Do-Not-Accords matrix : 417 transitions.
[2026-05-27 01:12:10] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:12:10] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9216707720246276613
Running compilation step : cd /tmp/ltsmin9216707720246276613;'/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 1709 ms.
Running link step : cd /tmp/ltsmin9216707720246276613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9216707720246276613;'/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/stateBased5330235913311933002.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 01:12:25] [INFO ] Flatten gal took : 18 ms
[2026-05-27 01:12:25] [INFO ] Flatten gal took : 16 ms
[2026-05-27 01:12:25] [INFO ] Time to serialize gal into /tmp/LTL15293790789595274682.gal : 4 ms
[2026-05-27 01:12:25] [INFO ] Time to serialize properties into /tmp/LTL10196113341226362940.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15293790789595274682.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2333594111826995229.hoa' '-atoms' '/tmp/LTL10196113341226362940.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10196113341226362940.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2333594111826995229.hoa
Reverse transition relation is NOT exact ! Due to transitions t202.t203, t217, t219, t226, t234, t236, t237, t238, t239, t242, t244, t247, t249, t252, t254...1264
Computing Next relation with stutter on 8.22091e+06 deadlock states
Detected timeout of ITS tools.
[2026-05-27 01:12:40] [INFO ] Flatten gal took : 16 ms
[2026-05-27 01:12:40] [INFO ] Flatten gal took : 15 ms
[2026-05-27 01:12:40] [INFO ] Time to serialize gal into /tmp/LTL2817393779184128609.gal : 3 ms
[2026-05-27 01:12:40] [INFO ] Time to serialize properties into /tmp/LTL10832807021485678065.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/LTL2817393779184128609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10832807021485678065.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 : !(((!(((("((p14==1)&&(p326==1))")U("(p228==1)"))||("(p228!=1)"))||("(p125==1)")))U(G(!("((p14==1)&&(p326==1))")))))
Formula 0 simplified : ("(p125==1)" | "(p228!=1)" | ("((p14==1)&&(p326==1))" U "(p228==1)")) R F"((p14==1)&&(p326==1))"
Reverse transition relation is NOT exact ! Due to transitions t151, t202.t203, t217, t219, t226, t234, t236, t237, t238, t239, t242, t244, t247, t249, t252...1358
Computing Next relation with stutter on 8.72592e+06 deadlock states
Detected timeout of ITS tools.
[2026-05-27 01:12:55] [INFO ] Flatten gal took : 14 ms
[2026-05-27 01:12:55] [INFO ] Applying decomposition
[2026-05-27 01:12:55] [INFO ] Flatten gal took : 13 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/graph9172322082905131421.txt' '-o' '/tmp/graph9172322082905131421.bin' '-w' '/tmp/graph9172322082905131421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9172322082905131421.bin' '-l' '-1' '-v' '-w' '/tmp/graph9172322082905131421.weights' '-q' '0' '-e' '0.001'
[2026-05-27 01:12:55] [INFO ] Decomposing Gal with order
[2026-05-27 01:12:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 01:12:55] [INFO ] Removed a total of 594 redundant transitions.
[2026-05-27 01:12:55] [INFO ] Flatten gal took : 47 ms
[2026-05-27 01:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 231 labels/synchronizations in 18 ms.
[2026-05-27 01:12:55] [INFO ] Time to serialize gal into /tmp/LTL2020473999414345427.gal : 5 ms
[2026-05-27 01:12:55] [INFO ] Time to serialize properties into /tmp/LTL18252905374476122694.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/LTL2020473999414345427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18252905374476122694.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((!(((("((i1.i0.u3.p14==1)&&(i1.i0.u38.p326==1))")U("(i1.i0.u15.p228==1)"))||("(i1.i0.u15.p228!=1)"))||("(i3.u12.p125==1)")))U(G(!("...201
Formula 0 simplified : ("(i1.i0.u15.p228!=1)" | "(i3.u12.p125==1)" | ("((i1.i0.u3.p14==1)&&(i1.i0.u38.p326==1))" U "(i1.i0.u15.p228==1)")) R F"((i1.i0.u3.p...184
Reverse transition relation is NOT exact ! Due to transitions t202_t203, t217, t219, t226, t267, t268, t274, t326, t349, t376, t415, t416, t422, t469, t513...1264
Computing Next relation with stutter on 8.72592e+06 deadlock states
Detected timeout of ITS tools.
Treatment of property FireWire-PT-18-LTLFireability-09 finished in 396586 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 (F(!p2)&&p1)))'
Support contains 5 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 296 transition count 522
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 296 transition count 522
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 291 transition count 514
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 291 transition count 514
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 288 transition count 508
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 288 transition count 508
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 286 transition count 502
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 286 transition count 502
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 284 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 284 transition count 498
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 282 transition count 492
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 282 transition count 492
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 280 transition count 488
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 280 transition count 488
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 278 transition count 482
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 278 transition count 482
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 276 transition count 478
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 276 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 274 transition count 472
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 274 transition count 472
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 272 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 272 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 270 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 270 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 268 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 268 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 266 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 266 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 265 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 265 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 264 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 264 transition count 453
Applied a total of 86 rules in 45 ms. Remains 264 /307 variables (removed 43) and now considering 453/558 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16655299647966010216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15645705137779212602.kers'
[2026-05-27 01:13:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16655299647966010216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15645705137779212602.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 453 rows 264 cols 1394 entries
Finished phase 1 with 257 SingleSign rule and 0 generalized
[2026-05-27 01:13:10] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15645705137779212602.kers
Total runtime 3 ms.
[2026-05-27 01:13:10] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-27 01:13:10] [INFO ] Invariant cache hit.
[2026-05-27 01:13:11] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
Running 452 sub problems to find dead transitions.
[2026-05-27 01:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/263 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (OVERLAPS) 1/264 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 452 unsolved
SMT process timed out in 30114ms, After SMT, problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 30116ms
Starting structural reductions in LTL mode, iteration 1 : 264/307 places, 453/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31082 ms. Remains : 264/307 places, 453/558 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 (F(!p2)&&p1)))'
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) p2), (NOT p0), p2, true]
Running random walk in product with property : FireWire-PT-18-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-10 finished in 31300 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||G(p1)))))'
Support contains 3 out of 307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Graph (trivial) has 218 edges and 307 vertex of which 11 / 307 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 298 transition count 512
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 262 transition count 508
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 260 transition count 508
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 79 place count 260 transition count 482
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 131 place count 234 transition count 482
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 142 place count 223 transition count 427
Iterating global reduction 3 with 11 rules applied. Total rules applied 153 place count 223 transition count 427
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 155 place count 223 transition count 425
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 155 place count 223 transition count 422
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 161 place count 220 transition count 422
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 165 place count 216 transition count 416
Iterating global reduction 4 with 4 rules applied. Total rules applied 169 place count 216 transition count 416
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 172 place count 213 transition count 410
Iterating global reduction 4 with 3 rules applied. Total rules applied 175 place count 213 transition count 410
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 177 place count 211 transition count 404
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 211 transition count 404
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 181 place count 209 transition count 400
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 209 transition count 400
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 185 place count 207 transition count 394
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 207 transition count 394
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 189 place count 205 transition count 390
Iterating global reduction 4 with 2 rules applied. Total rules applied 191 place count 205 transition count 390
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 193 place count 203 transition count 384
Iterating global reduction 4 with 2 rules applied. Total rules applied 195 place count 203 transition count 384
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 197 place count 201 transition count 380
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 201 transition count 380
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 200 place count 200 transition count 377
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 200 transition count 377
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 202 place count 199 transition count 375
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 199 transition count 375
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 204 place count 198 transition count 372
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 198 transition count 372
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 206 place count 197 transition count 370
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 197 transition count 370
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 208 place count 196 transition count 368
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 196 transition count 368
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 210 place count 195 transition count 366
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 195 transition count 366
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 257 place count 172 transition count 343
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 317 place count 142 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 142 transition count 402
Applied a total of 319 rules in 115 ms. Remains 142 /307 variables (removed 165) and now considering 402/558 (removed 156) transitions.
[2026-05-27 01:13:42] [INFO ] Flow matrix only has 386 transitions (discarded 16 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18317806560412515419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5048081196519099182.kers'
[2026-05-27 01:13:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18317806560412515419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5048081196519099182.kers]
Normalized transition count is 385 out of 386 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 385 rows 142 cols 1480 entries
Finished phase 1 with 135 SingleSign rule and 0 generalized
[2026-05-27 01:13:42] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5048081196519099182.kers
Total runtime 5 ms.
[2026-05-27 01:13:42] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-05-27 01:13:42] [INFO ] Flow matrix only has 386 transitions (discarded 16 similar events)
[2026-05-27 01:13:42] [INFO ] Invariant cache hit.
[2026-05-27 01:13:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 01:13:42] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2026-05-27 01:13:42] [INFO ] Redundant transitions in 6 ms returned []
Running 397 sub problems to find dead transitions.
[2026-05-27 01:13:42] [INFO ] Flow matrix only has 386 transitions (discarded 16 similar events)
[2026-05-27 01:13:42] [INFO ] Invariant cache hit.
[2026-05-27 01:13:42] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 385/527 variables, 142/154 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 9/163 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (OVERLAPS) 0/527 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/528 variables, and 164 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (OVERLAPS) 1/142 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (OVERLAPS) 385/527 variables, 142/155 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 397/561 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/528 variables, and 561 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60206ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 142/307 places, 402/558 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61200 ms. Remains : 142/307 places, 402/558 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||G(p1)))))'
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-11 finished in 61303 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Graph (trivial) has 219 edges and 307 vertex of which 11 / 307 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 298 transition count 511
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 79 place count 261 transition count 507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 259 transition count 507
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 81 place count 259 transition count 481
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 133 place count 233 transition count 481
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 144 place count 222 transition count 426
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 222 transition count 426
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 222 transition count 424
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 157 place count 222 transition count 421
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 163 place count 219 transition count 421
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 167 place count 215 transition count 415
Iterating global reduction 4 with 4 rules applied. Total rules applied 171 place count 215 transition count 415
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 174 place count 212 transition count 409
Iterating global reduction 4 with 3 rules applied. Total rules applied 177 place count 212 transition count 409
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 179 place count 210 transition count 403
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 210 transition count 403
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 183 place count 208 transition count 399
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 208 transition count 399
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 186 place count 207 transition count 396
Iterating global reduction 4 with 1 rules applied. Total rules applied 187 place count 207 transition count 396
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 188 place count 206 transition count 394
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 206 transition count 394
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 190 place count 205 transition count 391
Iterating global reduction 4 with 1 rules applied. Total rules applied 191 place count 205 transition count 391
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 192 place count 204 transition count 389
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 204 transition count 389
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 194 place count 203 transition count 386
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 203 transition count 386
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 196 place count 202 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 202 transition count 384
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 201 transition count 381
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 201 transition count 381
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 200 place count 200 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 201 place count 200 transition count 379
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 202 place count 199 transition count 377
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 199 transition count 377
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 204 place count 198 transition count 375
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 198 transition count 375
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 251 place count 175 transition count 352
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 252 place count 174 transition count 350
Iterating global reduction 4 with 1 rules applied. Total rules applied 253 place count 174 transition count 350
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 313 place count 144 transition count 414
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 144 transition count 412
Applied a total of 315 rules in 107 ms. Remains 144 /307 variables (removed 163) and now considering 412/558 (removed 146) transitions.
[2026-05-27 01:14:43] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17966053564106920990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2437747367305133600.kers'
[2026-05-27 01:14:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17966053564106920990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2437747367305133600.kers]
Normalized transition count is 392 out of 393 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 392 rows 144 cols 1514 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-27 01:14:43] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2437747367305133600.kers
Total runtime 4 ms.
[2026-05-27 01:14:43] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-27 01:14:43] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
[2026-05-27 01:14:43] [INFO ] Invariant cache hit.
[2026-05-27 01:14:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 01:14:44] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2026-05-27 01:14:44] [INFO ] Redundant transitions in 3 ms returned []
Running 407 sub problems to find dead transitions.
[2026-05-27 01:14:44] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
[2026-05-27 01:14:44] [INFO ] Invariant cache hit.
[2026-05-27 01:14:44] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 392/536 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/537 variables, and 168 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 392/536 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 407/575 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/537 variables, and 575 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 144/307 places, 412/558 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61009 ms. Remains : 144/307 places, 412/558 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 1 reset in 99 ms.
Computed a total of 29 stabilizing places and 55 stable transitions
Computed a total of 29 stabilizing places and 55 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2069 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (477 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 758960 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 1
Probabilistic random walk after 758960 steps, saw 223081 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2026-05-27 01:15:47] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
[2026-05-27 01:15:47] [INFO ] Invariant cache hit.
[2026-05-27 01:15:47] [INFO ] State equation strengthened by 9 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) 71/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/136 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 392/528 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/536 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/536 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/537 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 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) 71/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/136 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 392/528 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/536 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/536 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/537 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 728ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 412/412 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 144 transition count 409
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 18 place count 144 transition count 394
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 129 transition count 388
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 125 transition count 384
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 125 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 53 place count 125 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 71 place count 125 transition count 360
Applied a total of 71 rules in 25 ms. Remains 125 /144 variables (removed 19) and now considering 360/412 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 125/144 places, 360/412 transitions.
RANDOM walk for 40000 steps (1983 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (490 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 898839 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :0 out of 1
Probabilistic random walk after 898839 steps, saw 239194 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
[2026-05-27 01:15:51] [INFO ] Flow matrix only has 353 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14170282525944137798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1709062540985268813.kers'
[2026-05-27 01:15:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14170282525944137798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1709062540985268813.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 353 rows 125 cols 1274 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-27 01:15:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1709062540985268813.kers
Total runtime 2 ms.
[2026-05-27 01:15:51] [INFO ] State equation strengthened by 66 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) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/117 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 353/470 variables, 117/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 66/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/478 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 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) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/117 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 353/470 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 66/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/478 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/478 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 748ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 360/360 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 125/125 places, 360/360 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 360/360 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2026-05-27 01:15:52] [INFO ] Flow matrix only has 353 transitions (discarded 7 similar events)
[2026-05-27 01:15:52] [INFO ] Invariant cache hit.
[2026-05-27 01:15:52] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-27 01:15:52] [INFO ] Flow matrix only has 353 transitions (discarded 7 similar events)
[2026-05-27 01:15:52] [INFO ] Invariant cache hit.
[2026-05-27 01:15:52] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-27 01:15:53] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2026-05-27 01:15:53] [INFO ] Redundant transitions in 5 ms returned []
Running 356 sub problems to find dead transitions.
[2026-05-27 01:15:53] [INFO ] Flow matrix only has 353 transitions (discarded 7 similar events)
[2026-05-27 01:15:53] [INFO ] Invariant cache hit.
[2026-05-27 01:15:53] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 353/478 variables, 125/142 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 66/208 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 208 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 353/478 variables, 125/142 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 66/208 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 356/564 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 564 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61065 ms. Remains : 125/125 places, 360/360 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 82 edges and 125 vertex of which 20 / 125 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 106 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 106 transition count 241
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 106 transition count 231
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 1 with 2 rules applied. Total rules applied 17 place count 105 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 105 transition count 212
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 105 transition count 208
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 101 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 101 transition count 204
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 99 transition count 204
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 3 with 2 rules applied. Total rules applied 51 place count 98 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 98 transition count 202
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 3 with 2 rules applied. Total rules applied 54 place count 97 transition count 201
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 97 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 94 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 94 transition count 194
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 94 transition count 192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 92 transition count 192
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 92 transition count 192
Applied a total of 72 rules in 21 ms. Remains 92 /125 variables (removed 33) and now considering 192/360 (removed 168) transitions.
Running SMT prover for 1 properties.
[2026-05-27 01:16:53] [INFO ] Flow matrix only has 190 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-17948194042079693365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13678418892550934627.kers'
[2026-05-27 01:16:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17948194042079693365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13678418892550934627.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 92 cols 724 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-27 01:16:53] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13678418892550934627.kers
Total runtime 1 ms.
[2026-05-27 01:16:53] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-27 01:16:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2026-05-27 01:16:53] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-27 01:16:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-27 01:16:53] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-27 01:16:53] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-27 01:16:53] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 217 ms.
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 69163 ms.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 412/412 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2026-05-27 01:16:53] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9601187794866296753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12900299401102519716.kers'
[2026-05-27 01:16:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9601187794866296753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12900299401102519716.kers]
Normalized transition count is 392 out of 393 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 392 rows 144 cols 1514 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-27 01:16:53] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12900299401102519716.kers
Total runtime 3 ms.
[2026-05-27 01:16:54] [INFO ] Implicit Places using invariants in 280 ms returned []
[2026-05-27 01:16:54] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
[2026-05-27 01:16:54] [INFO ] Invariant cache hit.
[2026-05-27 01:16:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 01:16:54] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2026-05-27 01:16:54] [INFO ] Redundant transitions in 6 ms returned []
Running 407 sub problems to find dead transitions.
[2026-05-27 01:16:54] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
[2026-05-27 01:16:54] [INFO ] Invariant cache hit.
[2026-05-27 01:16:54] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 392/536 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/537 variables, and 168 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 392/536 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 407/575 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/537 variables, and 575 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61092 ms. Remains : 144/144 places, 412/412 transitions.
Computed a total of 29 stabilizing places and 55 stable transitions
Computed a total of 29 stabilizing places and 55 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2084 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (478 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 764007 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 1
Probabilistic random walk after 764007 steps, saw 224685 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
[2026-05-27 01:17:58] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
[2026-05-27 01:17:58] [INFO ] Invariant cache hit.
[2026-05-27 01:17:58] [INFO ] State equation strengthened by 9 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) 71/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/136 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 392/528 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/536 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/536 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 536/537 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 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) 71/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/136 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 392/528 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/536 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/536 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 536/537 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 412/412 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 144 transition count 409
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 18 place count 144 transition count 394
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 39 place count 129 transition count 388
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 125 transition count 384
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 125 transition count 384
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 53 place count 125 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 71 place count 125 transition count 360
Applied a total of 71 rules in 16 ms. Remains 125 /144 variables (removed 19) and now considering 360/412 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 125/144 places, 360/412 transitions.
RANDOM walk for 40000 steps (1980 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (484 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 872200 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 1
Probabilistic random walk after 872200 steps, saw 232854 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
[2026-05-27 01:18:01] [INFO ] Flow matrix only has 353 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-814654069657414853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10666435745287005466.kers'
[2026-05-27 01:18:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-814654069657414853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10666435745287005466.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 353 rows 125 cols 1274 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-27 01:18:01] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10666435745287005466.kers
Total runtime 2 ms.
[2026-05-27 01:18:01] [INFO ] State equation strengthened by 66 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) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/117 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 353/470 variables, 117/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 66/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/478 variables, 8/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 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) 61/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/117 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 353/470 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 66/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/478 variables, 8/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/478 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/478 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 506ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 360/360 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 360/360 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 360/360 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 360/360 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 360/360 (removed 0) transitions.
[2026-05-27 01:18:02] [INFO ] Flow matrix only has 353 transitions (discarded 7 similar events)
[2026-05-27 01:18:02] [INFO ] Invariant cache hit.
[2026-05-27 01:18:02] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-27 01:18:02] [INFO ] Flow matrix only has 353 transitions (discarded 7 similar events)
[2026-05-27 01:18:02] [INFO ] Invariant cache hit.
[2026-05-27 01:18:02] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-27 01:18:02] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2026-05-27 01:18:02] [INFO ] Redundant transitions in 4 ms returned []
Running 356 sub problems to find dead transitions.
[2026-05-27 01:18:02] [INFO ] Flow matrix only has 353 transitions (discarded 7 similar events)
[2026-05-27 01:18:02] [INFO ] Invariant cache hit.
[2026-05-27 01:18:02] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 353/478 variables, 125/142 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 66/208 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 208 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (OVERLAPS) 353/478 variables, 125/142 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 66/208 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 356/564 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 564 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61058 ms. Remains : 125/125 places, 360/360 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 82 edges and 125 vertex of which 20 / 125 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 99 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 106 transition count 241
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 106 transition count 241
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 15 place count 106 transition count 231
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 1 with 2 rules applied. Total rules applied 17 place count 105 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 35 place count 105 transition count 212
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 105 transition count 208
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 45 place count 101 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 101 transition count 204
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 99 transition count 204
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 3 with 2 rules applied. Total rules applied 51 place count 98 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 98 transition count 202
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 3 with 2 rules applied. Total rules applied 54 place count 97 transition count 201
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 97 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 94 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 94 transition count 194
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 66 place count 94 transition count 192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 92 transition count 192
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 72 place count 92 transition count 192
Applied a total of 72 rules in 30 ms. Remains 92 /125 variables (removed 33) and now considering 192/360 (removed 168) transitions.
Running SMT prover for 1 properties.
[2026-05-27 01:19:03] [INFO ] Flow matrix only has 190 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-13165970593042900959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-690028785241720752.kers'
[2026-05-27 01:19:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13165970593042900959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-690028785241720752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 92 cols 724 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-27 01:19:03] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-690028785241720752.kers
Total runtime 2 ms.
[2026-05-27 01:19:03] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-27 01:19:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-27 01:19:03] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-27 01:19:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-27 01:19:03] [INFO ] After 21ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-27 01:19:03] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-27 01:19:03] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 317 ms.
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 68789 ms.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 90 ms.
Product exploration explored 100000 steps with 4 reset in 111 ms.
Built C files in :
/tmp/ltsmin14439903453115665906
[2026-05-27 01:19:04] [INFO ] Computing symmetric may disable matrix : 412 transitions.
[2026-05-27 01:19:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:19:04] [INFO ] Computing symmetric may enable matrix : 412 transitions.
[2026-05-27 01:19:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:19:04] [INFO ] Computing Do-Not-Accords matrix : 412 transitions.
[2026-05-27 01:19:04] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:19:04] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14439903453115665906
Running compilation step : cd /tmp/ltsmin14439903453115665906;'/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 1591 ms.
Running link step : cd /tmp/ltsmin14439903453115665906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14439903453115665906;'/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/stateBased8191492900668299095.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 412/412 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2026-05-27 01:19:19] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16785420386276186737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9410930665169835186.kers'
[2026-05-27 01:19:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16785420386276186737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9410930665169835186.kers]
Normalized transition count is 392 out of 393 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 392 rows 144 cols 1514 entries
Finished phase 1 with 137 SingleSign rule and 0 generalized
[2026-05-27 01:19:19] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9410930665169835186.kers
Total runtime 2 ms.
[2026-05-27 01:19:19] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-27 01:19:19] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
[2026-05-27 01:19:19] [INFO ] Invariant cache hit.
[2026-05-27 01:19:19] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-27 01:19:19] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2026-05-27 01:19:19] [INFO ] Redundant transitions in 3 ms returned []
Running 407 sub problems to find dead transitions.
[2026-05-27 01:19:19] [INFO ] Flow matrix only has 393 transitions (discarded 19 similar events)
[2026-05-27 01:19:19] [INFO ] Invariant cache hit.
[2026-05-27 01:19:19] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 392/536 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 536/537 variables, and 168 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/144 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 392/536 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 9/168 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/536 variables, 407/575 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 536/537 variables, and 575 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60728 ms. Remains : 144/144 places, 412/412 transitions.
Built C files in :
/tmp/ltsmin10394703778236401619
[2026-05-27 01:20:19] [INFO ] Computing symmetric may disable matrix : 412 transitions.
[2026-05-27 01:20:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:20:19] [INFO ] Computing symmetric may enable matrix : 412 transitions.
[2026-05-27 01:20:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:20:19] [INFO ] Computing Do-Not-Accords matrix : 412 transitions.
[2026-05-27 01:20:19] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:20:19] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10394703778236401619
Running compilation step : cd /tmp/ltsmin10394703778236401619;'/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 1531 ms.
Running link step : cd /tmp/ltsmin10394703778236401619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10394703778236401619;'/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/stateBased13725011169833493484.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 01:20:34] [INFO ] Flatten gal took : 13 ms
[2026-05-27 01:20:34] [INFO ] Flatten gal took : 15 ms
[2026-05-27 01:20:34] [INFO ] Time to serialize gal into /tmp/LTL8857917795881887017.gal : 3 ms
[2026-05-27 01:20:34] [INFO ] Time to serialize properties into /tmp/LTL2299918832992118599.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/LTL8857917795881887017.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10232403341678346882.hoa' '-atoms' '/tmp/LTL2299918832992118599.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/LTL2299918832992118599.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10232403341678346882.hoa
Detected timeout of ITS tools.
[2026-05-27 01:20:49] [INFO ] Flatten gal took : 14 ms
[2026-05-27 01:20:49] [INFO ] Flatten gal took : 13 ms
[2026-05-27 01:20:50] [INFO ] Time to serialize gal into /tmp/LTL5794518541719483572.gal : 3 ms
[2026-05-27 01:20:50] [INFO ] Time to serialize properties into /tmp/LTL10991086772723450719.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/LTL5794518541719483572.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10991086772723450719.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("((p12==0)||(p140==0))"))))
Formula 0 simplified : FG!"((p12==0)||(p140==0))"
Detected timeout of ITS tools.
[2026-05-27 01:21:05] [INFO ] Flatten gal took : 10 ms
[2026-05-27 01:21:05] [INFO ] Applying decomposition
[2026-05-27 01:21:05] [INFO ] Flatten gal took : 10 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/graph15562691163094666282.txt' '-o' '/tmp/graph15562691163094666282.bin' '-w' '/tmp/graph15562691163094666282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15562691163094666282.bin' '-l' '-1' '-v' '-w' '/tmp/graph15562691163094666282.weights' '-q' '0' '-e' '0.001'
[2026-05-27 01:21:05] [INFO ] Decomposing Gal with order
[2026-05-27 01:21:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 01:21:05] [INFO ] Removed a total of 664 redundant transitions.
[2026-05-27 01:21:05] [INFO ] Flatten gal took : 29 ms
[2026-05-27 01:21:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 187 labels/synchronizations in 11 ms.
[2026-05-27 01:21:05] [INFO ] Time to serialize gal into /tmp/LTL13055707193385841192.gal : 4 ms
[2026-05-27 01:21:05] [INFO ] Time to serialize properties into /tmp/LTL10256597947130498942.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/LTL13055707193385841192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10256597947130498942.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i3.i1.u3.p12==0)||(i3.i1.u15.p140==0))"))))
Formula 0 simplified : FG!"((i3.i1.u3.p12==0)||(i3.i1.u15.p140==0))"
Detected timeout of ITS tools.
Treatment of property FireWire-PT-18-LTLFireability-12 finished in 397018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U X(X((F(G(p0))&&!p1))))))'
Support contains 5 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 295 transition count 502
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 295 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 295 transition count 501
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 290 transition count 493
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 290 transition count 493
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 287 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 287 transition count 487
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 286 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 286 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 285 transition count 482
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 285 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 284 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 284 transition count 479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 283 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 283 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 282 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 282 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 281 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 281 transition count 472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 280 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 280 transition count 469
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 279 transition count 467
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 279 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 278 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 278 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 277 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 277 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 276 transition count 460
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 276 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 275 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 275 transition count 458
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 274 transition count 457
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 274 transition count 457
Applied a total of 67 rules in 43 ms. Remains 274 /307 variables (removed 33) and now considering 457/558 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11076716881762103041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3512176873547374875.kers'
[2026-05-27 01:21:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11076716881762103041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3512176873547374875.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 457 rows 274 cols 1410 entries
Finished phase 1 with 267 SingleSign rule and 0 generalized
[2026-05-27 01:21:20] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3512176873547374875.kers
Total runtime 3 ms.
[2026-05-27 01:21:20] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-27 01:21:20] [INFO ] Invariant cache hit.
[2026-05-27 01:21:21] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Running 456 sub problems to find dead transitions.
[2026-05-27 01:21:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 274/731 variables, and 17 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/274 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/731 variables, and 27 constraints, problems are : Problem set: 0 solved, 456 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/274 constraints, PredecessorRefiner: 0/456 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 456 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in LTL mode, iteration 1 : 274/307 places, 457/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61024 ms. Remains : 274/307 places, 457/558 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U X(X((F(G(p0))&&!p1))))))'
Stuttering acceptance computed with spot in 473 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, false, false]
Running random walk in product with property : FireWire-PT-18-LTLFireability-13
Product exploration explored 100000 steps with 4 reset in 188 ms.
Product exploration explored 100000 steps with 7 reset in 212 ms.
Computed a total of 67 stabilizing places and 97 stable transitions
Computed a total of 67 stabilizing places and 97 stable transitions
Detected a total of 67/274 stabilizing places and 97/457 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (19 resets) in 235 ms. (169 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (11 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (13 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
[2026-05-27 01:22:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/250 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 433/683 variables, 250/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/707 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/723 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/723 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 8/731 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/731 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 731/731 variables, and 283 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/250 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 433/683 variables, 250/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/707 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/707 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/723 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/723 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/731 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/731 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/731 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 731/731 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1174 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2390ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 485 ms.
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 457/457 transitions.
Graph (trivial) has 196 edges and 274 vertex of which 11 / 274 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 266 transition count 408
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 76 place count 231 transition count 403
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 229 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 228 transition count 402
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 80 place count 228 transition count 374
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 136 place count 200 transition count 374
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 180 place count 178 transition count 352
Performed 29 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 238 place count 149 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 240 place count 149 transition count 414
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 253 place count 149 transition count 401
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 271 place count 136 transition count 396
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 275 place count 132 transition count 392
Iterating global reduction 5 with 4 rules applied. Total rules applied 279 place count 132 transition count 392
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 285 place count 132 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 296 place count 132 transition count 375
Applied a total of 296 rules in 57 ms. Remains 132 /274 variables (removed 142) and now considering 375/457 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 132/274 places, 375/457 transitions.
RANDOM walk for 40000 steps (1786 resets) in 184 ms. (216 steps per ms) remains 1/2 properties
BEST_FIRST walk for 13255 steps (102 resets) in 24 ms. (530 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 442 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, false, false]
Knowledge-based reduction took 4008 ms.
Stuttering acceptance computed with spot in 418 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, false, false]
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 457/457 transitions.
Applied a total of 0 rules in 4 ms. Remains 274 /274 variables (removed 0) and now considering 457/457 (removed 0) transitions.
[2026-05-27 01:22:26] [INFO ] Invariant cache hit.
[2026-05-27 01:22:26] [INFO ] Implicit Places using invariants in 332 ms returned []
[2026-05-27 01:22:26] [INFO ] Invariant cache hit.
[2026-05-27 01:22:27] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1071 ms. Remains : 274/274 places, 457/457 transitions.
Computed a total of 67 stabilizing places and 97 stable transitions
Computed a total of 67 stabilizing places and 97 stable transitions
Detected a total of 67/274 stabilizing places and 97/457 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (23 resets) in 129 ms. (307 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (16 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (11 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
[2026-05-27 01:22:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/250 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 433/683 variables, 250/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 24/707 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/707 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 16/723 variables, 6/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/723 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 8/731 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/731 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/731 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 731/731 variables, and 283 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/250 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 433/683 variables, 250/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/707 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/707 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 16/723 variables, 6/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/723 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/731 variables, 6/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/731 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/731 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 731/731 variables, and 285 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2405ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 501 ms.
Support contains 5 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 457/457 transitions.
Graph (trivial) has 196 edges and 274 vertex of which 11 / 274 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 266 transition count 408
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 76 place count 231 transition count 403
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 229 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 228 transition count 402
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 80 place count 228 transition count 374
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 136 place count 200 transition count 374
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 180 place count 178 transition count 352
Performed 29 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 238 place count 149 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 240 place count 149 transition count 414
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 253 place count 149 transition count 401
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 271 place count 136 transition count 396
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 275 place count 132 transition count 392
Iterating global reduction 5 with 4 rules applied. Total rules applied 279 place count 132 transition count 392
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 285 place count 132 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 296 place count 132 transition count 375
Applied a total of 296 rules in 62 ms. Remains 132 /274 variables (removed 142) and now considering 375/457 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 132/274 places, 375/457 transitions.
RANDOM walk for 40000 steps (1814 resets) in 171 ms. (232 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3312 steps (31 resets) in 9 ms. (331 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 458 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, false, false]
Knowledge-based reduction took 3946 ms.
Stuttering acceptance computed with spot in 457 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 452 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 8 reset in 193 ms.
Product exploration explored 100000 steps with 15 reset in 217 ms.
Spot run failed in 154 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/ltsmin10449788151286096226
[2026-05-27 01:22:33] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10449788151286096226
Running compilation step : cd /tmp/ltsmin10449788151286096226;'/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 1223 ms.
Running link step : cd /tmp/ltsmin10449788151286096226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10449788151286096226;'/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/stateBased3484640743888197268.hoa' '--buchi-type=spotba'
LTSmin run took 593 ms.
FORMULA FireWire-PT-18-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLFireability-13 finished in 74805 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(G(p0))))'
Support contains 1 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 295 transition count 502
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 295 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 295 transition count 501
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 290 transition count 493
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 290 transition count 493
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 287 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 287 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 285 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 285 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 283 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 283 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 281 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 281 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 279 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 279 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 277 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 277 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 275 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 275 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 273 transition count 451
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 273 transition count 451
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 271 transition count 447
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 271 transition count 447
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 269 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 269 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 267 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 267 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 265 transition count 435
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 265 transition count 435
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 264 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 263 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 263 transition count 432
Applied a total of 89 rules in 42 ms. Remains 263 /307 variables (removed 44) and now considering 432/558 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11141105298389016085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6883457454779481250.kers'
[2026-05-27 01:22:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11141105298389016085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6883457454779481250.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 432 rows 263 cols 1312 entries
Finished phase 1 with 256 SingleSign rule and 0 generalized
[2026-05-27 01:22:35] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6883457454779481250.kers
Total runtime 4 ms.
[2026-05-27 01:22:35] [INFO ] Implicit Places using invariants in 266 ms returned []
[2026-05-27 01:22:35] [INFO ] Invariant cache hit.
[2026-05-27 01:22:35] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2026-05-27 01:22:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (OVERLAPS) 432/695 variables, 263/279 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 695/695 variables, and 280 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 263/695 variables, and 32 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/263 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 263/307 places, 432/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61023 ms. Remains : 263/307 places, 432/558 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-14 finished in 61222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((p0||X(p1)))&&(p2||G(p3))))))'
Support contains 6 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 558/558 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 296 transition count 503
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 296 transition count 503
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 296 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 293 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 293 transition count 496
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 291 transition count 492
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 291 transition count 492
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 290 transition count 489
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 290 transition count 489
Applied a total of 35 rules in 23 ms. Remains 290 /307 variables (removed 17) and now considering 489/558 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14693229000284783371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14641028880736643187.kers'
[2026-05-27 01:23:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14693229000284783371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14641028880736643187.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 489 rows 290 cols 1530 entries
Finished phase 1 with 283 SingleSign rule and 0 generalized
[2026-05-27 01:23:36] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14641028880736643187.kers
Total runtime 4 ms.
[2026-05-27 01:23:36] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-05-27 01:23:36] [INFO ] Invariant cache hit.
[2026-05-27 01:23:37] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Running 488 sub problems to find dead transitions.
[2026-05-27 01:23:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 290/779 variables, and 21 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/290 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 1/290 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 290/779 variables, and 31 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/290 constraints, PredecessorRefiner: 0/488 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 488 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in LTL mode, iteration 1 : 290/307 places, 489/558 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61347 ms. Remains : 290/307 places, 489/558 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((p0||X(p1)))&&(p2||G(p3))))))'
Stuttering acceptance computed with spot in 287 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-18-LTLFireability-15
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLFireability-15 finished in 61696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 83 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' '!((!((p1 U p2)||p0) U G(!p1)))'
Spot run failed in 77 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 76 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-27 01:24:38] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17038957092078579530
[2026-05-27 01:24:38] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2026-05-27 01:24:38] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:24:38] [INFO ] Applying decomposition
[2026-05-27 01:24:38] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2026-05-27 01:24:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:24:38] [INFO ] Flatten gal took : 20 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/graph8710746354207185193.txt' '-o' '/tmp/graph8710746354207185193.bin' '-w' '/tmp/graph8710746354207185193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8710746354207185193.bin' '-l' '-1' '-v' '-w' '/tmp/graph8710746354207185193.weights' '-q' '0' '-e' '0.001'
[2026-05-27 01:24:38] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2026-05-27 01:24:38] [INFO ] Decomposing Gal with order
[2026-05-27 01:24:38] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 01:24:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 01:24:38] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17038957092078579530
Running compilation step : cd /tmp/ltsmin17038957092078579530;'/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-27 01:24:38] [INFO ] Removed a total of 655 redundant transitions.
[2026-05-27 01:24:38] [INFO ] Flatten gal took : 51 ms
[2026-05-27 01:24:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 20 ms.
[2026-05-27 01:24:38] [INFO ] Time to serialize gal into /tmp/LTLFireability4613750488982841229.gal : 8 ms
[2026-05-27 01:24:38] [INFO ] Time to serialize properties into /tmp/LTLFireability15135623212860300005.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/LTLFireability4613750488982841229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15135623212860300005.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 : !((F(G("((i2.i0.u5.p19==0)||(i2.i0.u50.p230==0))"))))
Formula 0 simplified : GF!"((i2.i0.u5.p19==0)||(i2.i0.u50.p230==0))"
Compilation finished in 2258 ms.
Running link step : cd /tmp/ltsmin17038957092078579530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17038957092078579530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t66, t73, t166, t205, t206, t208, t217, t219, t226, t232, t234, t266, t267, t268, t269, t321,...1529
Computing Next relation with stutter on 1.48217e+07 deadlock states
LTSmin run took 99231 ms.
FORMULA FireWire-PT-18-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin17038957092078579530;'/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' '(!(((LTLAPp2==true) U (LTLAPp3==true))||(LTLAPp1==true)) U [](!(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17038957092078579530;'/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' '(!(((LTLAPp2==true) U (LTLAPp3==true))||(LTLAPp1==true)) U [](!(LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17038957092078579530;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17038957092078579530;'/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' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin17038957092078579530;'/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' '(!(((LTLAPp2==true) U (LTLAPp3==true))||(LTLAPp1==true)) U [](!(LTLAPp2==true)))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-18"
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-18, 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-177955809000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 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 ;