About the Execution of ITS-Tools for FlexibleBarrier-PT-16b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16203.283 | 3600000.00 | 6012216.00 | 143105.60 | T?FFFFFFFFFTFTFF | 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-177955809100412.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 FlexibleBarrier-PT-16b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100412
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.2K Mar 7 05:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 05:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 05:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 05:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 10:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 7 05:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 945K 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 FlexibleBarrier-PT-16b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-16b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779911879421
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 19:58:01] [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 19:58:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 19:58:02] [INFO ] Load time of PNML (sax parser for PT used): 517 ms
[2026-05-27 19:58:02] [INFO ] Transformed 3472 places.
[2026-05-27 19:58:02] [INFO ] Transformed 4001 transitions.
[2026-05-27 19:58:02] [INFO ] Found NUPN structural information;
[2026-05-27 19:58:02] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 822 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 3472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1418 places :
Symmetric choice reduction at 0 with 1418 rule applications. Total rules 1418 place count 2054 transition count 2583
Iterating global reduction 0 with 1418 rules applied. Total rules applied 2836 place count 2054 transition count 2583
Discarding 672 places :
Symmetric choice reduction at 0 with 672 rule applications. Total rules 3508 place count 1382 transition count 1911
Iterating global reduction 0 with 672 rules applied. Total rules applied 4180 place count 1382 transition count 1911
Discarding 421 places :
Symmetric choice reduction at 0 with 421 rule applications. Total rules 4601 place count 961 transition count 1490
Iterating global reduction 0 with 421 rules applied. Total rules applied 5022 place count 961 transition count 1490
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 200 rules applied. Total rules applied 5222 place count 961 transition count 1290
Applied a total of 5222 rules in 1140 ms. Remains 961 /3472 variables (removed 2511) and now considering 1290/4001 (removed 2711) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3117420416068931300.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4517925770260538997.kers'
[2026-05-27 19:58:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3117420416068931300.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4517925770260538997.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1290 rows 961 cols 3821 entries
Finished phase 1 with 943 SingleSign rule and 0 generalized
[2026-05-27 19:58:04] [INFO ] Computed 18 invariants in 8 ms
Computed 18 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4517925770260538997.kers
Total runtime 11 ms.
[2026-05-27 19:58:07] [INFO ] Implicit Places using invariants in 2673 ms returned []
[2026-05-27 19:58:07] [INFO ] Invariant cache hit.
[2026-05-27 19:58:10] [INFO ] Implicit Places using invariants and state equation in 3204 ms returned []
Implicit Place search using SMT with State Equation took 5929 ms to find 0 implicit places.
Running 1289 sub problems to find dead transitions.
[2026-05-27 19:58:10] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/2251 variables, and 0 constraints, problems are : Problem set: 0 solved, 1289 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/961 constraints, PredecessorRefiner: 1289/1289 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1289 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/2251 variables, and 0 constraints, problems are : Problem set: 0 solved, 1289 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/961 constraints, PredecessorRefiner: 0/1289 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61393ms problems are : Problem set: 0 solved, 1289 unsolved
Search for dead transitions found 0 dead transitions in 61438ms
Starting structural reductions in LTL mode, iteration 1 : 961/3472 places, 1290/4001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68586 ms. Remains : 961/3472 places, 1290/4001 transitions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Applied a total of 0 rules in 133 ms. Remains 961 /961 variables (removed 0) and now considering 1290/1290 (removed 0) transitions.
[2026-05-27 19:59:11] [INFO ] Invariant cache hit.
[2026-05-27 19:59:13] [INFO ] Implicit Places using invariants in 1829 ms returned []
[2026-05-27 19:59:13] [INFO ] Invariant cache hit.
[2026-05-27 19:59:16] [INFO ] Implicit Places using invariants and state equation in 2456 ms returned []
Implicit Place search using SMT with State Equation took 4310 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4454 ms. Remains : 961/961 places, 1290/1290 transitions.
Support contains 60 out of 961 places after structural reductions.
[2026-05-27 19:59:16] [INFO ] Flatten gal took : 229 ms
[2026-05-27 19:59:16] [INFO ] Flatten gal took : 122 ms
[2026-05-27 19:59:17] [INFO ] Input system was already deterministic with 1290 transitions.
RANDOM walk for 40000 steps (355 resets) in 2340 ms. (17 steps per ms) remains 28/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
[2026-05-27 19:59:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 828/873 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 88/961 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/961 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1290/2251 variables, 961/979 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2251 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2251/2251 variables, and 979 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 961/961 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 828/873 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/873 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 873/2251 variables, and 19 constraints, problems are : Problem set: 0 solved, 28 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 15/18 constraints, State Equation: 0/961 constraints, PredecessorRefiner: 0/28 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10046ms problems are : Problem set: 0 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 961 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Graph (trivial) has 827 edges and 961 vertex of which 85 / 961 are part of one of the 14 SCC in 17 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 890 transition count 1127
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 813 transition count 1127
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 155 place count 813 transition count 1092
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 225 place count 778 transition count 1092
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 255 place count 748 transition count 1062
Iterating global reduction 2 with 30 rules applied. Total rules applied 285 place count 748 transition count 1062
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 286 place count 748 transition count 1061
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 290 place count 744 transition count 1057
Iterating global reduction 3 with 4 rules applied. Total rules applied 294 place count 744 transition count 1057
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 295 place count 744 transition count 1056
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 509 place count 637 transition count 949
Drop transitions (Empty/Sink Transition effects.) removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 538 place count 637 transition count 920
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 554 place count 621 transition count 904
Iterating global reduction 5 with 16 rules applied. Total rules applied 570 place count 621 transition count 904
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 571 place count 621 transition count 903
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 575 place count 619 transition count 903
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 579 place count 619 transition count 899
Free-agglomeration rule applied 449 times.
Iterating global reduction 6 with 449 rules applied. Total rules applied 1028 place count 619 transition count 450
Reduce places removed 449 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Iterating post reduction 6 with 524 rules applied. Total rules applied 1552 place count 170 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 7 with 35 rules applied. Total rules applied 1587 place count 170 transition count 340
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1589 place count 170 transition count 340
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1590 place count 170 transition count 340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1591 place count 169 transition count 339
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 82 edges and 168 vertex of which 28 / 168 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 1594 place count 154 transition count 338
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 1623 place count 153 transition count 310
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 1623 place count 153 transition count 294
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1655 place count 137 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 1671 place count 137 transition count 278
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 1711 place count 117 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1713 place count 117 transition count 256
Free-agglomeration rule applied 15 times.
Iterating global reduction 11 with 15 rules applied. Total rules applied 1728 place count 117 transition count 241
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 11 with 38 rules applied. Total rules applied 1766 place count 100 transition count 220
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1770 place count 96 transition count 216
Iterating global reduction 12 with 4 rules applied. Total rules applied 1774 place count 96 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1778 place count 96 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 13 with 62 rules applied. Total rules applied 1840 place count 96 transition count 150
Applied a total of 1840 rules in 1005 ms. Remains 96 /961 variables (removed 865) and now considering 150/1290 (removed 1140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1005 ms. Remains : 96/961 places, 150/1290 transitions.
RANDOM walk for 40000 steps (8 resets) in 534 ms. (74 steps per ms) remains 10/28 properties
BEST_FIRST walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 247 ms. (161 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 156 ms. (254 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/2 properties
BEST_FIRST walk for 27339 steps (6 resets) in 104 ms. (260 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-16b-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 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' '!(X(X((F(p0) U !p1))))'
Support contains 5 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 932 transition count 1261
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 932 transition count 1261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 65 place count 932 transition count 1254
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 85 place count 912 transition count 1234
Iterating global reduction 1 with 20 rules applied. Total rules applied 105 place count 912 transition count 1234
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 120 place count 912 transition count 1219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 909 transition count 1216
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 909 transition count 1216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 128 place count 909 transition count 1214
Applied a total of 128 rules in 197 ms. Remains 909 /961 variables (removed 52) and now considering 1214/1290 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16871523152966442414.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12907307063308289165.kers'
[2026-05-27 19:59:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16871523152966442414.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12907307063308289165.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1214 rows 909 cols 3573 entries
Finished phase 1 with 891 SingleSign rule and 0 generalized
[2026-05-27 19:59:30] [INFO ] Computed 18 invariants in 12 ms
Computed 18 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-12907307063308289165.kers
Total runtime 15 ms.
[2026-05-27 19:59:31] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2026-05-27 19:59:31] [INFO ] Invariant cache hit.
[2026-05-27 19:59:34] [INFO ] Implicit Places using invariants and state equation in 2346 ms returned []
Implicit Place search using SMT with State Equation took 3780 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2026-05-27 19:59:34] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/2123 variables, and 0 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 908/2123 variables, and 0 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60727ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 60733ms
Starting structural reductions in LTL mode, iteration 1 : 909/961 places, 1214/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64719 ms. Remains : 909/961 places, 1214/1290 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((F(p0) U !p1))))'
Stuttering acceptance computed with spot in 495 ms :[p1, p1, p1, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 806 ms.
Product exploration explored 100000 steps with 33333 reset in 384 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 22 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 51 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-00 finished in 66577 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((G(p1)||p0))))'
Support contains 5 out of 961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Graph (trivial) has 891 edges and 961 vertex of which 91 / 961 are part of one of the 15 SCC in 3 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 884 transition count 1126
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 798 transition count 1126
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 173 place count 798 transition count 1090
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 245 place count 762 transition count 1090
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 301 place count 706 transition count 1034
Iterating global reduction 2 with 56 rules applied. Total rules applied 357 place count 706 transition count 1034
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 364 place count 706 transition count 1027
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 364 place count 706 transition count 1026
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 366 place count 705 transition count 1026
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 376 place count 695 transition count 1016
Iterating global reduction 3 with 10 rules applied. Total rules applied 386 place count 695 transition count 1016
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 396 place count 695 transition count 1006
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 598 place count 594 transition count 905
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 604 place count 588 transition count 899
Iterating global reduction 4 with 6 rules applied. Total rules applied 610 place count 588 transition count 899
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 616 place count 588 transition count 893
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 618 place count 587 transition count 893
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 635 place count 587 transition count 876
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 637 place count 585 transition count 874
Applied a total of 637 rules in 573 ms. Remains 585 /961 variables (removed 376) and now considering 874/1290 (removed 416) transitions.
[2026-05-27 20:00:37] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9446157456806409371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-773416240097740521.kers'
[2026-05-27 20:00:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9446157456806409371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-773416240097740521.kers]
Normalized transition count is 843 out of 844 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 843 rows 584 cols 2625 entries
Finished phase 1 with 567 SingleSign rule and 0 generalized
[2026-05-27 20:00:37] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-773416240097740521.kers
Total runtime 8 ms.
[2026-05-27 20:00:38] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2026-05-27 20:00:38] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
[2026-05-27 20:00:38] [INFO ] Invariant cache hit.
[2026-05-27 20:00:40] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 3167 ms to find 0 implicit places.
[2026-05-27 20:00:40] [INFO ] Redundant transitions in 72 ms returned []
Running 389 sub problems to find dead transitions.
[2026-05-27 20:00:40] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
[2026-05-27 20:00:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 16/585 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/1429 variables, and 18 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/585 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/569 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/569 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 16/585 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 843/1428 variables, 585/603 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 389/992 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 992 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60390ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Starting structural reductions in SI_LTL mode, iteration 1 : 585/961 places, 874/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64217 ms. Remains : 585/961 places, 874/1290 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-01
Product exploration explored 100000 steps with 4262 reset in 1187 ms.
Product exploration explored 100000 steps with 4268 reset in 1090 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 57 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1746 resets) in 1514 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 515 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 328765 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 4
Probabilistic random walk after 328765 steps, saw 81875 distinct states, run finished after 3010 ms. (steps per millisecond=109 ) properties seen :0
[2026-05-27 20:01:47] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
[2026-05-27 20:01:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 530/827 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 471/1298 variables, 210/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 78/1376 variables, 13/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1376 variables, 26/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 52/1428 variables, 52/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 4 unsolved in 919 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 530/827 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 471/1298 variables, 210/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1298 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 78/1376 variables, 13/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 26/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1376 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 52/1428 variables, 52/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2200 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3131ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 78 steps, including 2 resets, run visited all 4 properties in 5 ms. (steps per millisecond=15 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 14 ms.
Knowledge based reduction with 9 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 7371 ms.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 874/874 transitions.
Applied a total of 0 rules in 75 ms. Remains 585 /585 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2026-05-27 20:01:51] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
[2026-05-27 20:01:51] [INFO ] Invariant cache hit.
[2026-05-27 20:01:52] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2026-05-27 20:01:52] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
[2026-05-27 20:01:52] [INFO ] Invariant cache hit.
[2026-05-27 20:01:53] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned []
Implicit Place search using SMT with State Equation took 2920 ms to find 0 implicit places.
[2026-05-27 20:01:53] [INFO ] Redundant transitions in 19 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3021 ms. Remains : 585/585 places, 874/874 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 55 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1739 resets) in 751 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 296940 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 4
Probabilistic random walk after 296940 steps, saw 75917 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2026-05-27 20:01:57] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
[2026-05-27 20:01:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 530/827 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 471/1298 variables, 210/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 78/1376 variables, 13/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1376 variables, 26/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 52/1428 variables, 52/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1428 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 603 constraints, problems are : Problem set: 0 solved, 4 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 530/827 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/827 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 471/1298 variables, 210/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1298 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 78/1376 variables, 13/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 26/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1376 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 52/1428 variables, 52/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1428 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 607 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1911 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2889ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 76 steps, including 2 resets, run visited all 4 properties in 4 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 6 ms.
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 6740 ms.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4264 reset in 1129 ms.
Product exploration explored 100000 steps with 4273 reset in 970 ms.
Built C files in :
/tmp/ltsmin4590667508815021011
[2026-05-27 20:02:02] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2026-05-27 20:02:03] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 20:02:03] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2026-05-27 20:02:03] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 20:02:03] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2026-05-27 20:02:03] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 20:02:03] [INFO ] Built C files in 307ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4590667508815021011
Running compilation step : cd /tmp/ltsmin4590667508815021011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4590667508815021011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4590667508815021011;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 585 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 585/585 places, 874/874 transitions.
Applied a total of 0 rules in 51 ms. Remains 585 /585 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2026-05-27 20:02:06] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
[2026-05-27 20:02:06] [INFO ] Invariant cache hit.
[2026-05-27 20:02:07] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2026-05-27 20:02:07] [INFO ] Flow matrix only has 844 transitions (discarded 30 similar events)
[2026-05-27 20:02:07] [INFO ] Invariant cache hit.
[2026-05-27 20:02:09] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 2968 ms to find 0 implicit places.
[2026-05-27 20:02:09] [INFO ] Redundant transitions in 8 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3032 ms. Remains : 585/585 places, 874/874 transitions.
Built C files in :
/tmp/ltsmin4153737996957514792
[2026-05-27 20:02:09] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2026-05-27 20:02:09] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 20:02:09] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2026-05-27 20:02:09] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 20:02:09] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2026-05-27 20:02:09] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 20:02:09] [INFO ] Built C files in 208ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4153737996957514792
Running compilation step : cd /tmp/ltsmin4153737996957514792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4153737996957514792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4153737996957514792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 20:02:12] [INFO ] Flatten gal took : 76 ms
[2026-05-27 20:02:12] [INFO ] Flatten gal took : 72 ms
[2026-05-27 20:02:12] [INFO ] Time to serialize gal into /tmp/LTL9069896997589473749.gal : 17 ms
[2026-05-27 20:02:12] [INFO ] Time to serialize properties into /tmp/LTL6771005246774178069.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/LTL9069896997589473749.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10896225814461396214.hoa' '-atoms' '/tmp/LTL6771005246774178069.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/LTL6771005246774178069.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10896225814461396214.hoa
Detected timeout of ITS tools.
[2026-05-27 20:02:28] [INFO ] Flatten gal took : 41 ms
[2026-05-27 20:02:28] [INFO ] Flatten gal took : 38 ms
[2026-05-27 20:02:28] [INFO ] Time to serialize gal into /tmp/LTL8806918221043232283.gal : 10 ms
[2026-05-27 20:02:28] [INFO ] Time to serialize properties into /tmp/LTL8646763430929121376.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8806918221043232283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8646763430929121376.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(p2150==0)"))||("(((p604==1)&&(p2161==1))&&(p3328==1))"))||("((p2150==1)&&(p1191==1))")))))
Formula 0 simplified : G(F!"(p2150==0)" & FG(!"(((p604==1)&&(p2161==1))&&(p3328==1))" & !"((p2150==1)&&(p1191==1))"))
Detected timeout of ITS tools.
[2026-05-27 20:02:43] [INFO ] Flatten gal took : 29 ms
[2026-05-27 20:02:43] [INFO ] Applying decomposition
[2026-05-27 20:02:43] [INFO ] Flatten gal took : 27 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/graph251449619610204280.txt' '-o' '/tmp/graph251449619610204280.bin' '-w' '/tmp/graph251449619610204280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph251449619610204280.bin' '-l' '-1' '-v' '-w' '/tmp/graph251449619610204280.weights' '-q' '0' '-e' '0.001'
[2026-05-27 20:02:43] [INFO ] Decomposing Gal with order
[2026-05-27 20:02:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 20:02:43] [INFO ] Removed a total of 355 redundant transitions.
[2026-05-27 20:02:44] [INFO ] Flatten gal took : 466 ms
[2026-05-27 20:02:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 27 ms.
[2026-05-27 20:02:44] [INFO ] Time to serialize gal into /tmp/LTL10123002158684069585.gal : 15 ms
[2026-05-27 20:02:44] [INFO ] Time to serialize properties into /tmp/LTL2734357974760897465.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/LTL10123002158684069585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2734357974760897465.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(((G("(i14.u44.p2150==0)"))||("(((i3.u11.p604==1)&&(i14.u44.p2161==1))&&(u48.p3328==1))"))||("((i14.u44.p2150==1)&&(i7.u23.p1191...166
Formula 0 simplified : G(F!"(i14.u44.p2150==0)" & FG(!"(((i3.u11.p604==1)&&(i14.u44.p2161==1))&&(u48.p3328==1))" & !"((i14.u44.p2150==1)&&(i7.u23.p1191==1)...159
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-01 finished in 142420 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(G(p0)) U p1))||((p2||F(p3)) U p4)))'
Support contains 7 out of 961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Graph (trivial) has 885 edges and 961 vertex of which 90 / 961 are part of one of the 15 SCC in 2 ms
Free SCC test removed 75 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 885 transition count 1127
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 177 place count 798 transition count 1125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 797 transition count 1125
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 178 place count 797 transition count 1089
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 250 place count 761 transition count 1089
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 305 place count 706 transition count 1034
Iterating global reduction 3 with 55 rules applied. Total rules applied 360 place count 706 transition count 1034
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 367 place count 706 transition count 1027
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 367 place count 706 transition count 1026
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 369 place count 705 transition count 1026
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 377 place count 697 transition count 1018
Iterating global reduction 4 with 8 rules applied. Total rules applied 385 place count 697 transition count 1018
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 393 place count 697 transition count 1010
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 5 with 198 rules applied. Total rules applied 591 place count 598 transition count 911
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 598 place count 591 transition count 904
Iterating global reduction 5 with 7 rules applied. Total rules applied 605 place count 591 transition count 904
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 612 place count 591 transition count 897
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 614 place count 590 transition count 897
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 631 place count 590 transition count 880
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 633 place count 588 transition count 878
Applied a total of 633 rules in 424 ms. Remains 588 /961 variables (removed 373) and now considering 878/1290 (removed 412) transitions.
[2026-05-27 20:02:59] [INFO ] Flow matrix only has 848 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14753821659058688570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13471780104688845186.kers'
[2026-05-27 20:02:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14753821659058688570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13471780104688845186.kers]
Normalized transition count is 847 out of 848 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 847 rows 587 cols 2637 entries
Finished phase 1 with 570 SingleSign rule and 0 generalized
[2026-05-27 20:02:59] [INFO ] Computed 18 invariants in 9 ms
Computed 18 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-13471780104688845186.kers
Total runtime 11 ms.
[2026-05-27 20:03:01] [INFO ] Implicit Places using invariants in 1380 ms returned []
[2026-05-27 20:03:01] [INFO ] Flow matrix only has 848 transitions (discarded 30 similar events)
[2026-05-27 20:03:01] [INFO ] Invariant cache hit.
[2026-05-27 20:03:02] [INFO ] Implicit Places using invariants and state equation in 1790 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
[2026-05-27 20:03:02] [INFO ] Redundant transitions in 8 ms returned []
Running 394 sub problems to find dead transitions.
[2026-05-27 20:03:02] [INFO ] Flow matrix only has 848 transitions (discarded 30 similar events)
[2026-05-27 20:03:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 16/588 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/1436 variables, and 18 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/588 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 16/588 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 394 unsolved
SMT process timed out in 60320ms, After SMT, problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 60322ms
Starting structural reductions in SI_LTL mode, iteration 1 : 588/961 places, 878/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63934 ms. Remains : 588/961 places, 878/1290 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(G(p0)) U p1))||((p2||F(p3)) U p4)))'
Stuttering acceptance computed with spot in 399 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p4)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-02 finished in 64391 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((G(p0) U (p1&&F((p2||X(X(p3)))))))))'
Support contains 5 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 932 transition count 1261
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 932 transition count 1261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 66 place count 932 transition count 1253
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 85 place count 913 transition count 1234
Iterating global reduction 1 with 19 rules applied. Total rules applied 104 place count 913 transition count 1234
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 118 place count 913 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 122 place count 909 transition count 1216
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 909 transition count 1216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 128 place count 909 transition count 1214
Applied a total of 128 rules in 276 ms. Remains 909 /961 variables (removed 52) and now considering 1214/1290 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13280920157368356493.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16750900053947236979.kers'
[2026-05-27 20:04:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13280920157368356493.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16750900053947236979.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1214 rows 909 cols 3573 entries
Finished phase 1 with 891 SingleSign rule and 0 generalized
[2026-05-27 20:04:03] [INFO ] Computed 18 invariants in 18 ms
Computed 18 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-16750900053947236979.kers
Total runtime 21 ms.
[2026-05-27 20:04:05] [INFO ] Implicit Places using invariants in 1535 ms returned []
[2026-05-27 20:04:05] [INFO ] Invariant cache hit.
[2026-05-27 20:04:07] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 3639 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2026-05-27 20:04:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/2123 variables, and 0 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 908/2123 variables, and 0 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60657ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 60661ms
Starting structural reductions in LTL mode, iteration 1 : 909/961 places, 1214/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64580 ms. Remains : 909/961 places, 1214/1290 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((G(p0) U (p1&&F((p2||X(X(p3)))))))))'
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-03
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-03 finished in 65073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Graph (trivial) has 910 edges and 961 vertex of which 97 / 961 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 879 transition count 1121
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 793 transition count 1121
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 173 place count 793 transition count 1086
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 243 place count 758 transition count 1086
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 302 place count 699 transition count 1027
Iterating global reduction 2 with 59 rules applied. Total rules applied 361 place count 699 transition count 1027
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 369 place count 699 transition count 1019
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 369 place count 699 transition count 1018
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 371 place count 698 transition count 1018
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 381 place count 688 transition count 1008
Iterating global reduction 3 with 10 rules applied. Total rules applied 391 place count 688 transition count 1008
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 401 place count 688 transition count 998
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 597 place count 590 transition count 900
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 603 place count 584 transition count 894
Iterating global reduction 4 with 6 rules applied. Total rules applied 609 place count 584 transition count 894
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 615 place count 584 transition count 888
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 631 place count 584 transition count 872
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 633 place count 582 transition count 870
Applied a total of 633 rules in 383 ms. Remains 582 /961 variables (removed 379) and now considering 870/1290 (removed 420) transitions.
[2026-05-27 20:05:09] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7684662924115319773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18439448480853132003.kers'
[2026-05-27 20:05:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7684662924115319773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18439448480853132003.kers]
Normalized transition count is 838 out of 839 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 838 rows 581 cols 2611 entries
Finished phase 1 with 564 SingleSign rule and 0 generalized
[2026-05-27 20:05:09] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18439448480853132003.kers
Total runtime 8 ms.
[2026-05-27 20:05:10] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2026-05-27 20:05:10] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2026-05-27 20:05:10] [INFO ] Invariant cache hit.
[2026-05-27 20:05:11] [INFO ] Implicit Places using invariants and state equation in 1691 ms returned []
Implicit Place search using SMT with State Equation took 2874 ms to find 0 implicit places.
[2026-05-27 20:05:11] [INFO ] Redundant transitions in 8 ms returned []
Running 371 sub problems to find dead transitions.
[2026-05-27 20:05:11] [INFO ] Flow matrix only has 839 transitions (discarded 31 similar events)
[2026-05-27 20:05:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/1421 variables, and 18 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 16/582 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 838/1420 variables, 582/600 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1420 variables, 371/971 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1420/1421 variables, and 971 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60194ms
Starting structural reductions in SI_LTL mode, iteration 1 : 582/961 places, 870/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63466 ms. Remains : 582/961 places, 870/1290 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 56 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-04 finished in 63567 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&&(p1||F(p2))))&&F((G(!p0)||(!p0&&F(p3))))))'
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Graph (trivial) has 892 edges and 961 vertex of which 91 / 961 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 884 transition count 1126
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 798 transition count 1126
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 173 place count 798 transition count 1090
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 245 place count 762 transition count 1090
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 300 place count 707 transition count 1035
Iterating global reduction 2 with 55 rules applied. Total rules applied 355 place count 707 transition count 1035
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 363 place count 707 transition count 1027
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 363 place count 707 transition count 1026
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 365 place count 706 transition count 1026
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 374 place count 697 transition count 1017
Iterating global reduction 3 with 9 rules applied. Total rules applied 383 place count 697 transition count 1017
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 392 place count 697 transition count 1008
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 594 place count 596 transition count 907
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 599 place count 591 transition count 902
Iterating global reduction 4 with 5 rules applied. Total rules applied 604 place count 591 transition count 902
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 609 place count 591 transition count 897
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 611 place count 590 transition count 897
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 628 place count 590 transition count 880
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 630 place count 588 transition count 878
Applied a total of 630 rules in 484 ms. Remains 588 /961 variables (removed 373) and now considering 878/1290 (removed 412) transitions.
[2026-05-27 20:06:12] [INFO ] Flow matrix only has 848 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-644551718764641012.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17190472694393434392.kers'
[2026-05-27 20:06:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-644551718764641012.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17190472694393434392.kers]
Normalized transition count is 847 out of 848 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 847 rows 587 cols 2637 entries
Finished phase 1 with 570 SingleSign rule and 0 generalized
[2026-05-27 20:06:12] [INFO ] Computed 18 invariants in 9 ms
Computed 18 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-17190472694393434392.kers
Total runtime 12 ms.
[2026-05-27 20:06:14] [INFO ] Implicit Places using invariants in 1606 ms returned []
[2026-05-27 20:06:14] [INFO ] Flow matrix only has 848 transitions (discarded 30 similar events)
[2026-05-27 20:06:14] [INFO ] Invariant cache hit.
[2026-05-27 20:06:16] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 3437 ms to find 0 implicit places.
[2026-05-27 20:06:16] [INFO ] Redundant transitions in 8 ms returned []
Running 392 sub problems to find dead transitions.
[2026-05-27 20:06:16] [INFO ] Flow matrix only has 848 transitions (discarded 30 similar events)
[2026-05-27 20:06:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 16/588 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 588/1436 variables, and 18 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/588 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 16/588 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 847/1435 variables, 588/606 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1435/1436 variables, and 998 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 588/961 places, 878/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64142 ms. Remains : 588/961 places, 878/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&(p1||F(p2))))&&F((G(!p0)||(!p0&&F(p3))))))'
Stuttering acceptance computed with spot in 301 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), p0, (AND p0 (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-05 finished in 64498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Graph (trivial) has 908 edges and 961 vertex of which 97 / 961 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 879 transition count 1121
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 793 transition count 1121
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 173 place count 793 transition count 1086
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 243 place count 758 transition count 1086
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 303 place count 698 transition count 1026
Iterating global reduction 2 with 60 rules applied. Total rules applied 363 place count 698 transition count 1026
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 371 place count 698 transition count 1018
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 371 place count 698 transition count 1017
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 373 place count 697 transition count 1017
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 383 place count 687 transition count 1007
Iterating global reduction 3 with 10 rules applied. Total rules applied 393 place count 687 transition count 1007
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 403 place count 687 transition count 997
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 599 place count 589 transition count 899
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 605 place count 583 transition count 893
Iterating global reduction 4 with 6 rules applied. Total rules applied 611 place count 583 transition count 893
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 617 place count 583 transition count 887
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 633 place count 583 transition count 871
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 635 place count 581 transition count 869
Applied a total of 635 rules in 443 ms. Remains 581 /961 variables (removed 380) and now considering 869/1290 (removed 421) transitions.
[2026-05-27 20:07:17] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11858573406049633360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16423736039028366807.kers'
[2026-05-27 20:07:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11858573406049633360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16423736039028366807.kers]
Normalized transition count is 837 out of 838 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 837 rows 580 cols 2609 entries
Finished phase 1 with 563 SingleSign rule and 0 generalized
[2026-05-27 20:07:17] [INFO ] Computed 18 invariants in 8 ms
Computed 18 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16423736039028366807.kers
Total runtime 10 ms.
[2026-05-27 20:07:18] [INFO ] Implicit Places using invariants in 1615 ms returned []
[2026-05-27 20:07:18] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2026-05-27 20:07:18] [INFO ] Invariant cache hit.
[2026-05-27 20:07:20] [INFO ] Implicit Places using invariants and state equation in 1875 ms returned []
Implicit Place search using SMT with State Equation took 3492 ms to find 0 implicit places.
[2026-05-27 20:07:20] [INFO ] Redundant transitions in 13 ms returned []
Running 370 sub problems to find dead transitions.
[2026-05-27 20:07:20] [INFO ] Flow matrix only has 838 transitions (discarded 31 similar events)
[2026-05-27 20:07:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 16/581 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1419 variables, and 18 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 16/581 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 837/1418 variables, 581/599 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1418 variables, 370/969 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1418/1419 variables, and 969 constraints, problems are : Problem set: 0 solved, 370 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 581/961 places, 869/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64256 ms. Remains : 581/961 places, 869/1290 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 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-06 finished in 64367 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&&F(p1)&&X(X(G(p2))))))'
Support contains 5 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 933 transition count 1262
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 933 transition count 1262
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 933 transition count 1255
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 83 place count 913 transition count 1235
Iterating global reduction 1 with 20 rules applied. Total rules applied 103 place count 913 transition count 1235
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 118 place count 913 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 910 transition count 1217
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 910 transition count 1217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 910 transition count 1216
Applied a total of 125 rules in 136 ms. Remains 910 /961 variables (removed 51) and now considering 1216/1290 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3868444782384840058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8417943683660754482.kers'
[2026-05-27 20:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3868444782384840058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8417943683660754482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1216 rows 910 cols 3581 entries
Finished phase 1 with 892 SingleSign rule and 0 generalized
[2026-05-27 20:08:21] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8417943683660754482.kers
Total runtime 8 ms.
[2026-05-27 20:08:22] [INFO ] Implicit Places using invariants in 1348 ms returned []
[2026-05-27 20:08:22] [INFO ] Invariant cache hit.
[2026-05-27 20:08:24] [INFO ] Implicit Places using invariants and state equation in 1862 ms returned []
Implicit Place search using SMT with State Equation took 3222 ms to find 0 implicit places.
Running 1215 sub problems to find dead transitions.
[2026-05-27 20:08:24] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 909/2126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1215 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/910 constraints, PredecessorRefiner: 1215/1215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 909/2126 variables, and 0 constraints, problems are : Problem set: 0 solved, 1215 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/910 constraints, PredecessorRefiner: 0/1215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60648ms problems are : Problem set: 0 solved, 1215 unsolved
Search for dead transitions found 0 dead transitions in 60651ms
Starting structural reductions in LTL mode, iteration 1 : 910/961 places, 1216/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64014 ms. Remains : 910/961 places, 1216/1290 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&&F(p1)&&X(X(G(p2))))))'
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-07
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-07 finished in 64425 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((G(p0)||p1)) U (p2 U (X(F(!p3))&&X(p2)))))'
Support contains 8 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 933 transition count 1262
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 933 transition count 1262
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 933 transition count 1256
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 82 place count 913 transition count 1236
Iterating global reduction 1 with 20 rules applied. Total rules applied 102 place count 913 transition count 1236
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 116 place count 913 transition count 1222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 120 place count 909 transition count 1218
Iterating global reduction 2 with 4 rules applied. Total rules applied 124 place count 909 transition count 1218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 909 transition count 1216
Applied a total of 126 rules in 230 ms. Remains 909 /961 variables (removed 52) and now considering 1216/1290 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13213362017128118175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7962149959861571296.kers'
[2026-05-27 20:09:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13213362017128118175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7962149959861571296.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1216 rows 909 cols 3585 entries
Finished phase 1 with 891 SingleSign rule and 0 generalized
[2026-05-27 20:09:25] [INFO ] Computed 18 invariants in 12 ms
Computed 18 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-7962149959861571296.kers
Total runtime 15 ms.
[2026-05-27 20:09:27] [INFO ] Implicit Places using invariants in 2072 ms returned []
[2026-05-27 20:09:27] [INFO ] Invariant cache hit.
[2026-05-27 20:09:30] [INFO ] Implicit Places using invariants and state equation in 2254 ms returned []
Implicit Place search using SMT with State Equation took 4336 ms to find 0 implicit places.
Running 1215 sub problems to find dead transitions.
[2026-05-27 20:09:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 908/2125 variables, and 0 constraints, problems are : Problem set: 0 solved, 1215 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 1215/1215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1215 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 908/2125 variables, and 0 constraints, problems are : Problem set: 0 solved, 1215 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/909 constraints, PredecessorRefiner: 0/1215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60813ms problems are : Problem set: 0 solved, 1215 unsolved
Search for dead transitions found 0 dead transitions in 60816ms
Starting structural reductions in LTL mode, iteration 1 : 909/961 places, 1216/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65386 ms. Remains : 909/961 places, 1216/1290 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((G(p0)||p1)) U (p2 U (X(F(!p3))&&X(p2)))))'
Stuttering acceptance computed with spot in 582 ms :[(OR (NOT p2) p3), (OR (NOT p2) p3), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) p3), (OR (NOT p2) p3), (AND (NOT p0) p1 (NOT p2)), true, p3, (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-08 finished in 66066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G((p0||G(p1))))) U (G((p0&&X(G((p0||G(p1))))))||(X(G((p0||G(p1))))&&p2))))'
Support contains 6 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 932 transition count 1261
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 932 transition count 1261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 65 place count 932 transition count 1254
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 86 place count 911 transition count 1233
Iterating global reduction 1 with 21 rules applied. Total rules applied 107 place count 911 transition count 1233
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 122 place count 911 transition count 1218
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 126 place count 907 transition count 1214
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 907 transition count 1214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 132 place count 907 transition count 1212
Applied a total of 132 rules in 234 ms. Remains 907 /961 variables (removed 54) and now considering 1212/1290 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1984106705231743900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-635690392498680968.kers'
[2026-05-27 20:10:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1984106705231743900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-635690392498680968.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1212 rows 907 cols 3569 entries
Finished phase 1 with 889 SingleSign rule and 0 generalized
[2026-05-27 20:10:31] [INFO ] Computed 18 invariants in 11 ms
Computed 18 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-635690392498680968.kers
Total runtime 13 ms.
[2026-05-27 20:10:33] [INFO ] Implicit Places using invariants in 1809 ms returned []
[2026-05-27 20:10:33] [INFO ] Invariant cache hit.
[2026-05-27 20:10:35] [INFO ] Implicit Places using invariants and state equation in 2303 ms returned []
Implicit Place search using SMT with State Equation took 4119 ms to find 0 implicit places.
Running 1211 sub problems to find dead transitions.
[2026-05-27 20:10:35] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 906/2119 variables, and 0 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1211/1211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 906/2119 variables, and 0 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60699ms problems are : Problem set: 0 solved, 1211 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Starting structural reductions in LTL mode, iteration 1 : 907/961 places, 1212/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65059 ms. Remains : 907/961 places, 1212/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(G((p0||G(p1))))) U (G((p0&&X(G((p0||G(p1))))))||(X(G((p0||G(p1))))&&p2))))'
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-10
Product exploration explored 100000 steps with 887 reset in 551 ms.
Product exploration explored 100000 steps with 890 reset in 621 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 17 factoid took 94 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (352 resets) in 1415 ms. (28 steps per ms) remains 2/4 properties
BEST_FIRST walk for 36950 steps (22 resets) in 411 ms. (89 steps per ms) remains 0/2 properties
Negative knowledge disproves property using: (G (OR p0 p1))
Knowledge based reduction with 17 factoid took 69 ms. Proved property starting from automaton with 3 states, 6 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 842 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-10 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-10 finished in 67303 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(X((p0&&(!p1 U (p2||G(!p1))))))))))'
Support contains 5 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 932 transition count 1261
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 932 transition count 1261
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 65 place count 932 transition count 1254
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 85 place count 912 transition count 1234
Iterating global reduction 1 with 20 rules applied. Total rules applied 105 place count 912 transition count 1234
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 119 place count 912 transition count 1220
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 908 transition count 1216
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 908 transition count 1216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 129 place count 908 transition count 1214
Applied a total of 129 rules in 159 ms. Remains 908 /961 variables (removed 53) and now considering 1214/1290 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7265363790102364926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8384012447835552497.kers'
[2026-05-27 20:11:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7265363790102364926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8384012447835552497.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1214 rows 908 cols 3577 entries
Finished phase 1 with 890 SingleSign rule and 0 generalized
[2026-05-27 20:11:39] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-8384012447835552497.kers
Total runtime 9 ms.
[2026-05-27 20:11:40] [INFO ] Implicit Places using invariants in 1437 ms returned []
[2026-05-27 20:11:40] [INFO ] Invariant cache hit.
[2026-05-27 20:11:43] [INFO ] Implicit Places using invariants and state equation in 2648 ms returned []
Implicit Place search using SMT with State Equation took 4090 ms to find 0 implicit places.
Running 1213 sub problems to find dead transitions.
[2026-05-27 20:11:43] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/908 constraints, PredecessorRefiner: 1213/1213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1213 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/2122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1213 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/908 constraints, PredecessorRefiner: 0/1213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60717ms problems are : Problem set: 0 solved, 1213 unsolved
Search for dead transitions found 0 dead transitions in 60719ms
Starting structural reductions in LTL mode, iteration 1 : 908/961 places, 1214/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64974 ms. Remains : 908/961 places, 1214/1290 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(X((p0&&(!p1 U (p2||G(!p1))))))))))'
Stuttering acceptance computed with spot in 404 ms :[true, (AND (NOT p2) p1), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-11
Product exploration explored 100000 steps with 16666 reset in 308 ms.
Product exploration explored 100000 steps with 16666 reset in 496 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (353 resets) in 499 ms. (80 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (35 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (34 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (34 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (34 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 217102 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :3 out of 6
Probabilistic random walk after 217102 steps, saw 85161 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :3
[2026-05-27 20:12:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 361/366 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 542/908 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1214/2122 variables, 908/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2122 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2122/2122 variables, and 931 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3833 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 908/908 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 361/366 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 542/908 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/908 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1214/2122 variables, 908/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 3/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2122 variables, 2/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2122 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2122 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2122/2122 variables, and 939 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4516 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 908/908 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8364ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 74 ms.
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[true, (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Knowledge-based reduction took 12532 ms.
Stuttering acceptance computed with spot in 392 ms :[true, (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 5 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1214/1214 transitions.
Applied a total of 0 rules in 58 ms. Remains 908 /908 variables (removed 0) and now considering 1214/1214 (removed 0) transitions.
[2026-05-27 20:12:58] [INFO ] Invariant cache hit.
[2026-05-27 20:13:00] [INFO ] Implicit Places using invariants in 1965 ms returned []
[2026-05-27 20:13:00] [INFO ] Invariant cache hit.
[2026-05-27 20:13:02] [INFO ] Implicit Places using invariants and state equation in 2290 ms returned []
Implicit Place search using SMT with State Equation took 4258 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4317 ms. Remains : 908/908 places, 1214/1214 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (354 resets) in 352 ms. (113 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 72 ms. (548 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
[2026-05-27 20:13:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 361/366 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 542/908 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1214/2122 variables, 908/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2122 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2122 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2122/2122 variables, and 931 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3713 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 908/908 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 361/366 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 542/908 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/908 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1214/2122 variables, 908/934 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 3/937 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2122 variables, 2/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2122 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2122 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2122/2122 variables, and 939 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4711 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 908/908 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8434ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 61 ms.
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 8 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[true, (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Knowledge-based reduction took 9343 ms.
Stuttering acceptance computed with spot in 390 ms :[true, (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 386 ms :[true, (AND p1 (NOT p2)), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 16666 reset in 335 ms.
Product exploration explored 100000 steps with 16666 reset in 347 ms.
Spot run failed in 155 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin18037879120972544381
[2026-05-27 20:13:13] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18037879120972544381
Running compilation step : cd /tmp/ltsmin18037879120972544381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18037879120972544381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18037879120972544381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 5 out of 908 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 908/908 places, 1214/1214 transitions.
Applied a total of 0 rules in 32 ms. Remains 908 /908 variables (removed 0) and now considering 1214/1214 (removed 0) transitions.
[2026-05-27 20:13:16] [INFO ] Invariant cache hit.
[2026-05-27 20:13:18] [INFO ] Implicit Places using invariants in 1495 ms returned []
[2026-05-27 20:13:18] [INFO ] Invariant cache hit.
[2026-05-27 20:13:20] [INFO ] Implicit Places using invariants and state equation in 2147 ms returned []
Implicit Place search using SMT with State Equation took 3644 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3678 ms. Remains : 908/908 places, 1214/1214 transitions.
Built C files in :
/tmp/ltsmin1941403313588637967
[2026-05-27 20:13:20] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1941403313588637967
Running compilation step : cd /tmp/ltsmin1941403313588637967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1941403313588637967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1941403313588637967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-27 20:13:23] [INFO ] Flatten gal took : 212 ms
[2026-05-27 20:13:23] [INFO ] Flatten gal took : 142 ms
[2026-05-27 20:13:23] [INFO ] Time to serialize gal into /tmp/LTL9381571885702875142.gal : 25 ms
[2026-05-27 20:13:23] [INFO ] Time to serialize properties into /tmp/LTL962739942473369227.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/LTL9381571885702875142.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17122854596714843666.hoa' '-atoms' '/tmp/LTL962739942473369227.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/LTL962739942473369227.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17122854596714843666.hoa
Detected timeout of ITS tools.
[2026-05-27 20:13:38] [INFO ] Flatten gal took : 38 ms
[2026-05-27 20:13:39] [INFO ] Flatten gal took : 56 ms
[2026-05-27 20:13:39] [INFO ] Time to serialize gal into /tmp/LTL18072418812862516967.gal : 7 ms
[2026-05-27 20:13:39] [INFO ] Time to serialize properties into /tmp/LTL8966710095763763959.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/LTL18072418812862516967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8966710095763763959.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(("(p2957==0)")&&(("(p1171!=1)")U(("((!(((p1048==1)&&(p1729==1))&&(p3133==1)))&&(p1171!=1))")||(G("(p1171!=1)")))))))))))
Formula 0 simplified : XXXXX(!"(p2957==0)" | (!"(p1171!=1)" M !"((!(((p1048==1)&&(p1729==1))&&(p3133==1)))&&(p1171!=1))"))
Detected timeout of ITS tools.
[2026-05-27 20:13:54] [INFO ] Flatten gal took : 29 ms
[2026-05-27 20:13:54] [INFO ] Applying decomposition
[2026-05-27 20:13:54] [INFO ] Flatten gal took : 30 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/graph2546470600761357967.txt' '-o' '/tmp/graph2546470600761357967.bin' '-w' '/tmp/graph2546470600761357967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2546470600761357967.bin' '-l' '-1' '-v' '-w' '/tmp/graph2546470600761357967.weights' '-q' '0' '-e' '0.001'
[2026-05-27 20:13:54] [INFO ] Decomposing Gal with order
[2026-05-27 20:13:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 20:13:54] [INFO ] Removed a total of 350 redundant transitions.
[2026-05-27 20:13:54] [INFO ] Flatten gal took : 300 ms
[2026-05-27 20:13:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 68 ms.
[2026-05-27 20:13:54] [INFO ] Time to serialize gal into /tmp/LTL804930151620741971.gal : 25 ms
[2026-05-27 20:13:54] [INFO ] Time to serialize properties into /tmp/LTL8178302849064540965.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/LTL804930151620741971.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8178302849064540965.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...253
Read 1 LTL properties
Checking formula 0 : !((X(X(X(X(X(("(u173.p2957==0)")&&(("(i8.u81.p1171!=1)")U(("((!(((i7.u69.p1048==1)&&(i12.i1.i1.u130.p1729==1))&&(u173.p3133==1)))&&(i8...207
Formula 0 simplified : XXXXX(!"(u173.p2957==0)" | (!"(i8.u81.p1171!=1)" M !"((!(((i7.u69.p1048==1)&&(i12.i1.i1.u130.p1729==1))&&(u173.p3133==1)))&&(i8.u81....168
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-11 finished in 150991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p0||F(p1)))))'
Support contains 2 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 932 transition count 1261
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 932 transition count 1261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 66 place count 932 transition count 1253
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 85 place count 913 transition count 1234
Iterating global reduction 1 with 19 rules applied. Total rules applied 104 place count 913 transition count 1234
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 118 place count 913 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 910 transition count 1217
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 910 transition count 1217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 126 place count 910 transition count 1215
Applied a total of 126 rules in 149 ms. Remains 910 /961 variables (removed 51) and now considering 1215/1290 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1499569704417300901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17177089087311050696.kers'
[2026-05-27 20:14:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1499569704417300901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17177089087311050696.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1215 rows 910 cols 3575 entries
Finished phase 1 with 892 SingleSign rule and 0 generalized
[2026-05-27 20:14:10] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17177089087311050696.kers
Total runtime 8 ms.
[2026-05-27 20:14:11] [INFO ] Implicit Places using invariants in 1638 ms returned []
[2026-05-27 20:14:11] [INFO ] Invariant cache hit.
[2026-05-27 20:14:13] [INFO ] Implicit Places using invariants and state equation in 2300 ms returned []
Implicit Place search using SMT with State Equation took 3942 ms to find 0 implicit places.
Running 1214 sub problems to find dead transitions.
[2026-05-27 20:14:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 909/2125 variables, and 0 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/910 constraints, PredecessorRefiner: 1214/1214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1214 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 909/2125 variables, and 0 constraints, problems are : Problem set: 0 solved, 1214 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/910 constraints, PredecessorRefiner: 0/1214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60858ms problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 60861ms
Starting structural reductions in LTL mode, iteration 1 : 910/961 places, 1215/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64958 ms. Remains : 910/961 places, 1215/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p0||F(p1)))))'
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-12
Product exploration explored 100000 steps with 892 reset in 425 ms.
Product exploration explored 100000 steps with 889 reset in 411 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge based reduction with 9 factoid took 51 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 31742 steps (283 resets) in 145 ms. (217 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 9 factoid took 30 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 144 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-12 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-12 finished in 66175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 961 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Graph (trivial) has 909 edges and 961 vertex of which 97 / 961 are part of one of the 16 SCC in 2 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 879 transition count 1122
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 794 transition count 1122
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 171 place count 794 transition count 1088
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 239 place count 760 transition count 1088
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 298 place count 701 transition count 1029
Iterating global reduction 2 with 59 rules applied. Total rules applied 357 place count 701 transition count 1029
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 365 place count 701 transition count 1021
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 365 place count 701 transition count 1020
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 367 place count 700 transition count 1020
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 377 place count 690 transition count 1010
Iterating global reduction 3 with 10 rules applied. Total rules applied 387 place count 690 transition count 1010
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 396 place count 690 transition count 1001
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 592 place count 592 transition count 903
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 599 place count 585 transition count 896
Iterating global reduction 4 with 7 rules applied. Total rules applied 606 place count 585 transition count 896
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 613 place count 585 transition count 889
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 629 place count 585 transition count 873
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 631 place count 583 transition count 871
Applied a total of 631 rules in 476 ms. Remains 583 /961 variables (removed 378) and now considering 871/1290 (removed 419) transitions.
[2026-05-27 20:15:16] [INFO ] Flow matrix only has 840 transitions (discarded 31 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9421542505581952735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7358950803215915807.kers'
[2026-05-27 20:15:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9421542505581952735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7358950803215915807.kers]
Normalized transition count is 839 out of 840 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 839 rows 582 cols 2613 entries
Finished phase 1 with 565 SingleSign rule and 0 generalized
[2026-05-27 20:15:16] [INFO ] Computed 18 invariants in 7 ms
Computed 18 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7358950803215915807.kers
Total runtime 10 ms.
[2026-05-27 20:15:18] [INFO ] Implicit Places using invariants in 1556 ms returned []
[2026-05-27 20:15:18] [INFO ] Flow matrix only has 840 transitions (discarded 31 similar events)
[2026-05-27 20:15:18] [INFO ] Invariant cache hit.
[2026-05-27 20:15:19] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 3189 ms to find 0 implicit places.
[2026-05-27 20:15:19] [INFO ] Redundant transitions in 48 ms returned []
Running 372 sub problems to find dead transitions.
[2026-05-27 20:15:19] [INFO ] Flow matrix only has 840 transitions (discarded 31 similar events)
[2026-05-27 20:15:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 16/583 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1423 variables, and 18 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/583 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 16/583 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 839/1422 variables, 583/601 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1422 variables, 372/973 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1422/1423 variables, and 973 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in SI_LTL mode, iteration 1 : 583/961 places, 871/1290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63976 ms. Remains : 583/961 places, 871/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-14 finished in 64044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(p1)) U p2)&&X((F(p1) U X(p3)))))'
Support contains 4 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1290/1290 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 933 transition count 1262
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 933 transition count 1262
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 64 place count 933 transition count 1254
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 82 place count 915 transition count 1236
Iterating global reduction 1 with 18 rules applied. Total rules applied 100 place count 915 transition count 1236
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 112 place count 915 transition count 1224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 911 transition count 1220
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 911 transition count 1220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 911 transition count 1218
Applied a total of 122 rules in 141 ms. Remains 911 /961 variables (removed 50) and now considering 1218/1290 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3068488633084875743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17792014949952717351.kers'
[2026-05-27 20:16:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3068488633084875743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17792014949952717351.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1218 rows 911 cols 3589 entries
Finished phase 1 with 893 SingleSign rule and 0 generalized
[2026-05-27 20:16:20] [INFO ] Computed 18 invariants in 6 ms
Computed 18 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17792014949952717351.kers
Total runtime 8 ms.
[2026-05-27 20:16:22] [INFO ] Implicit Places using invariants in 1770 ms returned []
[2026-05-27 20:16:22] [INFO ] Invariant cache hit.
[2026-05-27 20:16:24] [INFO ] Implicit Places using invariants and state equation in 2185 ms returned []
Implicit Place search using SMT with State Equation took 3958 ms to find 0 implicit places.
Running 1217 sub problems to find dead transitions.
[2026-05-27 20:16:24] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 910/2129 variables, and 0 constraints, problems are : Problem set: 0 solved, 1217 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/911 constraints, PredecessorRefiner: 1217/1217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1217 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 910/2129 variables, and 0 constraints, problems are : Problem set: 0 solved, 1217 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/911 constraints, PredecessorRefiner: 0/1217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60769ms problems are : Problem set: 0 solved, 1217 unsolved
Search for dead transitions found 0 dead transitions in 60772ms
Starting structural reductions in LTL mode, iteration 1 : 911/961 places, 1218/1290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64873 ms. Remains : 911/961 places, 1218/1290 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X(p1)) U p2)&&X((F(p1) U X(p3)))))'
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p3) (NOT p2)), (NOT p1), (NOT p2), (NOT p3), true, (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLFireability-15 finished in 65331 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((G(p1)||p0))))'
Spot run failed in 88 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X((p0&&(!p1 U (p2||G(!p1))))))))))'
Spot run failed in 78 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 20:17:25] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7950237273644628982
[2026-05-27 20:17:25] [INFO ] Applying decomposition
[2026-05-27 20:17:25] [INFO ] Computing symmetric may disable matrix : 1290 transitions.
[2026-05-27 20:17:25] [INFO ] Flatten gal took : 38 ms
[2026-05-27 20:17:25] [INFO ] Computation of Complete disable matrix. took 79 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph584477471726418621.txt' '-o' '/tmp/graph584477471726418621.bin' '-w' '/tmp/graph584477471726418621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph584477471726418621.bin' '-l' '-1' '-v' '-w' '/tmp/graph584477471726418621.weights' '-q' '0' '-e' '0.001'
[2026-05-27 20:17:25] [INFO ] Computing symmetric may enable matrix : 1290 transitions.
[2026-05-27 20:17:25] [INFO ] Decomposing Gal with order
[2026-05-27 20:17:25] [INFO ] Computation of Complete enable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 20:17:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 20:17:26] [INFO ] Removed a total of 417 redundant transitions.
[2026-05-27 20:17:26] [INFO ] Flatten gal took : 144 ms
[2026-05-27 20:17:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 30 ms.
[2026-05-27 20:17:26] [INFO ] Time to serialize gal into /tmp/LTLFireability2991374912882115185.gal : 14 ms
[2026-05-27 20:17:26] [INFO ] Time to serialize properties into /tmp/LTLFireability6288576013757314855.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/LTLFireability2991374912882115185.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6288576013757314855.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...276
Read 2 LTL properties
Checking formula 0 : !((G(F(("((((i3.u41.p604==1)&&(i14.u162.p2161==1))&&(i16.u181.p3328==1))||((i14.u165.p2150==1)&&(i7.i1.i0.u91.p1191==1)))")||(G("(i14....176
Formula 0 simplified : G(F!"(i14.u165.p2150==0)" & FG!"((((i3.u41.p604==1)&&(i14.u162.p2161==1))&&(i16.u181.p3328==1))||((i14.u165.p2150==1)&&(i7.i1.i0.u91...169
[2026-05-27 20:17:26] [INFO ] Computing Do-Not-Accords matrix : 1290 transitions.
[2026-05-27 20:17:26] [INFO ] Computation of Completed DNA matrix. took 183 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 20:17:26] [INFO ] Built C files in 1026ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7950237273644628982
Running compilation step : cd /tmp/ltsmin7950237273644628982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 7299 ms.
Running link step : cd /tmp/ltsmin7950237273644628982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin7950237273644628982;'/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' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7950237273644628982;'/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' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7950237273644628982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(X(X(((LTLAPp2==true)&&(!(LTLAPp3==true) U ((LTLAPp4==true)||[](!(LTLAPp3==true))))))))))' '--buchi-type=spotba'
LTSmin run took 1137 ms.
FORMULA FlexibleBarrier-PT-16b-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin7950237273644628982;'/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' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-27 20:43:56] [INFO ] Applying decomposition
[2026-05-27 20:43:58] [INFO ] Flatten gal took : 1161 ms
[2026-05-27 20:43:58] [INFO ] Decomposing Gal with order
[2026-05-27 20:43:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 20:43:59] [INFO ] Removed a total of 357 redundant transitions.
[2026-05-27 20:43:59] [INFO ] Flatten gal took : 968 ms
[2026-05-27 20:44:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 1219 labels/synchronizations in 925 ms.
[2026-05-27 20:44:01] [INFO ] Time to serialize gal into /tmp/LTLFireability14206849296074307125.gal : 139 ms
[2026-05-27 20:44:01] [INFO ] Time to serialize properties into /tmp/LTLFireability5171671871004455526.ltl : 96 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/LTLFireability14206849296074307125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5171671871004455526.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u19.p604==1)&&(i0.i0.u30.p2161==1))&&(i1.u33.p3328==1))||((i0.i0.u30.p2150==1)&&(i...231
Formula 0 simplified : G(F!"(i0.i0.u30.p2150==0)" & FG!"((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u19.p604==1)&&(i0.i0.u30.p2161==1))&&(i1.u33.p3328==1))|...224
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="FlexibleBarrier-PT-16b"
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 FlexibleBarrier-PT-16b, 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-177955809100412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b 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 ;