About the Execution of ITS-Tools for FireWire-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16197.044 | 3600000.00 | 6305330.00 | 27551.60 | T??FFFFFFFF?TFFF | 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-177955809000291.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FireWire-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000291
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.3K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 221K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-19-LTLCardinality-00
FORMULA_NAME FireWire-PT-19-LTLCardinality-01
FORMULA_NAME FireWire-PT-19-LTLCardinality-02
FORMULA_NAME FireWire-PT-19-LTLCardinality-03
FORMULA_NAME FireWire-PT-19-LTLCardinality-04
FORMULA_NAME FireWire-PT-19-LTLCardinality-05
FORMULA_NAME FireWire-PT-19-LTLCardinality-06
FORMULA_NAME FireWire-PT-19-LTLCardinality-07
FORMULA_NAME FireWire-PT-19-LTLCardinality-08
FORMULA_NAME FireWire-PT-19-LTLCardinality-09
FORMULA_NAME FireWire-PT-19-LTLCardinality-10
FORMULA_NAME FireWire-PT-19-LTLCardinality-11
FORMULA_NAME FireWire-PT-19-LTLCardinality-12
FORMULA_NAME FireWire-PT-19-LTLCardinality-13
FORMULA_NAME FireWire-PT-19-LTLCardinality-14
FORMULA_NAME FireWire-PT-19-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1779847572338
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-27 02:06:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-27 02:06:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 02:06:15] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2026-05-27 02:06:15] [INFO ] Transformed 602 places.
[2026-05-27 02:06:15] [INFO ] Transformed 944 transitions.
[2026-05-27 02:06:15] [INFO ] Found NUPN structural information;
[2026-05-27 02:06:15] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-19-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 593 transition count 944
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 129 place count 473 transition count 824
Iterating global reduction 1 with 120 rules applied. Total rules applied 249 place count 473 transition count 824
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 280 place count 442 transition count 784
Iterating global reduction 1 with 31 rules applied. Total rules applied 311 place count 442 transition count 784
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 313 place count 442 transition count 782
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 316 place count 439 transition count 779
Iterating global reduction 2 with 3 rules applied. Total rules applied 319 place count 439 transition count 779
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 321 place count 437 transition count 777
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 437 transition count 777
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 325 place count 435 transition count 775
Iterating global reduction 2 with 2 rules applied. Total rules applied 327 place count 435 transition count 775
Applied a total of 327 rules in 272 ms. Remains 435 /602 variables (removed 167) and now considering 775/944 (removed 169) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2305605622078975829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5411656456598823348.kers'
[2026-05-27 02:06:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2305605622078975829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5411656456598823348.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 775 rows 435 cols 2392 entries
Finished phase 1 with 425 SingleSign rule and 0 generalized
[2026-05-27 02:06:15] [INFO ] Computed 10 invariants in 6 ms
Computed 10 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5411656456598823348.kers
Total runtime 10 ms.
[2026-05-27 02:06:16] [INFO ] Implicit Places using invariants in 897 ms returned []
[2026-05-27 02:06:16] [INFO ] Invariant cache hit.
[2026-05-27 02:06:17] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 2121 ms to find 0 implicit places.
Running 774 sub problems to find dead transitions.
[2026-05-27 02:06:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (OVERLAPS) 1/435 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 435/1210 variables, and 11 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 774/774 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/434 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 1 (OVERLAPS) 1/435 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 774 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 774 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 435/1210 variables, and 18 constraints, problems are : Problem set: 0 solved, 774 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/435 constraints, PredecessorRefiner: 0/774 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61005ms problems are : Problem set: 0 solved, 774 unsolved
Search for dead transitions found 0 dead transitions in 61047ms
Starting structural reductions in LTL mode, iteration 1 : 435/602 places, 775/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63582 ms. Remains : 435/602 places, 775/944 transitions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Applied a total of 0 rules in 20 ms. Remains 435 /435 variables (removed 0) and now considering 775/775 (removed 0) transitions.
[2026-05-27 02:07:19] [INFO ] Invariant cache hit.
[2026-05-27 02:07:19] [INFO ] Implicit Places using invariants in 377 ms returned []
[2026-05-27 02:07:19] [INFO ] Invariant cache hit.
[2026-05-27 02:07:20] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1262 ms. Remains : 435/435 places, 775/775 transitions.
Support contains 28 out of 435 places after structural reductions.
[2026-05-27 02:07:20] [INFO ] Flatten gal took : 178 ms
[2026-05-27 02:07:21] [INFO ] Flatten gal took : 68 ms
[2026-05-27 02:07:21] [INFO ] Input system was already deterministic with 775 transitions.
RANDOM walk for 40000 steps (31 resets) in 2211 ms. (18 steps per ms) remains 9/15 properties
BEST_FIRST walk for 40001 steps (16 resets) in 519 ms. (76 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (13 resets) in 454 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (20 resets) in 359 ms. (111 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (21 resets) in 347 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (10 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (20 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (10 resets) in 130 ms. (305 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (15 resets) in 182 ms. (218 steps per ms) remains 9/9 properties
[2026-05-27 02:07:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 290/308 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 75/383 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 722/1105 variables, 383/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1105 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 34/1139 variables, 16/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1139 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 33/1172 variables, 16/425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1172 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 17/1189 variables, 9/434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1189 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 15/1204 variables, 7/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1204 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 6/1210 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1210 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/1210 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1210/1210 variables, and 445 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2175 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 435/435 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 290/308 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 75/383 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 722/1105 variables, 383/396 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1105 variables, 7/403 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1105 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1105 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 34/1139 variables, 16/421 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1139 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1139/1210 variables, and 423 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 399/435 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7206ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 775/775 transitions.
Graph (trivial) has 315 edges and 435 vertex of which 18 / 435 are part of one of the 3 SCC in 15 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 420 transition count 686
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 74 rules applied. Total rules applied 142 place count 353 transition count 679
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 148 place count 349 transition count 677
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 347 transition count 677
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 150 place count 347 transition count 637
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 230 place count 307 transition count 637
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 234 place count 303 transition count 604
Iterating global reduction 4 with 4 rules applied. Total rules applied 238 place count 303 transition count 604
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 4 with 2 rules applied. Total rules applied 240 place count 303 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 241 place count 302 transition count 602
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 241 place count 302 transition count 601
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 243 place count 301 transition count 601
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 6 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 329 place count 258 transition count 558
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 330 place count 257 transition count 528
Iterating global reduction 6 with 1 rules applied. Total rules applied 331 place count 257 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 332 place count 257 transition count 527
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 44 places in 5 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 420 place count 213 transition count 642
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 428 place count 213 transition count 634
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 8 with 45 rules applied. Total rules applied 473 place count 213 transition count 589
Free-agglomeration rule applied 28 times.
Iterating global reduction 8 with 28 rules applied. Total rules applied 501 place count 213 transition count 561
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 36 rules applied. Total rules applied 537 place count 185 transition count 553
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 9 with 74 rules applied. Total rules applied 611 place count 185 transition count 479
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 615 place count 185 transition count 479
Applied a total of 615 rules in 427 ms. Remains 185 /435 variables (removed 250) and now considering 479/775 (removed 296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 185/435 places, 479/775 transitions.
RANDOM walk for 40000 steps (1695 resets) in 527 ms. (75 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (341 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (156 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
[2026-05-27 02:07:30] [INFO ] Flow matrix only has 428 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11624390264983626236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10155444172915689239.kers'
[2026-05-27 02:07:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11624390264983626236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10155444172915689239.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 428 rows 185 cols 1578 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-27 02:07:30] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10155444172915689239.kers
Total runtime 4 ms.
[2026-05-27 02:07:30] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 150/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/175 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 424/599 variables, 175/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 90/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/609 variables, 7/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/612 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/613 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/613 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/613 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 185/185 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 150/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/175 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 424/599 variables, 175/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 90/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/599 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/599 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/609 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/612 variables, 2/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/612 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/612 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/613 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/613 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/613 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 613/613 variables, and 290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 185/185 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1473ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 479/479 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 185 transition count 476
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 182 transition count 476
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 182 transition count 473
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 178 transition count 472
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 178 transition count 472
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 175 transition count 469
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 175 transition count 465
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 174 transition count 462
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 174 transition count 462
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 172 transition count 468
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 172 transition count 466
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 43 place count 172 transition count 455
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 172 transition count 453
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 47 place count 170 transition count 453
Applied a total of 47 rules in 65 ms. Remains 170 /185 variables (removed 15) and now considering 453/479 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 170/185 places, 453/479 transitions.
RANDOM walk for 40000 steps (1868 resets) in 364 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (365 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 743219 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :1 out of 2
Probabilistic random walk after 743219 steps, saw 232418 distinct states, run finished after 3010 ms. (steps per millisecond=246 ) properties seen :1
[2026-05-27 02:07:35] [INFO ] Flow matrix only has 401 transitions (discarded 52 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14767310093881948352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16097373189502828011.kers'
[2026-05-27 02:07:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14767310093881948352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16097373189502828011.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 170 cols 1466 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-27 02:07:35] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16097373189502828011.kers
Total runtime 3 ms.
[2026-05-27 02:07:35] [INFO ] State equation strengthened by 92 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/164 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 401/565 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 92/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/571 variables, 6/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/571 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 83/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 79/164 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 401/565 variables, 164/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 92/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/571 variables, 6/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/571 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 273 constraints, problems are : Problem set: 0 solved, 1 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 170/170 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 630 steps, including 114 resets, run visited all 1 properties in 4 ms. (steps per millisecond=157 )
Parikh walk visited 1 properties in 10 ms.
Computed a total of 66 stabilizing places and 72 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(p0)))'
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 423 transition count 762
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 423 transition count 762
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 423 transition count 760
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 418 transition count 724
Applied a total of 36 rules in 31 ms. Remains 418 /435 variables (removed 17) and now considering 724/775 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17170673268531032848.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4794707995545640700.kers'
[2026-05-27 02:07:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17170673268531032848.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4794707995545640700.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 724 rows 418 cols 2222 entries
Finished phase 1 with 408 SingleSign rule and 0 generalized
[2026-05-27 02:07:36] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4794707995545640700.kers
Total runtime 5 ms.
[2026-05-27 02:07:37] [INFO ] Implicit Places using invariants in 425 ms returned []
[2026-05-27 02:07:37] [INFO ] Invariant cache hit.
[2026-05-27 02:07:37] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2026-05-27 02:07:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 19 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1142 variables, and 21 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 0/723 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 418/435 places, 724/775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61472 ms. Remains : 418/435 places, 724/775 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 469 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 491 ms.
Product exploration explored 100000 steps with 33333 reset in 392 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 21 ms. Proved property starting from automaton with 4 states, 4 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 52 ms.
FORMULA FireWire-PT-19-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-19-LTLCardinality-00 finished in 62996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!X(!p0)) U p0)))'
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 425 transition count 764
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 425 transition count 764
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 425 transition count 763
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 422 transition count 758
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 422 transition count 758
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 421 transition count 757
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 421 transition count 757
Applied a total of 29 rules in 37 ms. Remains 421 /435 variables (removed 14) and now considering 757/775 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8629266488670275959.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12512440221294694305.kers'
[2026-05-27 02:08:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8629266488670275959.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12512440221294694305.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 757 rows 421 cols 2348 entries
Finished phase 1 with 411 SingleSign rule and 0 generalized
[2026-05-27 02:08:39] [INFO ] Computed 10 invariants in 6 ms
Computed 10 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12512440221294694305.kers
Total runtime 8 ms.
[2026-05-27 02:08:40] [INFO ] Implicit Places using invariants in 505 ms returned []
[2026-05-27 02:08:40] [INFO ] Invariant cache hit.
[2026-05-27 02:08:41] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
Running 756 sub problems to find dead transitions.
[2026-05-27 02:08:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1178 variables, and 10 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 756/756 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 756 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 756 unsolved
At refinement iteration 1 (OVERLAPS) 1/421 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 756 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/1178 variables, and 16 constraints, problems are : Problem set: 0 solved, 756 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/421 constraints, PredecessorRefiner: 0/756 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 756 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
Starting structural reductions in LTL mode, iteration 1 : 421/435 places, 757/775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62076 ms. Remains : 421/435 places, 757/775 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!X(!p0)) U p0)))'
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-01
Product exploration explored 100000 steps with 1 reset in 108 ms.
Product exploration explored 100000 steps with 14 reset in 204 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 18484 steps (20 resets) in 50 ms. (362 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 284 ms.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 757/757 transitions.
Applied a total of 0 rules in 6 ms. Remains 421 /421 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2026-05-27 02:09:42] [INFO ] Invariant cache hit.
[2026-05-27 02:09:42] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-27 02:09:42] [INFO ] Invariant cache hit.
[2026-05-27 02:09:43] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1297 ms. Remains : 421/421 places, 757/757 transitions.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (13 resets) in 224 ms. (177 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30905 steps (10 resets) in 125 ms. (245 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 522 ms.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 1 reset in 162 ms.
Product exploration explored 100000 steps with 0 reset in 340 ms.
Spot run failed in 146 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/ltsmin12592421138370872426
[2026-05-27 02:09:45] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12592421138370872426
Running compilation step : cd /tmp/ltsmin12592421138370872426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2346 ms.
Running link step : cd /tmp/ltsmin12592421138370872426;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin12592421138370872426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased18122316400647873225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 757/757 transitions.
Applied a total of 0 rules in 6 ms. Remains 421 /421 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2026-05-27 02:10:00] [INFO ] Invariant cache hit.
[2026-05-27 02:10:00] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-27 02:10:00] [INFO ] Invariant cache hit.
[2026-05-27 02:10:01] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1467 ms. Remains : 421/421 places, 757/757 transitions.
Built C files in :
/tmp/ltsmin9483264401830284672
[2026-05-27 02:10:01] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9483264401830284672
Running compilation step : cd /tmp/ltsmin9483264401830284672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2016 ms.
Running link step : cd /tmp/ltsmin9483264401830284672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9483264401830284672;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased11873207409328934417.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 02:10:17] [INFO ] Flatten gal took : 83 ms
[2026-05-27 02:10:17] [INFO ] Flatten gal took : 46 ms
[2026-05-27 02:10:17] [INFO ] Time to serialize gal into /tmp/LTL13412776051738119580.gal : 11 ms
[2026-05-27 02:10:17] [INFO ] Time to serialize properties into /tmp/LTL5148590279127850696.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/LTL13412776051738119580.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16117244294606989661.hoa' '-atoms' '/tmp/LTL5148590279127850696.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL5148590279127850696.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16117244294606989661.hoa
Detected timeout of ITS tools.
[2026-05-27 02:10:32] [INFO ] Flatten gal took : 70 ms
[2026-05-27 02:10:32] [INFO ] Flatten gal took : 55 ms
[2026-05-27 02:10:32] [INFO ] Time to serialize gal into /tmp/LTL11459448409130458888.gal : 13 ms
[2026-05-27 02:10:32] [INFO ] Time to serialize properties into /tmp/LTL8636965567441221239.ltl : 13 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/LTL11459448409130458888.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8636965567441221239.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(!(X(!("((p38==0)||(p61==1))")))))U("((p38==0)||(p61==1))"))))
Formula 0 simplified : F(!"((p38==0)||(p61==1))" & X(!"((p38==0)||(p61==1))" W X!"((p38==0)||(p61==1))"))
Detected timeout of ITS tools.
[2026-05-27 02:10:47] [INFO ] Flatten gal took : 30 ms
[2026-05-27 02:10:47] [INFO ] Applying decomposition
[2026-05-27 02:10:47] [INFO ] Flatten gal took : 32 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/graph5540709401750812506.txt' '-o' '/tmp/graph5540709401750812506.bin' '-w' '/tmp/graph5540709401750812506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5540709401750812506.bin' '-l' '-1' '-v' '-w' '/tmp/graph5540709401750812506.weights' '-q' '0' '-e' '0.001'
[2026-05-27 02:10:47] [INFO ] Decomposing Gal with order
[2026-05-27 02:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 02:10:48] [INFO ] Removed a total of 848 redundant transitions.
[2026-05-27 02:10:48] [INFO ] Flatten gal took : 210 ms
[2026-05-27 02:10:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 59 ms.
[2026-05-27 02:10:48] [INFO ] Time to serialize gal into /tmp/LTL3426526208580674856.gal : 31 ms
[2026-05-27 02:10:48] [INFO ] Time to serialize properties into /tmp/LTL15053062878797561648.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/LTL3426526208580674856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15053062878797561648.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(!(X(!("((i0.u9.p38==0)||(i4.u17.p61==1))")))))U("((i0.u9.p38==0)||(i4.u17.p61==1))"))))
Formula 0 simplified : F(!"((i0.u9.p38==0)||(i4.u17.p61==1))" & X(!"((i0.u9.p38==0)||(i4.u17.p61==1))" W X!"((i0.u9.p38==0)||(i4.u17.p61==1))"))
Detected timeout of ITS tools.
Treatment of property FireWire-PT-19-LTLCardinality-01 finished in 143779 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 4 out of 435 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Graph (trivial) has 338 edges and 435 vertex of which 18 / 435 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 419 transition count 687
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 80 rules applied. Total rules applied 152 place count 348 transition count 678
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 158 place count 343 transition count 677
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 342 transition count 677
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 159 place count 342 transition count 635
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 243 place count 300 transition count 635
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 250 place count 293 transition count 598
Iterating global reduction 4 with 7 rules applied. Total rules applied 257 place count 293 transition count 598
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 257 place count 293 transition count 595
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 263 place count 290 transition count 595
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 264 place count 289 transition count 592
Iterating global reduction 4 with 1 rules applied. Total rules applied 265 place count 289 transition count 592
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 349 place count 247 transition count 550
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 350 place count 246 transition count 520
Iterating global reduction 4 with 1 rules applied. Total rules applied 351 place count 246 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 246 transition count 519
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -135
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 446 place count 199 transition count 654
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 5 with 63 rules applied. Total rules applied 509 place count 199 transition count 591
Applied a total of 509 rules in 144 ms. Remains 199 /435 variables (removed 236) and now considering 591/775 (removed 184) transitions.
[2026-05-27 02:11:03] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12010179314495862290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16804267593817880219.kers'
[2026-05-27 02:11:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12010179314495862290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16804267593817880219.kers]
Normalized transition count is 561 out of 562 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 561 rows 199 cols 2058 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-27 02:11:03] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16804267593817880219.kers
Total runtime 5 ms.
[2026-05-27 02:11:03] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-27 02:11:03] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
[2026-05-27 02:11:03] [INFO ] Invariant cache hit.
[2026-05-27 02:11:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-27 02:11:04] [INFO ] Implicit Places using invariants and state equation in 966 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
[2026-05-27 02:11:04] [INFO ] Redundant transitions in 113 ms returned []
Running 581 sub problems to find dead transitions.
[2026-05-27 02:11:04] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
[2026-05-27 02:11:04] [INFO ] Invariant cache hit.
[2026-05-27 02:11:04] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (OVERLAPS) 1/199 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 199/761 variables, and 17 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/199 constraints, ReadFeed: 0/67 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 1/199 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 6 (OVERLAPS) 561/760 variables, 199/216 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 67/283 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 581/864 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/761 variables, and 864 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60497ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60502ms
Starting structural reductions in SI_LTL mode, iteration 1 : 199/435 places, 591/775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62065 ms. Remains : 199/435 places, 591/775 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 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-02
Product exploration explored 100000 steps with 1 reset in 254 ms.
Product exploration explored 100000 steps with 0 reset in 239 ms.
Computed a total of 9 stabilizing places and 25 stable transitions
Computed a total of 9 stabilizing places and 25 stable transitions
Knowledge based reduction with 7 factoid took 174 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 (2181 resets) in 839 ms. (47 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (293 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (370 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
[2026-05-27 02:12:06] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
[2026-05-27 02:12:06] [INFO ] Invariant cache hit.
[2026-05-27 02:12:06] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/174 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 544/718 variables, 174/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 13/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/760 variables, 25/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 54/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/760 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/761 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/174 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 544/718 variables, 174/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 13/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/760 variables, 25/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 54/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/760 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/760 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/760 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/761 variables, and 280 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1739ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 591/591 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 199 transition count 588
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 33 place count 199 transition count 558
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 169 transition count 549
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 2 with 84 rules applied. Total rules applied 156 place count 169 transition count 465
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 169 transition count 465
Applied a total of 162 rules in 44 ms. Remains 169 /199 variables (removed 30) and now considering 465/591 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 169/199 places, 465/591 transitions.
RANDOM walk for 40000 steps (1619 resets) in 1059 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (213 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (323 resets) in 52 ms. (754 steps per ms) remains 1/2 properties
[2026-05-27 02:12:09] [INFO ] Flow matrix only has 409 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11740326182102080015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7577176422560083191.kers'
[2026-05-27 02:12:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11740326182102080015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7577176422560083191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 409 rows 169 cols 1466 entries
Finished phase 1 with 159 SingleSign rule and 0 generalized
[2026-05-27 02:12:09] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7577176422560083191.kers
Total runtime 3 ms.
[2026-05-27 02:12:09] [INFO ] State equation strengthened by 95 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/150 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/550 variables, 150/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 16/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/577 variables, 18/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 79/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/578 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/578 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 274 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/46 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/150 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 400/550 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 16/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/577 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 79/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/578 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/578 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 899ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 465/465 transitions.
Applied a total of 0 rules in 7 ms. Remains 169 /169 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 169/169 places, 465/465 transitions.
RANDOM walk for 40000 steps (1634 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36641 steps (201 resets) in 35 ms. (1017 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 166 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 4198 ms.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 591/591 transitions.
Applied a total of 0 rules in 11 ms. Remains 199 /199 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2026-05-27 02:12:10] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4077887599660541617.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-870218672633511848.kers'
[2026-05-27 02:12:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4077887599660541617.kers, --Pflows, --basisKERS=/tmp/petrispot-output-870218672633511848.kers]
Normalized transition count is 561 out of 562 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 561 rows 199 cols 2058 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-27 02:12:10] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-870218672633511848.kers
Total runtime 4 ms.
[2026-05-27 02:12:10] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-27 02:12:10] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
[2026-05-27 02:12:10] [INFO ] Invariant cache hit.
[2026-05-27 02:12:10] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-27 02:12:11] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2026-05-27 02:12:11] [INFO ] Redundant transitions in 34 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1008 ms. Remains : 199/199 places, 591/591 transitions.
Computed a total of 9 stabilizing places and 25 stable transitions
Computed a total of 9 stabilizing places and 25 stable transitions
Knowledge based reduction with 7 factoid took 110 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 (2170 resets) in 175 ms. (227 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (286 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (370 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2026-05-27 02:12:11] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
[2026-05-27 02:12:11] [INFO ] Invariant cache hit.
[2026-05-27 02:12:11] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/174 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 544/718 variables, 174/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/718 variables, 13/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/760 variables, 25/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 54/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/760 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 760/761 variables, and 276 constraints, problems are : Problem set: 0 solved, 2 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 123/174 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 544/718 variables, 174/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/718 variables, 13/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 42/760 variables, 25/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/760 variables, 54/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/760 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/760 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/760 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/760 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/760 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 760/761 variables, and 280 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1655ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 591/591 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 199 transition count 588
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 33 place count 199 transition count 558
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 169 transition count 549
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 2 with 84 rules applied. Total rules applied 156 place count 169 transition count 465
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 169 transition count 465
Applied a total of 162 rules in 40 ms. Remains 169 /199 variables (removed 30) and now considering 465/591 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 169/199 places, 465/591 transitions.
RANDOM walk for 40000 steps (1613 resets) in 264 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 36024 steps (187 resets) in 74 ms. (480 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 204 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 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 2458 ms.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Product exploration explored 100000 steps with 1 reset in 118 ms.
Built C files in :
/tmp/ltsmin9209046025623007434
[2026-05-27 02:12:14] [INFO ] Computing symmetric may disable matrix : 591 transitions.
[2026-05-27 02:12:14] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:12:14] [INFO ] Computing symmetric may enable matrix : 591 transitions.
[2026-05-27 02:12:14] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:12:14] [INFO ] Computing Do-Not-Accords matrix : 591 transitions.
[2026-05-27 02:12:14] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:12:14] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9209046025623007434
Running compilation step : cd /tmp/ltsmin9209046025623007434;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2465 ms.
Running link step : cd /tmp/ltsmin9209046025623007434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9209046025623007434;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6774426005322319545.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 591/591 transitions.
Applied a total of 0 rules in 22 ms. Remains 199 /199 variables (removed 0) and now considering 591/591 (removed 0) transitions.
[2026-05-27 02:12:29] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
[2026-05-27 02:12:29] [INFO ] Invariant cache hit.
[2026-05-27 02:12:29] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-27 02:12:29] [INFO ] Flow matrix only has 562 transitions (discarded 29 similar events)
[2026-05-27 02:12:29] [INFO ] Invariant cache hit.
[2026-05-27 02:12:30] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-27 02:12:30] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2026-05-27 02:12:30] [INFO ] Redundant transitions in 43 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1627 ms. Remains : 199/199 places, 591/591 transitions.
Built C files in :
/tmp/ltsmin2525727671808569253
[2026-05-27 02:12:30] [INFO ] Computing symmetric may disable matrix : 591 transitions.
[2026-05-27 02:12:30] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:12:30] [INFO ] Computing symmetric may enable matrix : 591 transitions.
[2026-05-27 02:12:30] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:12:31] [INFO ] Computing Do-Not-Accords matrix : 591 transitions.
[2026-05-27 02:12:31] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:12:31] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2525727671808569253
Running compilation step : cd /tmp/ltsmin2525727671808569253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2969 ms.
Running link step : cd /tmp/ltsmin2525727671808569253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin2525727671808569253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11246396969084262650.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 02:12:46] [INFO ] Flatten gal took : 65 ms
[2026-05-27 02:12:46] [INFO ] Flatten gal took : 58 ms
[2026-05-27 02:12:46] [INFO ] Time to serialize gal into /tmp/LTL6664725194667476360.gal : 6 ms
[2026-05-27 02:12:46] [INFO ] Time to serialize properties into /tmp/LTL3855864898495121111.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/LTL6664725194667476360.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12955076266254165679.hoa' '-atoms' '/tmp/LTL3855864898495121111.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/LTL3855864898495121111.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12955076266254165679.hoa
Detected timeout of ITS tools.
[2026-05-27 02:13:01] [INFO ] Flatten gal took : 18 ms
[2026-05-27 02:13:01] [INFO ] Flatten gal took : 18 ms
[2026-05-27 02:13:01] [INFO ] Time to serialize gal into /tmp/LTL5295208345231511513.gal : 5 ms
[2026-05-27 02:13:01] [INFO ] Time to serialize properties into /tmp/LTL13422254023487458334.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/LTL5295208345231511513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13422254023487458334.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p402==0)||(p461==1))")||(G("((p453==0)||(p504==1))"))))))
Formula 0 simplified : G(F!"((p453==0)||(p504==1))" & FG!"((p402==0)||(p461==1))")
Detected timeout of ITS tools.
[2026-05-27 02:13:16] [INFO ] Flatten gal took : 26 ms
[2026-05-27 02:13:16] [INFO ] Applying decomposition
[2026-05-27 02:13:16] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10120161395687630978.txt' '-o' '/tmp/graph10120161395687630978.bin' '-w' '/tmp/graph10120161395687630978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10120161395687630978.bin' '-l' '-1' '-v' '-w' '/tmp/graph10120161395687630978.weights' '-q' '0' '-e' '0.001'
[2026-05-27 02:13:16] [INFO ] Decomposing Gal with order
[2026-05-27 02:13:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 02:13:16] [INFO ] Removed a total of 812 redundant transitions.
[2026-05-27 02:13:16] [INFO ] Flatten gal took : 76 ms
[2026-05-27 02:13:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 267 labels/synchronizations in 32 ms.
[2026-05-27 02:13:16] [INFO ] Time to serialize gal into /tmp/LTL10494432006837833170.gal : 9 ms
[2026-05-27 02:13:16] [INFO ] Time to serialize properties into /tmp/LTL9390411117968336197.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/LTL10494432006837833170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9390411117968336197.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(("((i6.u40.p402==0)||(i7.u54.p461==1))")||(G("((i7.u45.p453==0)||(i2.u5.p504==1))"))))))
Formula 0 simplified : G(F!"((i7.u45.p453==0)||(i2.u5.p504==1))" & FG!"((i6.u40.p402==0)||(i7.u54.p461==1))")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-19-LTLCardinality-02 finished in 148362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Graph (trivial) has 341 edges and 435 vertex of which 18 / 435 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 419 transition count 685
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 82 rules applied. Total rules applied 156 place count 346 transition count 676
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 161 place count 341 transition count 676
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 161 place count 341 transition count 633
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 247 place count 298 transition count 633
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 255 place count 290 transition count 595
Iterating global reduction 3 with 8 rules applied. Total rules applied 263 place count 290 transition count 595
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 3 with 2 rules applied. Total rules applied 265 place count 290 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 266 place count 289 transition count 593
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 266 place count 289 transition count 590
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 272 place count 286 transition count 590
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 273 place count 285 transition count 587
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 285 transition count 587
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 356 place count 244 transition count 546
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 357 place count 243 transition count 516
Iterating global reduction 5 with 1 rules applied. Total rules applied 358 place count 243 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 243 transition count 515
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 455 place count 195 transition count 663
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 6 with 63 rules applied. Total rules applied 518 place count 195 transition count 600
Applied a total of 518 rules in 74 ms. Remains 195 /435 variables (removed 240) and now considering 600/775 (removed 175) transitions.
[2026-05-27 02:13:31] [INFO ] Flow matrix only has 571 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3342732565509549998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6878032695870607346.kers'
[2026-05-27 02:13:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3342732565509549998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6878032695870607346.kers]
Normalized transition count is 570 out of 571 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 570 rows 195 cols 2274 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-27 02:13:31] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6878032695870607346.kers
Total runtime 5 ms.
[2026-05-27 02:13:32] [INFO ] Implicit Places using invariants in 279 ms returned []
[2026-05-27 02:13:32] [INFO ] Flow matrix only has 571 transitions (discarded 29 similar events)
[2026-05-27 02:13:32] [INFO ] Invariant cache hit.
[2026-05-27 02:13:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-27 02:13:33] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2026-05-27 02:13:33] [INFO ] Redundant transitions in 109 ms returned []
Running 572 sub problems to find dead transitions.
[2026-05-27 02:13:33] [INFO ] Flow matrix only has 571 transitions (discarded 29 similar events)
[2026-05-27 02:13:33] [INFO ] Invariant cache hit.
[2026-05-27 02:13:33] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (OVERLAPS) 570/765 variables, 195/214 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 66/280 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/766 variables, and 280 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (OVERLAPS) 570/765 variables, 195/214 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 66/280 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 572/852 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/766 variables, and 852 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60418ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 60421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/435 places, 600/775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62078 ms. Remains : 195/435 places, 600/775 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 118 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-03 finished in 62243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 425 transition count 764
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 425 transition count 764
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 425 transition count 762
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 421 transition count 727
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 420 transition count 726
Applied a total of 32 rules in 41 ms. Remains 420 /435 variables (removed 15) and now considering 726/775 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8223230610892836904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5940647275170854802.kers'
[2026-05-27 02:14:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8223230610892836904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5940647275170854802.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 726 rows 420 cols 2226 entries
Finished phase 1 with 410 SingleSign rule and 0 generalized
[2026-05-27 02:14:34] [INFO ] Computed 10 invariants in 5 ms
Computed 10 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5940647275170854802.kers
Total runtime 7 ms.
[2026-05-27 02:14:34] [INFO ] Implicit Places using invariants in 502 ms returned []
[2026-05-27 02:14:34] [INFO ] Invariant cache hit.
[2026-05-27 02:14:35] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
Running 725 sub problems to find dead transitions.
[2026-05-27 02:14:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1146 variables, and 12 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1146 variables, and 21 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 0/725 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in LTL mode, iteration 1 : 420/435 places, 726/775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62038 ms. Remains : 420/435 places, 726/775 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-04
Product exploration explored 100000 steps with 1 reset in 112 ms.
Product exploration explored 100000 steps with 1 reset in 183 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge based reduction with 9 factoid took 68 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 40000 steps (12 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (10 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 746479 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :0 out of 1
Probabilistic random walk after 746479 steps, saw 129586 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
[2026-05-27 02:15:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/369 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 672/1041 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/1068 variables, 12/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1098 variables, 15/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1098 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/1116 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/1137 variables, 9/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1137 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/1146 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1146 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1146 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/369 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 672/1041 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1041 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/1068 variables, 12/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1068 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1098 variables, 15/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1098 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/1116 variables, 9/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 21/1137 variables, 9/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1137 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 9/1146 variables, 6/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1146 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1146 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1290 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1939ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 726/726 transitions.
Graph (trivial) has 324 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 405 transition count 633
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 334 transition count 627
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 331 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 330 transition count 626
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 154 place count 330 transition count 580
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 246 place count 284 transition count 580
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 248 place count 282 transition count 549
Iterating global reduction 4 with 2 rules applied. Total rules applied 250 place count 282 transition count 549
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 282 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 251 place count 282 transition count 547
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 281 transition count 547
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 337 place count 239 transition count 505
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -121
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 425 place count 195 transition count 626
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 434 place count 195 transition count 617
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 6 with 52 rules applied. Total rules applied 486 place count 195 transition count 565
Free-agglomeration rule applied 30 times.
Iterating global reduction 6 with 30 rules applied. Total rules applied 516 place count 195 transition count 535
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 39 rules applied. Total rules applied 555 place count 165 transition count 526
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 7 with 79 rules applied. Total rules applied 634 place count 165 transition count 447
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 637 place count 165 transition count 447
Applied a total of 637 rules in 134 ms. Remains 165 /420 variables (removed 255) and now considering 447/726 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 165/420 places, 447/726 transitions.
RANDOM walk for 8953 steps (352 resets) in 30 ms. (288 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G p1)
Knowledge based reduction with 9 factoid took 46 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 5307 ms.
FORMULA FireWire-PT-19-LTLCardinality-04 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property FireWire-PT-19-LTLCardinality-04 finished in 67874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Graph (trivial) has 338 edges and 435 vertex of which 18 / 435 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 419 transition count 687
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 78 rules applied. Total rules applied 150 place count 348 transition count 680
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 154 place count 344 transition count 680
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 154 place count 344 transition count 636
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 242 place count 300 transition count 636
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 249 place count 293 transition count 600
Iterating global reduction 3 with 7 rules applied. Total rules applied 256 place count 293 transition count 600
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 3 with 2 rules applied. Total rules applied 258 place count 293 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 292 transition count 598
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 259 place count 292 transition count 595
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 265 place count 289 transition count 595
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 266 place count 288 transition count 592
Iterating global reduction 5 with 1 rules applied. Total rules applied 267 place count 288 transition count 592
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 353 place count 245 transition count 549
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 354 place count 244 transition count 519
Iterating global reduction 5 with 1 rules applied. Total rules applied 355 place count 244 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 356 place count 244 transition count 518
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -153
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 450 place count 197 transition count 671
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 6 with 57 rules applied. Total rules applied 507 place count 197 transition count 614
Applied a total of 507 rules in 109 ms. Remains 197 /435 variables (removed 238) and now considering 614/775 (removed 161) transitions.
[2026-05-27 02:15:41] [INFO ] Flow matrix only has 588 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15293158535635990977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14037854846652601654.kers'
[2026-05-27 02:15:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15293158535635990977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14037854846652601654.kers]
Normalized transition count is 587 out of 588 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 587 rows 197 cols 2407 entries
Finished phase 1 with 187 SingleSign rule and 0 generalized
[2026-05-27 02:15:41] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14037854846652601654.kers
Total runtime 4 ms.
[2026-05-27 02:15:42] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-27 02:15:42] [INFO ] Flow matrix only has 588 transitions (discarded 26 similar events)
[2026-05-27 02:15:42] [INFO ] Invariant cache hit.
[2026-05-27 02:15:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-27 02:15:42] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2026-05-27 02:15:43] [INFO ] Redundant transitions in 124 ms returned []
Running 577 sub problems to find dead transitions.
[2026-05-27 02:15:43] [INFO ] Flow matrix only has 588 transitions (discarded 26 similar events)
[2026-05-27 02:15:43] [INFO ] Invariant cache hit.
[2026-05-27 02:15:43] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (OVERLAPS) 587/784 variables, 197/214 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 68/282 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/785 variables, and 282 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (OVERLAPS) 587/784 variables, 197/214 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 68/282 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 577/859 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/785 variables, and 859 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/435 places, 614/775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61537 ms. Remains : 197/435 places, 614/775 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 58 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-05
Product exploration explored 100000 steps with 3 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Computed a total of 9 stabilizing places and 50 stable transitions
Computed a total of 9 stabilizing places and 50 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2338 resets) in 279 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 38194 steps (302 resets) in 47 ms. (795 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Knowledge-based reduction took 314 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 614/614 transitions.
Applied a total of 0 rules in 15 ms. Remains 197 /197 variables (removed 0) and now considering 614/614 (removed 0) transitions.
[2026-05-27 02:16:44] [INFO ] Flow matrix only has 588 transitions (discarded 26 similar events)
[2026-05-27 02:16:44] [INFO ] Invariant cache hit.
[2026-05-27 02:16:44] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-27 02:16:44] [INFO ] Flow matrix only has 588 transitions (discarded 26 similar events)
[2026-05-27 02:16:44] [INFO ] Invariant cache hit.
[2026-05-27 02:16:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-27 02:16:45] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
[2026-05-27 02:16:45] [INFO ] Redundant transitions in 180 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1622 ms. Remains : 197/197 places, 614/614 transitions.
Computed a total of 9 stabilizing places and 50 stable transitions
Computed a total of 9 stabilizing places and 50 stable transitions
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2315 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 29457 steps (227 resets) in 30 ms. (950 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Knowledge-based reduction took 271 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 105 ms.
Product exploration explored 100000 steps with 3 reset in 120 ms.
Built C files in :
/tmp/ltsmin15163818606367755891
[2026-05-27 02:16:46] [INFO ] Computing symmetric may disable matrix : 614 transitions.
[2026-05-27 02:16:46] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:16:46] [INFO ] Computing symmetric may enable matrix : 614 transitions.
[2026-05-27 02:16:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:16:46] [INFO ] Computing Do-Not-Accords matrix : 614 transitions.
[2026-05-27 02:16:46] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:16:46] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15163818606367755891
Running compilation step : cd /tmp/ltsmin15163818606367755891;'/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/ltsmin15163818606367755891;'/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/ltsmin15163818606367755891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 614/614 transitions.
Applied a total of 0 rules in 14 ms. Remains 197 /197 variables (removed 0) and now considering 614/614 (removed 0) transitions.
[2026-05-27 02:16:49] [INFO ] Flow matrix only has 588 transitions (discarded 26 similar events)
[2026-05-27 02:16:49] [INFO ] Invariant cache hit.
[2026-05-27 02:16:49] [INFO ] Implicit Places using invariants in 351 ms returned []
[2026-05-27 02:16:49] [INFO ] Flow matrix only has 588 transitions (discarded 26 similar events)
[2026-05-27 02:16:49] [INFO ] Invariant cache hit.
[2026-05-27 02:16:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-27 02:16:50] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2026-05-27 02:16:51] [INFO ] Redundant transitions in 195 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1665 ms. Remains : 197/197 places, 614/614 transitions.
Built C files in :
/tmp/ltsmin10423399504871959996
[2026-05-27 02:16:51] [INFO ] Computing symmetric may disable matrix : 614 transitions.
[2026-05-27 02:16:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:16:51] [INFO ] Computing symmetric may enable matrix : 614 transitions.
[2026-05-27 02:16:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:16:51] [INFO ] Computing Do-Not-Accords matrix : 614 transitions.
[2026-05-27 02:16:51] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:16:51] [INFO ] Built C files in 149ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10423399504871959996
Running compilation step : cd /tmp/ltsmin10423399504871959996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2700 ms.
Running link step : cd /tmp/ltsmin10423399504871959996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin10423399504871959996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13654657082296582656.hoa' '--buchi-type=spotba'
LTSmin run took 7238 ms.
FORMULA FireWire-PT-19-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-19-LTLCardinality-05 finished in 79510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 424 transition count 763
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 424 transition count 763
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 424 transition count 761
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 420 transition count 726
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 419 transition count 725
Applied a total of 34 rules in 24 ms. Remains 419 /435 variables (removed 16) and now considering 725/775 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2392039811418184839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4085411121144142982.kers'
[2026-05-27 02:17:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2392039811418184839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4085411121144142982.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 725 rows 419 cols 2224 entries
Finished phase 1 with 409 SingleSign rule and 0 generalized
[2026-05-27 02:17:01] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4085411121144142982.kers
Total runtime 5 ms.
[2026-05-27 02:17:01] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-05-27 02:17:01] [INFO ] Invariant cache hit.
[2026-05-27 02:17:02] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2026-05-27 02:17:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1144 variables, and 17 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1144 variables, and 21 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 0/724 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60221ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 419/435 places, 725/775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61523 ms. Remains : 419/435 places, 725/775 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-06 finished in 61752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 424 transition count 763
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 424 transition count 763
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 424 transition count 761
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 421 transition count 727
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 420 transition count 726
Applied a total of 32 rules in 38 ms. Remains 420 /435 variables (removed 15) and now considering 726/775 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12967281339838416361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-452788930371113511.kers'
[2026-05-27 02:18:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12967281339838416361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-452788930371113511.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 726 rows 420 cols 2226 entries
Finished phase 1 with 410 SingleSign rule and 0 generalized
[2026-05-27 02:18:03] [INFO ] Computed 10 invariants in 5 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-452788930371113511.kers
Total runtime 7 ms.
[2026-05-27 02:18:03] [INFO ] Implicit Places using invariants in 512 ms returned []
[2026-05-27 02:18:03] [INFO ] Invariant cache hit.
[2026-05-27 02:18:04] [INFO ] Implicit Places using invariants and state equation in 1015 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Running 725 sub problems to find dead transitions.
[2026-05-27 02:18:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1146 variables, and 13 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 725/725 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 725 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/1146 variables, and 16 constraints, problems are : Problem set: 0 solved, 725 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 0/725 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 725 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 420/435 places, 726/775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61750 ms. Remains : 420/435 places, 726/775 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&p0))))'
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-11
Product exploration explored 100000 steps with 33303 reset in 246 ms.
Product exploration explored 100000 steps with 33232 reset in 257 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (14 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (13 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 739603 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 1
Probabilistic random walk after 739603 steps, saw 128287 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
[2026-05-27 02:19:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/369 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 672/1041 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/1068 variables, 12/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1098 variables, 15/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1098 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/1116 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/1137 variables, 9/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1137 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/1146 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1146 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1146 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/369 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 672/1041 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/1068 variables, 12/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1068 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/1098 variables, 15/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1098 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/1116 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 21/1137 variables, 9/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1137 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1146 variables, 6/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1146 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1146 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 431 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1752ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 726/726 transitions.
Graph (trivial) has 325 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 405 transition count 633
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 334 transition count 627
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 331 transition count 627
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 152 place count 331 transition count 580
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 246 place count 284 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 247 place count 283 transition count 550
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 283 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 283 transition count 549
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 333 place count 241 transition count 507
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -129
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 423 place count 196 transition count 636
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 432 place count 196 transition count 627
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 5 with 54 rules applied. Total rules applied 486 place count 196 transition count 573
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 516 place count 196 transition count 543
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 555 place count 166 transition count 534
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 6 with 84 rules applied. Total rules applied 639 place count 166 transition count 450
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 642 place count 166 transition count 450
Applied a total of 642 rules in 68 ms. Remains 166 /420 variables (removed 254) and now considering 450/726 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 166/420 places, 450/726 transitions.
RANDOM walk for 6699 steps (247 resets) in 40 ms. (163 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 5256 ms.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 726/726 transitions.
Applied a total of 0 rules in 7 ms. Remains 420 /420 variables (removed 0) and now considering 726/726 (removed 0) transitions.
[2026-05-27 02:19:11] [INFO ] Invariant cache hit.
[2026-05-27 02:19:11] [INFO ] Implicit Places using invariants in 411 ms returned []
[2026-05-27 02:19:11] [INFO ] Invariant cache hit.
[2026-05-27 02:19:12] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1251 ms. Remains : 420/420 places, 726/726 transitions.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (15 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (26 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 885734 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 1
Probabilistic random walk after 885734 steps, saw 149929 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :0
[2026-05-27 02:19:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/369 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 672/1041 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/1068 variables, 12/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 30/1098 variables, 15/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1098 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/1116 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 21/1137 variables, 9/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1137 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/1146 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1146 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1146 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 163/165 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/369 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 672/1041 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1041 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1041 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/1068 variables, 12/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1068 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 30/1098 variables, 15/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1098 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/1116 variables, 9/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 21/1137 variables, 9/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1137 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1146 variables, 6/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1146 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1146 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 431 constraints, problems are : Problem set: 0 solved, 1 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1300ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 726/726 transitions.
Graph (trivial) has 325 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 405 transition count 633
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 334 transition count 627
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 331 transition count 627
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 152 place count 331 transition count 580
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 246 place count 284 transition count 580
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 247 place count 283 transition count 550
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 283 transition count 550
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 283 transition count 549
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 333 place count 241 transition count 507
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -129
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 423 place count 196 transition count 636
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 432 place count 196 transition count 627
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 5 with 54 rules applied. Total rules applied 486 place count 196 transition count 573
Free-agglomeration rule applied 30 times.
Iterating global reduction 5 with 30 rules applied. Total rules applied 516 place count 196 transition count 543
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 555 place count 166 transition count 534
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 6 with 84 rules applied. Total rules applied 639 place count 166 transition count 450
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 642 place count 166 transition count 450
Applied a total of 642 rules in 59 ms. Remains 166 /420 variables (removed 254) and now considering 450/726 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 166/420 places, 450/726 transitions.
RANDOM walk for 13432 steps (551 resets) in 46 ms. (285 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 3 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 4706 ms.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33180 reset in 151 ms.
Product exploration explored 100000 steps with 33287 reset in 169 ms.
Spot run failed in 84 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10772118447956875363
[2026-05-27 02:19:17] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10772118447956875363
Running compilation step : cd /tmp/ltsmin10772118447956875363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2243 ms.
Running link step : cd /tmp/ltsmin10772118447956875363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin10772118447956875363;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased13347897648070649540.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 726/726 transitions.
Applied a total of 0 rules in 6 ms. Remains 420 /420 variables (removed 0) and now considering 726/726 (removed 0) transitions.
[2026-05-27 02:19:32] [INFO ] Invariant cache hit.
[2026-05-27 02:19:32] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-27 02:19:33] [INFO ] Invariant cache hit.
[2026-05-27 02:19:34] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1521 ms. Remains : 420/420 places, 726/726 transitions.
Built C files in :
/tmp/ltsmin14219653190167229028
[2026-05-27 02:19:34] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14219653190167229028
Running compilation step : cd /tmp/ltsmin14219653190167229028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2198 ms.
Running link step : cd /tmp/ltsmin14219653190167229028;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14219653190167229028;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10930639209312221059.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-27 02:19:49] [INFO ] Flatten gal took : 16 ms
[2026-05-27 02:19:49] [INFO ] Flatten gal took : 15 ms
[2026-05-27 02:19:49] [INFO ] Time to serialize gal into /tmp/LTL13641378248096936716.gal : 7 ms
[2026-05-27 02:19:49] [INFO ] Time to serialize properties into /tmp/LTL11001182731084268619.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/LTL13641378248096936716.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11530042122317034090.hoa' '-atoms' '/tmp/LTL11001182731084268619.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11001182731084268619.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11530042122317034090.hoa
Detected timeout of ITS tools.
[2026-05-27 02:20:04] [INFO ] Flatten gal took : 16 ms
[2026-05-27 02:20:04] [INFO ] Flatten gal took : 15 ms
[2026-05-27 02:20:04] [INFO ] Time to serialize gal into /tmp/LTL8463947847042976577.gal : 5 ms
[2026-05-27 02:20:04] [INFO ] Time to serialize properties into /tmp/LTL8930884612463717980.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/LTL8463947847042976577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8930884612463717980.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((X("((p503==0)||(p364==1))"))&&("((p503==0)||(p364==1))")))))
Formula 0 simplified : FG(!"((p503==0)||(p364==1))" | X!"((p503==0)||(p364==1))")
Detected timeout of ITS tools.
[2026-05-27 02:20:19] [INFO ] Flatten gal took : 24 ms
[2026-05-27 02:20:19] [INFO ] Applying decomposition
[2026-05-27 02:20:19] [INFO ] Flatten gal took : 25 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/graph6353288052165579095.txt' '-o' '/tmp/graph6353288052165579095.bin' '-w' '/tmp/graph6353288052165579095.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6353288052165579095.bin' '-l' '-1' '-v' '-w' '/tmp/graph6353288052165579095.weights' '-q' '0' '-e' '0.001'
[2026-05-27 02:20:19] [INFO ] Decomposing Gal with order
[2026-05-27 02:20:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 02:20:19] [INFO ] Removed a total of 785 redundant transitions.
[2026-05-27 02:20:19] [INFO ] Flatten gal took : 39 ms
[2026-05-27 02:20:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 8 ms.
[2026-05-27 02:20:19] [INFO ] Time to serialize gal into /tmp/LTL4538184110425968993.gal : 7 ms
[2026-05-27 02:20:19] [INFO ] Time to serialize properties into /tmp/LTL15259178537959841202.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/LTL4538184110425968993.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15259178537959841202.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((X("((i10.u120.p503==0)||(i6.u95.p364==1))"))&&("((i10.u120.p503==0)||(i6.u95.p364==1))")))))
Formula 0 simplified : FG(!"((i10.u120.p503==0)||(i6.u95.p364==1))" | X!"((i10.u120.p503==0)||(i6.u95.p364==1))")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-19-LTLCardinality-11 finished in 151662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U (X(p1)&&F(p0)))))'
Support contains 4 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 424 transition count 763
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 424 transition count 763
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 424 transition count 761
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 420 transition count 726
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 419 transition count 725
Applied a total of 34 rules in 36 ms. Remains 419 /435 variables (removed 16) and now considering 725/775 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17429751965082912090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16335110488251435723.kers'
[2026-05-27 02:20:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17429751965082912090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16335110488251435723.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 725 rows 419 cols 2224 entries
Finished phase 1 with 409 SingleSign rule and 0 generalized
[2026-05-27 02:20:34] [INFO ] Computed 10 invariants in 5 ms
Computed 10 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16335110488251435723.kers
Total runtime 7 ms.
[2026-05-27 02:20:35] [INFO ] Implicit Places using invariants in 378 ms returned []
[2026-05-27 02:20:35] [INFO ] Invariant cache hit.
[2026-05-27 02:20:36] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2026-05-27 02:20:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1144 variables, and 16 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/1144 variables, and 20 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 0/724 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in LTL mode, iteration 1 : 419/435 places, 725/775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61663 ms. Remains : 419/435 places, 725/775 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U (X(p1)&&F(p0)))))'
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 12 ms. Proved property starting from automaton with 8 states, 17 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA FireWire-PT-19-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-19-LTLCardinality-12 finished in 62731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Graph (trivial) has 339 edges and 435 vertex of which 18 / 435 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 419 transition count 685
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 82 rules applied. Total rules applied 156 place count 346 transition count 676
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 161 place count 341 transition count 676
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 161 place count 341 transition count 634
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 245 place count 299 transition count 634
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 252 place count 292 transition count 597
Iterating global reduction 3 with 7 rules applied. Total rules applied 259 place count 292 transition count 597
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 3 with 2 rules applied. Total rules applied 261 place count 292 transition count 595
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 291 transition count 595
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 262 place count 291 transition count 593
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 266 place count 289 transition count 593
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 352 place count 246 transition count 550
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 353 place count 245 transition count 520
Iterating global reduction 5 with 1 rules applied. Total rules applied 354 place count 245 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 245 transition count 519
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 451 place count 197 transition count 667
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 6 with 63 rules applied. Total rules applied 514 place count 197 transition count 604
Applied a total of 514 rules in 49 ms. Remains 197 /435 variables (removed 238) and now considering 604/775 (removed 171) transitions.
[2026-05-27 02:21:37] [INFO ] Flow matrix only has 575 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1195914601703180362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6400624528359181756.kers'
[2026-05-27 02:21:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1195914601703180362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6400624528359181756.kers]
Normalized transition count is 574 out of 575 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 574 rows 197 cols 2288 entries
Finished phase 1 with 187 SingleSign rule and 0 generalized
[2026-05-27 02:21:37] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6400624528359181756.kers
Total runtime 3 ms.
[2026-05-27 02:21:37] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-27 02:21:37] [INFO ] Flow matrix only has 575 transitions (discarded 29 similar events)
[2026-05-27 02:21:37] [INFO ] Invariant cache hit.
[2026-05-27 02:21:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-27 02:21:38] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2026-05-27 02:21:38] [INFO ] Redundant transitions in 131 ms returned []
Running 576 sub problems to find dead transitions.
[2026-05-27 02:21:38] [INFO ] Flow matrix only has 575 transitions (discarded 29 similar events)
[2026-05-27 02:21:38] [INFO ] Invariant cache hit.
[2026-05-27 02:21:38] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (OVERLAPS) 574/771 variables, 197/213 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/771 variables, 66/279 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 771/772 variables, and 279 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (OVERLAPS) 574/771 variables, 197/213 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/771 variables, 66/279 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/771 variables, 576/855 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 771/772 variables, and 855 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60438ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/435 places, 604/775 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61608 ms. Remains : 197/435 places, 604/775 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 46 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-13 finished in 61688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 435 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 435/435 places, 775/775 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 423 transition count 762
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 423 transition count 762
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 423 transition count 760
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 418 transition count 724
Applied a total of 36 rules in 20 ms. Remains 418 /435 variables (removed 17) and now considering 724/775 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-300795550447440940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15218502643960356205.kers'
[2026-05-27 02:22:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-300795550447440940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15218502643960356205.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 724 rows 418 cols 2222 entries
Finished phase 1 with 408 SingleSign rule and 0 generalized
[2026-05-27 02:22:39] [INFO ] Computed 10 invariants in 6 ms
Computed 10 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15218502643960356205.kers
Total runtime 8 ms.
[2026-05-27 02:22:39] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-27 02:22:39] [INFO ] Invariant cache hit.
[2026-05-27 02:22:40] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2026-05-27 02:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 19 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1142 variables, and 21 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 0/723 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 418/435 places, 724/775 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61543 ms. Remains : 418/435 places, 724/775 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-19-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLCardinality-14 finished in 61729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!X(!p0)) U p0)))'
Spot run failed in 58 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)))))'
Spot run failed in 77 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-27 02:23:41] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17180345654788886278
[2026-05-27 02:23:41] [INFO ] Computing symmetric may disable matrix : 775 transitions.
[2026-05-27 02:23:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:23:41] [INFO ] Computing symmetric may enable matrix : 775 transitions.
[2026-05-27 02:23:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:23:41] [INFO ] Applying decomposition
[2026-05-27 02:23:41] [INFO ] Flatten gal took : 26 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/graph15451082578990258485.txt' '-o' '/tmp/graph15451082578990258485.bin' '-w' '/tmp/graph15451082578990258485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15451082578990258485.bin' '-l' '-1' '-v' '-w' '/tmp/graph15451082578990258485.weights' '-q' '0' '-e' '0.001'
[2026-05-27 02:23:41] [INFO ] Decomposing Gal with order
[2026-05-27 02:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 02:23:41] [INFO ] Computing Do-Not-Accords matrix : 775 transitions.
[2026-05-27 02:23:41] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 02:23:41] [INFO ] Built C files in 205ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17180345654788886278
Running compilation step : cd /tmp/ltsmin17180345654788886278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-27 02:23:41] [INFO ] Removed a total of 853 redundant transitions.
[2026-05-27 02:23:41] [INFO ] Flatten gal took : 64 ms
[2026-05-27 02:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 32 ms.
[2026-05-27 02:23:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality17219574284779725141.gal : 10 ms
[2026-05-27 02:23:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality2330502066307123991.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/LTLCardinality17219574284779725141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2330502066307123991.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G((X(!(X(!("((i0.u10.p38==0)||(i2.u17.p61==1))")))))U("((i0.u10.p38==0)||(i2.u17.p61==1))"))))
Formula 0 simplified : F(!"((i0.u10.p38==0)||(i2.u17.p61==1))" & X(!"((i0.u10.p38==0)||(i2.u17.p61==1))" W X!"((i0.u10.p38==0)||(i2.u17.p61==1))"))
Compilation finished in 3423 ms.
Running link step : cd /tmp/ltsmin17180345654788886278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17180345654788886278;'/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(!(LTLAPp0==true))) U (LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17180345654788886278;'/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(!(LTLAPp0==true))) U (LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17180345654788886278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17180345654788886278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp2==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17180345654788886278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((LTLAPp3==true)&&X((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17180345654788886278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](<>(((LTLAPp3==true)&&X((LTLAPp3==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin17180345654788886278;'/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(!(LTLAPp0==true))) U (LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t25, t126, t225, t335, t346, t347, t348, t356, t357, t358, t359, t361, t382, t384, t385, t400...1891
Computing Next relation with stutter on 3.18874e+09 deadlock states
Detected timeout of ITS tools.
[2026-05-27 02:49:30] [INFO ] Applying decomposition
[2026-05-27 02:49:30] [INFO ] Flatten gal took : 18 ms
[2026-05-27 02:49:30] [INFO ] Decomposing Gal with order
[2026-05-27 02:49:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 02:49:30] [INFO ] Removed a total of 638 redundant transitions.
[2026-05-27 02:49:30] [INFO ] Flatten gal took : 89 ms
[2026-05-27 02:49:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 571 labels/synchronizations in 10 ms.
[2026-05-27 02:49:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality16482200434244350453.gal : 4 ms
[2026-05-27 02:49:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality13429869567069068112.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/LTLCardinality16482200434244350453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13429869567069068112.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((G((X(!(X(!("((u1.p38==0)||(u1.p61==1))")))))U("((u1.p38==0)||(u1.p61==1))"))))
Formula 0 simplified : F(!"((u1.p38==0)||(u1.p61==1))" & X(!"((u1.p38==0)||(u1.p61==1))" W X!"((u1.p38==0)||(u1.p61==1))"))
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-19"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FireWire-PT-19, examination is LTLCardinality"
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-177955809000291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;